Research Article
Cryptanalysis of RSA with Small Prime Difference using Unravelled Linearization
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 61 - Issue 3 |
| Published: January 2013 |
| Authors: Santosh Kumar.R, Narasimham.C, Pallam Setty.S |
10.5120/9907-4499
|
Santosh Kumar.R, Narasimham.C, Pallam Setty.S . Cryptanalysis of RSA with Small Prime Difference using Unravelled Linearization. International Journal of Computer Applications. 61, 3 (January 2013), 14-16. DOI=10.5120/9907-4499
@article{ 10.5120/9907-4499,
author = { Santosh Kumar.R,Narasimham.C,Pallam Setty.S },
title = { Cryptanalysis of RSA with Small Prime Difference using Unravelled Linearization },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 61 },
number = { 3 },
pages = { 14-16 },
doi = { 10.5120/9907-4499 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A Santosh Kumar.R
%A Narasimham.C
%A Pallam Setty.S
%T Cryptanalysis of RSA with Small Prime Difference using Unravelled Linearization%T
%J International Journal of Computer Applications
%V 61
%N 3
%P 14-16
%R 10.5120/9907-4499
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In 2002, de Weger showed that choosing an RSA modulus with a small difference of primes improves the attack given by Boneh-Durfee. For this attack, de Weger used the complicated geometrical progressive matrices, introduced by Boneh-Durfee. In this paper, we analyzed by using another technique called unravelled linearization.
References
- R. Rivest, A. Shamir and L. Adleman," A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of the ACM, vol. 21, No. 2, pp. 120-126,1978.
- Wiener, M. : Cryptanalysis of short RSA secret exponents, IEEE Transactions on Information Theory 36, 553-558 (1990).
- Boneh, D. , Durfee, G. : Cryptanalysis of RSA with Private Key d Less Than N^0. 292, Advances in Cryptology-EUROCRYPT99, Lecture Notes in Computer Science 1592, Berlin: Springer 1999,pp. 1-11.
- Nick Howgrave-Graham, N. : Finding small roots of univariate modular equations revisited, In Cryptology and Coding, Lecture Notes in Computer Science 1335, Berlin: Springer-Verlag 1997, pp. 131-142.
- J. Blomer and A. May. Low secret exponent RSA revisited. In J. H. Silverman, editor,CaLC, volume 2146 of Lecture Notes in COMPUTER Science, pages 4-19. Springer, 2001.
- De Weger, B. : Cryptanalysis of RSA with small prime difference, Applicable Algebra in Engineering, Communication and Computing, Vol 13(1), 17-28 (2002).
- Hermann, M. , May, A. ,: Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA, In Practice and Theory in Public Key Cryptography (PKC 2010), Lecture Notes in Computer Science 6056, Berlin: Springer-Verlag 2010,pp. 53-69.
- A. Lenstra, H. Lenstra, L. Lovasz ," Factoring Polynomials with Rational Coeffiecients", Mathematiche Annalen 261, pp. 515-534, 1982.
- R. Santosh kumar, C. Narasimham, S. Pallam setty, "Lattice based tools for cryptanalysis in various applications", springer-LNICST, 84:530-537, 2012.
- R. Santosh kumar, C. Narasimham, S. Pallam settee," Lattice bases attacks on short secret exponent RSA: A Survey", International Journal of Computer Applications (0975 – 8887) Volume 49– No. 19, July 2012.
- Victor Shoup. NTL: A library for doing number theory. Website: http://www. shoup. net/ntl/.
Index Terms
Keywords