Factoring RSA moduli with primes sharing bits in the middle
- 1 June 2018
- journal article
- research article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 29 (3) , 245-259
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Cryptanalysis of RSA with Small Prime DifferenceApplicable Algebra in Engineering, Communication and Computing, 2002
- The Quadratic Sieve Factoring Algorithm2000
- Cryptanalysis of RSA with private key d less than N/sup 0.292/IEEE Transactions on Information Theory, 2000
- An Attack on RSA Given a Small Fraction of the Private Key Bits1998
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- A Course in Number Theory and Cryptography1994
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- A monte carlo method for factorizationBIT Numerical Mathematics, 1975
- Theorems on factorization and primality testingMathematical Proceedings of the Cambridge Philosophical Society, 1974
- On factoring large numbersBulletin of the American Mathematical Society, 1931