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.
Recommendations
Cites work
Cited in
(11)- Prime-number algorithm for public-key systems
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Primeless factoring-based cryptography. Solving the complexity bottleneck of public-key generation
- Proof Checking the RSA Public Key Encryption Algorithm
- New authentication encryption scheme based on AES and Three-Prime RPrime RSA
- On using Mersenne primes in the public-key encryption
- scientific article; zbMATH DE number 4139669 (Why is no real title available?)
- scientific article; zbMATH DE number 3939411 (Why is no real title available?)
- scientific article; zbMATH DE number 1066853 (Why is no real title available?)
- Applying evolutionary algorithm to public key cryptosystems
- An efficient probabilistic encryption scheme
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)