On using primes for public key encryption systems

From MaRDI portal





It is shown that the popular RSA public key encryption scheme does not require two primes but that probable primes may be used instead. A method for finding probable primes is given and the security of systems based on probable primes is discussed.











This page was built for publication: On using primes for public key encryption systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109750)