Index calculation attacks on RSA signature and encryption

Designs, Codes, and Cryptography

Volumn 38, Issue 1, 2006, Pages 41-53

  Coron, Jean Sébastien ^a   Naccache, David ^a   Desmedt, Yvo ^b   Odlyzko, Andrew ^c   Stern, Julien P ^d  

^a GEMPLUS   (France)

^b FLORIDA STATE UNIVERSITY   (United States)

^c UNIVERSITY OF MINNESOTA   (United States)

^d Cryptolog International ^*  (France)

Author keywords

Cryptanalsis; Forgery; Index Calculation; ISO 9796; RSA; Signature; Smoothness

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY OF DATA; SOCIAL ASPECTS; STANDARDS;

FORGERY; INDEX CALCULATION; ISO 9796; RSA; SIGNATURE; SMOOTHNESS;

CRYPTOGRAPHY;

EID: 29344440987     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-004-5660-y     Document Type: Article

References (13)

1. E. R. Canfield, P. Erdos and C. Pomerance, On a Problem of Oppenheim Concerning 'Factorisation Numerorum', J. Number Th., Vol. 17 (1983) pp. 1-28.
2. D. Coppersmith, S. Halevi and C. Jutla, ISO 9796-1 and the new forgery strategy, Research contribution to P1363, (1999) available at http://grouper.ieee.org/groups/1363/contrib.html.
3. J. S. Coron, D. Naccache and J. P. Stern, On the security of RSA Padding, In Proceedings of Crypto '99, LNCS Vol. 1666 (1999) Springer-Verlag, pp. 1-18.
4. Y. Desmedt and A. Odlyzko. A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, In Proceedings of Crypto '85, LNCS Vol. 218, pp. 516-522.
5. K. Dickman, On the frequency of numbers containing prime factors of a certain relative magnitude, Arkiv för matematik, astronomi och fysik, Vol. 22A, No. 10 (1930) pp. 1-14.
6. ISO/IEC 9796, Information technology - Security techniques - Digital signature scheme giving message recovery, Part 1: Mechanisms using redundancy (1999).
7. ISO/IEC 9796-2, Information technology - Security techniques - Digital signature scheme giving message recovery, Part 2: Mechanisms using a hash-function (1997).
8. C. Lanczos, An iterative method for the solution of the eigenvalue problem of linear differential and integral operator, J. Res. Nat. Bur. Standards, Vol. 45 (1950) pp. 255-282.
9. A. K. Lenstra and H. W. Jr. Lenstra, The Development of the Number Field Sieve, Springer-Verlag, Berlin (1993).
10. H. Lenstra, Jr., Factoring integers with elliptic curves, Ann. of Math. Vol. 126, No. 2 (1987) pp. 649-673.
11. J.-F. Misarsky, How (not) to design RSA signature schemes, Public-key cryptography, Lectures Notes in Computer Science, Vol. 1431, Springer-Verlag, (1998) pp. 14-28.
12. C. Pomerance, The Quadratic Sieve Factoring Algorithm, In Advances in Cryptology, Proceedings of Eurocrypt '84. Springer-Verlag (1985) pp. 169-182.
13. R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, CACM, Vol. 21 (1978).