On Tue, Aug 21, 2018 at 8:11 PM Bruce Kellett <[email protected]> wrote:
> From: Brent Meeker <[email protected]> > > > Quantum computers will certainly impact cryptography where there's heavy > reliance on factoring primes and discrete logarithms. > > > I am really interested in the problem of factoring primes. Will a quantum > computer help? > Yes, see: https://en.wikipedia.org/wiki/Shor%27s_algorithm New cryptographic algorithms are being developed which will presumably be immune to quantum computers: https://en.wikipedia.org/wiki/Post-quantum_cryptography All current asymmetric cryptography in wide use today (for verifying websites you go to are trusted, that software packages are correct, in securing confidential information between you and your bank and e-mail provider, e.g. in digital signature, public key encryption, and key agreement protocols) are vulnerable. This includes not only RSA <https://en.wikipedia.org/wiki/RSA_(cryptosystem)> whose security rests on factoring primes, but also the discrete logarithm problem which is the foundation of Diffie-Hellman <https://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange> key exchange and elliptic curve cryptography <https://en.wikipedia.org/wiki/Elliptic-curve_cryptography>. Jason -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
