News for hackers. Stuff that matters.

A comment on How I learned to love and fear the Riemann Hypothesis. Parent comment

Re:How I learned to love and fear the Riemann Hypothesis by Covzire on Tuesday January 05, 2021 @10:07AM (#25646240)
If one could predict with pinpoint accuracy all the prime numbers approaching infinity with certainty and with trivial resources (without having to test each one for prime-ness), would it have any impact on modern day cryptography?
[ Parent | on HN ]
Re:How I learned to love and fear the Riemann Hypothesis by bawolff on Tuesday January 05, 2021 @11:02AM (#25646875)
Not an expert, but the key thing is usually factoring, e.g. finding which prime numbers multiplied together make a certain composite number. The hard part is finding which are the right prime numbers (there are lots of prime numbers). Finding numbers that are prime,just generally,is a very quick operation already.
[ Parent | on HN ]
Re:How I learned to love and fear the Riemann Hypothesis by gameswithgo on Tuesday January 05, 2021 @10:52AM (#25646771)
Being able to find primes faster would make modern public key crypto better I guess, since you could find large keys faster and thus use larger keys.

Unless the theory also leads to faster factorization methods

[ Parent | on HN ]
Re:How I learned to love and fear the Riemann Hypothesis by simias on Tuesday January 05, 2021 @10:31AM (#25646519)
On RSA-style prime-based crypto potentially but barring a much stronger result than merely being able to cheaply find primes things like ECC would probably still be safe.
[ Parent | on HN ]