RSA Moduli with a Predetermined Portion: Techniques and Applications
From MaRDI portal
Recommendations
Cites work
- A design of fast pipelined modular multiplier based on a diminished-radix algorithm
- A method for obtaining digital signatures and public-key cryptosystems
- Advances in Cryptology - EUROCRYPT 2004
- Factoring polynomials with rational coefficients
- Fast Generation of Prime Numbers on Portable Devices: An Update
- Finding a small root of a univariate modular equation
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- scientific article; zbMATH DE number 176559 (Why is no real title available?)
- scientific article; zbMATH DE number 177060 (Why is no real title available?)
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1302781 (Why is no real title available?)
- scientific article; zbMATH DE number 1302856 (Why is no real title available?)
- scientific article; zbMATH DE number 1088905 (Why is no real title available?)
- scientific article; zbMATH DE number 1962166 (Why is no real title available?)
- scientific article; zbMATH DE number 1759305 (Why is no real title available?)
- New directions in cryptography
- On RSA moduli with prescribed bit patterns
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Short RSA keys and their generation
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- The dark side of ``black-box cryptography or: should we trust Capstone?
- The exact security of digital signatures -- how to sign with RSA and Rabin
Cited in
(6)
This page was built for publication: RSA Moduli with a Predetermined Portion: Techniques and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458502)