On using primes for public key encryption systems

DOI10.1016/0893-9659(88)90081-XzbMATH Open0655.94002MaRDI QIDQ1109750FDOQ1109750

Authors: E. Dennis Huthnance, Joe Warndof 

Publication date: 1988

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

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

zbMATH Keywords

primesRSA public key encryptionsecurity of systems

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• Title not available (Why is that?)

Cited In (9)

• Applying evolutionary algorithm to public key cryptosystems
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• An efficient probabilistic encryption scheme
• Primeless factoring-based cryptography. Solving the complexity bottleneck of public-key generation
• Title not available (Why is that?)
• Title not available (Why is that?)
• New authentication encryption scheme based on AES and Three-Prime RPrime RSA
• On using Mersenne primes in the public-key encryption
• 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)