RSA Moduli with a Predetermined Portion: Techniques and Applications

DOI10.1007/978-3-540-79104-1_9zbMath1300.94061OpenAlexW2130783199MaRDI QIDQ5458502

Marc Joye

Publication date: 15 April 2008

Published in: Information Security Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79104-1_9

zbMATH Keywords

setupsmart cardskey generationkey escrowRSA-type cryptosystemskleptographyRSA modulikey compressiondiminished-radix modulikey storagekey transmissionkey transportRSA key lengthstamper-resistant devices

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Cryptanalysis of Dual RSA ⋮ Double-Speed Barrett Moduli

Cites Work

• Factoring polynomials with rational coefficients
• A design of fast pipelined modular multiplier based on a diminished-radix algorithm
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Short RSA keys and their generation
• On RSA moduli with prescribed bit patterns
• Finding a Small Root of a Univariate Modular Equation
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
• Fast Generation of Prime Numbers on Portable Devices: An Update
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Advances in Cryptology - EUROCRYPT 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: RSA Moduli with a Predetermined Portion: Techniques and Applications