Is it computationally difficult to find the exact number of points on an elliptic curve?
Tuesday, 24 June 2025
by Theresa Sittel
The computational difficulty of finding the exact number of points on an elliptic curve—often referred to as "point counting"—depends critically on the field over which the curve is defined and the particular properties of that field. This subject plays a significant role in the context of elliptic curve cryptography (ECC), where the security of cryptosystems
- Published in Cybersecurity, EITC/IS/ACC Advanced Classical Cryptography, Elliptic Curve Cryptography, Elliptic Curve Cryptography (ECC)
Tagged under:
Cryptographic Algorithms, Cybersecurity, Elliptic Curves, Finite Fields, Group Theory, Point Counting

