Selective forgery of rsa signatures with fixed-pattern padding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2274, Issue , 2002, Pages 228-236

  Lenstra, Arjen K ^a   Shparlinski, Igor E ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; PUBLIC KEY CRYPTOGRAPHY;

FORGERY ATTACKS; RSA SIGNATURES; RUNTIMES;

NETWORK SECURITY;

EID: 84958972563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45664-3_16     Document Type: Conference Paper

References (12)

1. D. Boneh, R.J. Lipton, ‘Algorithms for black-box fields and their application to cryptography’ Proc. Crypto’96, Santa Barbara, Lect. Notes in Comp. Sci., vol 1109, Springer-Verlag, Berlin, 1996, 283–297.
2. E. Brier, C. Clavier, J.-S. Coron and D. Naccache, ‘Cryptanalysis of RSA signatures with fixed-pattern padding’, Proc. Crypto’01, Santa Barbara, Lect. Notes in Comp. Sci., vol. 2139, Springer-Verlag, Berlin, 2001, 433–439.
3. S.D. Chowla and J. Todd, ‘The density of reducible integers’, Canad. J. Math., 1(1949) 297–299.
4. D. Coppersmith, ‘Fast evaluation of logarithms in fields of characteristic two’, IEEE Trans. Inform. Theory30(1984) 587–594.
5. M. Girault and J.-F. Misarsky, ‘Selective forgery of RSA signatures using redundancy’, Proc. Eurocrypt’97, Konstanz, Lect. Notes in Comp. Sci., vol. 1233, Springer-Verlag, Berlin, 1997, 495–507.
6. M. Girault and J.-F. Misarsky, ‘Cryptoanalysis of countermeasures proposed for repairing ISO 9796’, Proc. Eurocrypt’00, Bruges, Lect. Notes in Comp. Sci., vol. 1807, Springer-Verlag, Berlin, 2000, 81–90.
7. R.R. Hall and G. Tenenbaum, Divisors, Cambridge Univ. Press, 1988.
8. A. Hildebrand and G. Tenenbaum, ‘Integers without large prime factors’, J. De Théorie des Nombres de Bordeaux, 5(1993) 411–484.
9. A.K. Lenstra and H.W. Lenstra Jr., (Editors), The developments of the number field sieve, Lect. Notes in Mathematics, vol. 1554, Springer-Verlag, Berlin, 1993.
10. J.-F. Misarsky, ‘A multiplicative attack using LLL algorithm on RSA signatures with redundancy,’, Proc. Crypto’97, Santa Barbara, Lect. Notes in Comp. Sci., vol. 1294, Springer-Verlag, Berlin, 1997, 221–234.
11. H.W. Lenstra, Jr. ‘Factoring integers with elliptic curves’, Ann. of Math., 126(1987) 649–673.
12. H. Niederreiter, Random number generation and Quasi–Monte Carlo methods, SIAM Press, 1992.