Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization

DOI10.1007/978-3-319-16745-9_12zbMath1400.94150OpenAlexW296386659MaRDI QIDQ3454586

Jun Xu, Lei Hu, Zhangjie Huang

Publication date: 25 November 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-16745-9_12

zbMATH Keywords

RSALLL algorithmCoppersmith's methodlattice basis reductionunravelled linearization

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited

Cites Work

• Unnamed Item
• Unnamed Item
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
• Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
• A method for obtaining digital signatures and public-key cryptosystems
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Floating-Point LLL Revisited
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• Advances in Cryptology - CRYPTO 2003
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Algorithmic Number Theory

This page was built for publication: Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization