On using primes for public key encryption systems

DOI10.1016/0893-9659(88)90081-XMaRDI QIDQ1109750zbMATH OpenFDO

Authors E. Dennis Huthnance, Joe Warndof

Publication date 1988

Published in Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

primesRSA public key encryptionsecurity of systems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Strong Primes are Easy to Find
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• scientific article; zbMATH DE number 16481
• Prime-number algorithm for public-key systems
• An efficient probabilistic encryption scheme

Cites work

• scientific article; zbMATH DE number 48877 (Why is no real title available?)
• A method for obtaining digital signatures and public-key cryptosystems

Cited in

(9)

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

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)