CiteSeerX — Cryptanalysis of RSA Signatures with Fixed-Pattern Padding

Cryptanalysis of RSA Signatures with Fixed-Pattern Padding (2001) [3 citations — 2 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Brier01cryptanalysisof,
    author = {Eric Brier and Christophe Clavier and Jean-sebastien Coron and David Naccache and Gemplus Card International},
    title = {Cryptanalysis of RSA Signatures with Fixed-Pattern Padding},
    year = {2001}
}

Years of Citing Articles

Bookmarks

OpenURL

Abstract:

A fixed-pattern padding consists in concatenating to the message m a fixed pattern P . The RSA signature is then obtained by computing (P mod N where d is the private exponent and N the modulus. In Eurocrypt '97, Girault and Misarsky showed that the size of P must be at least half the size of N (in other words the parameter configurations are insecure) but the security of RSA fixedpattern padding remained unknown for > |N |/2.

Citations

2091	A method for obtaining digital signatures and public-key cryptosystems – Rivest, Shamir, et al. - 1997
416	Factoring polynomials with rational coefficients – Lenstra, Lenstra, et al. - 1982
82	Factoring polynomials with rational coecients, Mathematische Ann – Lenstra, Jr, et al. - 1982
10	A multiplicative attack using LLL Algorithm on RSA signatures with redundancy – Misarsky
9	Attacks on some RSA signatures – Jonge, Chaum - 1986
9	Selective forgery of RSA signatures using redundancy – Girault, Misarsky - 1997
8	PKCS #1 : RSA cryptography specifications, version 2.0 – Laboratories - 1998
7	How (not) to design RSA signature schemes, Public-key cryptography – Misarsky - 1998
7	A fast signature scheme based on quadratic inequalities – Okamoto, Shiraishi - 1985
6	Computation of Approximate L-th Roots Modulo n and Application to Cryptography – Girault, Toffin, et al. - 1990