@inproceedings{9db9ef049cd743608cfe7141cbc193e6,
title = "Selective forgery of RSA signatures with fixed-pattern padding",
abstract = "We present a practical selective forgery attack against RSA signatures with fixed-pattern padding shorter than two thirds of the modulus length. Our result extends the practical existential forgery of such RSA signatures that was presented at Crypto 2001. For an n-bit modulus the heuristic asymptotic runtime of our forgery is comparable to the time required to factor a modulus of only 9/64n bits. Thus, the security provided by short fixed-pattern padding is negligible compared to the security it is supposed to provide.",
author = "A.K. Lenstra and I.E. Shparlinski",
year = "2002",
doi = "10.1007/3-540-45664-3_16",
language = "English",
isbn = "3-540-43168-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "228--236",
editor = "D. Naccache and P. Paillier",
booktitle = "Public key cryptography : proceedings PKC 2002, Paris, France, February 12-14, 2002",
address = "Germany",
}