Re:Openssl: uses only 32 bytes (256 bit) for key generation
by vilda on Wednesday March 19, 2014 @08:01PM
(#7432803)
To add: not only you test for primality, but also for common attacks. Not all primes are equally strong
http://www.uow.edu.au/~jennie/WEB/WEB99/1999_07.pdf
[ Parent
| on HN ]
Re:Openssl: uses only 32 bytes (256 bit) for key generation
by pbsd on Wednesday March 19, 2014 @08:43PM
(#7433010)
For primes of current acceptable size (>= 1024 bits), you might as well drop those extra checks. The elliptic curve method gives you around 2^512 attempts at doing the exact same thing, each one with the same probability of having a smooth p-1 or p+1. The paper you link to reaches essentially the same conclusion.