A unified framework for small secret exponent attack on RSA
From MaRDI portal
Publication:2889876
DOI10.1007/978-3-642-28496-0_16zbMATH Open1292.94097OpenAlexW211145104MaRDI QIDQ2889876FDOQ2889876
Authors: Noboru Kunihiro, Naoyuki Shinohara, Tetsuya Izu 
Publication date: 8 June 2012
Published in: Selected Areas in Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28496-0_16
Recommendations
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- scientific article; zbMATH DE number 1852133
- scientific article; zbMATH DE number 1583766
- Cryptanalysis of RSA with multiple small secret exponents
- Simplification of the lattice based attack of Boneh and Durfee for RSA cryptoanalysis
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cryptanalysis of short RSA secret exponents
- Title not available (Why is that?)
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- Title not available (Why is that?)
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- Attacking power generators using unravelled linearization: when do we output too much?
- A unified framework for small secret exponent attack on RSA
Cited In (9)
- Attacks on the Search RLWE Problem with Small Errors
- A unified framework for small secret exponent attack on RSA
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- Partial key exposure attack on short secret exponent CRT-RSA
- A small secret exponent attack on cryptosystems using Dickson polynomials
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Small CRT-Exponent RSA Revisited
- Title not available (Why is that?)
This page was built for publication: A unified framework for small secret exponent attack on RSA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889876)
