Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

People generate large primes using programs designed to do that, and maybe generators/primitive roots for those primes using a CAS like Sage or Octave/Matlab. The same goes for ECC crypto, with a lot of extra testing/filtering to find "nice" constants.

A lot of the other giant numbers you see in cryptosystems are random numbers derived from other constants.

Sometimes there are things to learn by studying the numbers themselves. For instance, the prime field in Curve25519 is a special prime with (bit-level) characteristics that make it especially nice to do math on with general-purpose computers. Other times, the numbers are, for instance, just giant random primes, and aren't themselves very interesting.



I see. Thank you, tptacek.

> People generate large primes using programs designed to do that

Do you mind to name one such program?


Well, anything that does RSA, right?

An easy way to do this yourself is to jump into a Ruby IRB and do "OpenSSL::BN.generate_prime(512).to_s".


If I remember right, this generates a number that is probably prime. :)


For values of "probably" that are effectively "certainly", yes.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: