Re:Mathematicians uncover a new way to count prime numbers
by skissane on Friday December 13, 2024 @04:41AM
(#42407242)
> Prime numbers are used in cryptography. Public-private key cryptography is based on the fact that is hard to find the original two large prime numbers
That's true of one particular – albeit very popular – asymmetric cryptosystem, RSA. It isn't a property of asymmetric cryptography in general. There are other asymmetric encryption schemes which aren't based on the hardness of prime factorisation (e.g. DSA, elliptic curves, McEliece, NTRU)
That's true of one particular – albeit very popular – asymmetric cryptosystem, RSA. It isn't a property of asymmetric cryptography in general. There are other asymmetric encryption schemes which aren't based on the hardness of prime factorisation (e.g. DSA, elliptic curves, McEliece, NTRU)