This is pretty good! The arithmetic of elliptic curves gets very complex, but I like how you arrived at points on an elliptic curve just by defining groups and

This is pretty good! The arithmetic of elliptic curves gets very complex, but I like how you arrived at points on an elliptic curve just by defining groups and fields. It might be a slight improvement to give a short, Rudin-style explanation of the difference between a set and a field. You could do this from first principles of set theory without being so terse as to be incomprehensible or diving into the axioms; I think the stated goal of little math is fine for the audience, but at the same time such an audience might not immediately understand what “field = set with addition and multiplication defined on it” means. I think a small expansion of the treatment on why the ECDLP is hard would also be good. It's intuitively easy to follow that hard problems can exist, but maybe continue on in showing why this particular hardness assumption works for cryptography (because there are many that do not). Places to go from here if you enjoyed reading this and want to learn more about elliptic curves and cryptography related to them: 1. http://blog.bjrn.se/2015/07/lets-construct-elliptic-curve.html?m=1 http://blog.bjrn.se/2015/07/lets-construct-elliptic-curve.ht... More on an elliptic curve and constructing a hypothetical one. 2. https://medium.com/@VitalikButerin/exploring-elliptic-curve-pairings-c73c1864e627 https://medium.com/@VitalikButerin/exploring-elliptic-curve-... Elliptic curve pairings. 3. https://www.lvh.io/posts/supersingular-isogeny-diffie-hellman-101.html https://www.lvh.io/posts/supersingular-isogeny-diffie-hellma... An intro to supersingular isogeny cryptography, which has a basis in elliptic curves as a mathematical structure, but is fundamentally different from elliptic curve cryptography.