Cryptography Reference
In-Depth Information
show some square root attacks on the factorization of
N
, and also present a weak
key attack against RSA modulus
N
.When
p
and
q
are safety prime numbers,
we find new weak keys over the work of Maitra and Sarkar [8].
References
1. Blomer, J., May, A.: A generalized wiener attack on RSA. In: Bao, F., Deng, R.,
Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 1-13. Springer, Heidelberg (2004)
2. Coppersmith, D.: Small solutions to polynomial equations and low exponent RSA
vulnerabilities. Journal of Cryptology 10(4), 223-260 (1997)
3. Crandall, R., Pomerance, C.: Prime Numbers, 2nd edn. Springer, Heidelberg (2005)
4. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge
University Press, Cambridge (2003)
5. Han, L.D., Xu, G.W.: Generalization of Some Attacks on RSA with Small Prime
Combination and Small Private Exponent. In: 2009 Asia-Pacific Conference on
Information Processing, vol. 1, pp. 445-449 (2009)
6. Lang, S.: Introduction to diophantine approximations. Addison-Wesley Pub. Co.,
Reading (1966)
7. Lewis, D.J. (ed.): Number Theory Institute 1969. Proceedings of Symposia in Pure
Mathematics, vol. 20. American Mathematical Society, Providence RI (1971)
8. Maitra, S., Sarkar, S.: Revisiting Wiener's attack - new weak keys in RSA. In: Wu,
T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol. 5222, pp.
228-243. Springer, Heidelberg (2008)
9. Maitra, S., Sarkar, S.: Revisiting Wiener's attack - new weak keys in RSA,
10. Nguyen, P.Q.: Recent Trends in Cryptography. In: Luengo, I. (ed.) Public-Key
Cryptanalysis. Contemporary Mathematics series, vol. 477, AMS-RSME (2009)
11. Pollard, J.M.: Monte Carlo methods for index computation
(mod
p
). Math.
Comp. 32, 918-924 (1978)
12. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures
and public-key cryptosystems. Commun. of the ACM 21, 120-126 (1978)
13. Shanks, D.: Class number, a theory of factorization and genera. In: Lewis [7],
pp. 415-440 (1971)
14. de Weger, B.: Cryptanalysis of RSA with small prime difference. Applicable Alge-
bra in Engineering, Communication and Computing 13, 17-28 (2002)
Search WWH ::
Custom Search