Efficient method for generating strong primes with constraint of bit length

DOI10.1049/EL:19911123MaRDI QIDQ3363234zbMATH OpenOpenAlexFDO

Authors Chi-Sung Laih, Wencheng Yang, Chun-Hung Chen

Publication date 1991

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19911123

zbMATH Keywords

RSA public key cryptosystemstrong primes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Generating strong primes in RSA cryptosystems
• Strong Primes are Easy to Find
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• scientific article; zbMATH DE number 1759305
• scientific article; zbMATH DE number 16481

Cited in

(6)

• Generating strong primes in RSA cryptosystems
• Optimal strong primes
• Generating Provable Primes Efficiently on Embedded Devices
• Strong Primes are Easy to Find
• A simple approach for generating RSA keys
• Efficient address generation for prime factor algorithms (digital signal processing)

This page was built for publication: Efficient method for generating strong primes with constraint of bit length

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