Generating RSA moduli with a predetermined portion

DOI10.1007/3-540-49649-1_1MaRDI QIDQ4249250zbMATH OpenFDO

Authors Arjen K. Lenstra

Publication date 17 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49649-1_1

zbMATH Keywords

RSA cryptosystemRSA moduli with predetermined portionsecurity

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• RSA Moduli with a Predetermined Portion: Techniques and Applications
• On RSA moduli with half of the bits prescribed
• Short RSA keys and their generation
• scientific article; zbMATH DE number 16481

Cited in

(15)

• On RSA moduli with almost half of the bits prescribed
• On RSA moduli with half of the bits prescribed
• On the security of RSA with primes sharing least-significant bits
• On RSA moduli with prescribed bit patterns
• Fast cryptography in genus 2
• Double-speed Barrett moduli
• Cryptography as an attack technology: proving the RSA/factoring kleptographic attack
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• On symmetric encryption with distinguishable decryption failures
• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• Split knowledge generation of RSA parameters
• Kleptographic (algorithmic) backdoors in the RSA key generator
• Cryptanalysis of Dual RSA
• RSA Moduli with a Predetermined Portion: Techniques and Applications
• Multiparty generation of an RSA modulus

This page was built for publication: Generating RSA moduli with a predetermined portion

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