Primeshard
0:00.0
A prime p is called 'anomalous' if the order of p in Ep(Fp) (the elliptic curve group mod p) equals p. Why are anomalous primes cryptographically weak?
A prime p is called 'anomalous' if the order of p in Ep(Fp) (the elliptic curve group mod p) equals p. Why are anomalous primes cryptographically weak?