Bibliography

1

FIPS 186.
Digital signature standard.
Federal Information Processing Standards Publication 186, U.S. Department of Commerce/NIST, 1994.

2

FIPS 46.
Data encryption standard.
Federal Processing Standards Publication 46, U.S. Department of Commerce, 1977.

3

ISO/IEC 9796.
Information technology - security techniques - digital signature scheme giving message recovery, part 1 : Mechanisms using redundancy, 1999.

4

ISO/IEC 9796-2.
Information technology - security techniques - digital signature scheme giving message recovery, part 2 : Mechanisms using a hash-function, 1997.

5

N. Baric and B. Pfitzmann.
Collision-free accumulators and fail-stop signature schemes without trees.
In Walter Fumy, editor, Advances in Cryptology - EUROCRYPT '97, volume 1233, pages 480-494. Springer-Verlag, 1997.
Lecture Notes in Computer Science.

6

M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway.
Relations among notions of security for public-key encryption schemes.
In H. Krawczyk, editor, Advances in Cryptology - CRYPTO' 98, volume 1462, pages 26-45. Springer-Verlag, 1998.
Lecture Notes in Computer Science.

7

M. Bellare and P. Rogaway.
Random oracles are practical : a paradigm for designing efficient protocols.
In Proceedings of the first annual conference on computer and communication security, 1993.

8

M. Bellare and P. Rogaway.
Optimal asymmetric encryption.
In Advances in Cryptology - EUROCRYPT '94, volume 950, pages 92-111. Springer-Verlag, 1995.
Lecture Notes in Computer Science.

9

M. Bellare and P. Rogaway.
The exact security of digital signatures - how to sign with RSA and Rabin.
In Ueli Maurer, editor, Advances in Cryptology - EUROCRYPT '96, volume 1070, pages 399-416. Springer-Verlag, 1996.
Lecture Notes in Computer Science.

10

E. Biham and A. Shamir.
Differential cryptanalysis of the full 16-round DES.
In Ernest F. Brickell, editor, Advances in Cryptology - CRYPTO '92, volume 740, pages 487-496. Springer-Verlag, 1992.
Lecture Notes in Computer Science.

11

D. Bleichenbacher.
Chosen ciphertext attacks against protocols based on the RSA encryption standard.
In Advances in Cryptology: Proceedings of CRYPTO '98, volume 1462, pages 1-12. Springer Verlag, 1998.
Lecture Notes in Computer Science.

12

D. Boneh.
Twenty years of attacks on the RSA cryptosystem.
Notices of the American Mathematical Society (AMS), 46(2):203-213, 1999.

13

D. Boneh and G. Durfee.
Cryptanalysis of RSA with private key $d$ less than $n^{0.292}$.
In Advances in Cryptology - EUROCRYPT '99, volume 1592. Springer-Verlag, 1999.
Lecture Notes in Computer Science.

14

D. Boneh, A. Joux, and P.Q. Nguyen.
Why textbook ElGamal and RSA encryption are insecure.
In T. Okamoto, editor, Advances in Cryptology - Asiacrypt 2000, volume 1976, pages 30-43. Springer-Verlag, 2000.
Lecture Notes in Computer Science.

15

R. Brent.
An imporved Monte-Carlo factorization algorithm.
Nordisk Tidskrift för Informationsbehandling (BIT), 20:176-184, 1980.

16

E. Brier, C. Clavier, J.S. Coron, and D. Naccache.
Cryptanalysis of RSA signatures with fixed-pattern padding.
In CRYPTO 2001. Springer-Verlag, 2001.
Lecture Notes in Computer Science.

17

R. Canetti, O. Goldreich, and S. Halevi.
The random oracle methodology, revisited.
STOC' 98, ACM, 1998.

18

C. Clavier, J.S. Coron, and N. Dabbous.
Differential power analysis in the presence of hardware countermeasures.
In CHES 2000, volume 1965, pages 252-263. Springer-Verlag, 2000.
Lecture Notes in Computer Science.

19

D. Coppersmith.
Small solutions to polynomial equations, and low exponent RSA vulnerabilities.
J. of Cryptology, 10:233-260, 1997.

20

D. Coppersmith, M.K. Franklin, J. Patarin, and M.K. Reiter.
Low-exponent RSA with related messages.
In Ueli Maurer, editor, Advances in Cryptology - EUROCRYPT '96, volume 1070, pages 1-9. Springer-Verlag, 1996.
Lecture Notes in Computer Science.

21

D. Coppersmith, S. Halevi, and C. Jutla.
ISO 9796-1 and the new forgery strategy.
Technical report, Contribution de recherche au groupe P1363, 1999.

22

D. Coppersmith, A. M. Odlzyko, and R. Schroeppel.
Discrete logarithms in $GF(p)$.
Algorithmica, 1:1-15, 1986.

23

J.S. Coron.
On the security of random sources.
In Proceedings of PKC '99, volume 1560, pages 29-42. Springer-Verlag, 1999.
Lecture Notes in Computer Science.

24

J.S. Coron.
Resistance against differential power analysis for elliptic curve cryptosystems.
In Proceedings of CHES '99, volume 1717, pages 292-302. Springer-Verlag, 1999.
Lecture Notes in Computer Science.

25

J.S. Coron.
On the exact security of full domain hash.
In M. Bellare, editor, Prooceedings of CRYPTO 2000, volume 1880, pages 229-235. Springer Verlag, 2000.
Lecture Notes in Computer Science.

26

J.S. Coron and L. Goubin.
On boolean and arithmetic masking against differential power analysis.
In CHES 2000, volume 1965, pages 231-237. Springer-Verlag, 2000.
Lecture Notes in Computer Science.

27

J.S. Coron, H. Handschuh, and D. Naccache.
ECC: do we need to count ?
In Advances in Cryptology - ASIACRYPT '99, volume 1716, pages 122-134. Springer-Verlag, 1999.
Lecture Notes in Computer Science.

28

J.S. Coron, M. Joye, D. Naccache, and P. Paillier.
New attacks on PKCS#1 v1.5 encryption.
In B. Preneel, editor, Prooceedings of EUROCRYPT 2000, volume 1807, pages 369-381. Springer Verlag, 2000.
Lecture Notes in Computer Science.

29

J.S. Coron, P. Kocher, and D. Naccache.
Statistics and secret leakage.
In Financial Cryptography 2000. Springer-Verlag, 2000.
Lecture Notes in Computer Science.

30

J.S. Coron, F. Koeune, and D. Naccache.
From fixed-lenght to arbitrary-length padding schemes.
In Advances in Cryptology - ASIACRYPT 2000, volume 1976, pages 90-96. Springer-Verlag, 2000.
Lecture Notes in Computer Science.

31

J.S. Coron and D. Naccache.
An accurate evaluation of maurer's universal test.
In Selected Areas in Cryptography, SAC '98, volume 1556, pages 57-71. Springer-Verlag, 1998.
Lecture Notes in Computer Science.

32

J.S. Coron and D. Naccache.
On the security of RSA screening.
In Proceedings of PKC '99, volume 1560, pages 197-203. Springer-Verlag, 1999.
Lecture Notes in Computer Science.

33

J.S. Coron and D. Naccache.
Security analysis of the Gennaro-Halevi-Rabin signature scheme.
In B. Preneel, editor, Prooceedings of EUROCRYPT 2000, volume 1807, pages 91-101. Springer Verlag, 2000.
Lecture Notes in Computer Science.

34

J.S. Coron, D. Naccache, and J.P. Stern.
On the security of RSA padding.
In Advances in Cryptology - CRYPTO '99, volume 1666, pages 1-18. Springer-Verlag, 1999.
Lecture Notes in Computer Science.

35

R. Cramer and I. Damgård.
New generation of secure and practical RSA-based signatures.
In Proceedings of CRYPTO'96, volume 1109, pages 173-185. Springer-Verlag, 1996.
Lecture Notes in Computer Science.

36

R. Cramer and V. Shoup.
Signature schemes based on the strong RSA assumption.
In Proc. 6th ACM Conf. on Computer and Communications Security, 1996.
Disponible à http://www.shoup.net/.

37

W. de Jonge and D. Chaum.
Attacks on some RSA signatures.
In Hugh C. Williams, editor, Advances in Cryptology - CRYPTO '85, volume 218, pages 18-27. Springer-Verlag, 1986.
Lecture Notes in Computer Science.

38

Y. Desmedt and A.M. Odlyzko.
A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes.
In Hugh C. Williams, editor, Advances in Cryptology - CRYPTO '85, volume 218, pages 516-522. Springer-Verlag, 1986.
Lecture Notes in Computer Science.

39

K. Dickman.
On the frequency of numbers containing prime factors of a certain relative magnitude.
Arkiv för matematik, astronomi och fysik, 22A(10):1-14, 1930.

40

W. Diffie and M.E. Hellman.
New directions in cryptography.
IEEE Transactions on Information Theory, IT-22(6):644-654, 1976.

41

D. Dolev, C. Dwork, and M. Naor.
Non-malleable cryptography.
In Proc. of the 23rd Symposium on the theory of Computing, ACM, 1991.

42

C. Dwork and M. Naor.
An efficient existentially unforgeable signature scheme and its applications.
J. of Cryptology, 11(3):187-208, Summer 1998.

43

P. Erdös and C. Pomerance.
On a problem of Oppenheim concerning 'factorisatio numerorum'.
J. Number Theory, 17:1-28, 1983.

44

A. Joux et J. Stern.
Lattice reduction : A toolbox for the cryptanalyst.
J. of Cryptology, 11:161-185, 1998.

45

G. Qiao et K.Y. Lam.
RSA signature algorithm for microcontroller implementation.
Proceedings of CARDIS '98, 1998.

46

S. Cavallar et al.
Factorization of a 512-bit RSA modulus.
In B. Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807, pages 1-18. Springer-Verlag, 2000.
Lecture Notes in Computer Science.

47

M. Garey and D.S. Johnson.
Computers and Intractability : A Guide to the Theory of NP-Completeness.
Freeman, 1979.

48

R. Gennaro, S. Halevi, and T. Rabin.
Secure hash-and-sign signatures without the random oracle.
In Proceedings of EUROCRYPT '99, volume 1592, pages 123-139. Springer-Verlag, 1999.
Lecture Notes in Computer Science.

49

J.Y. Girard.
La machine de Turing.
Sources du savoir, éditions du Seuil, 1995.

50

M. Girault and J.-F. Misarsky.
Selective forgery of RSA signatures using redundancy.
In Walter Fumy, editor, Advances in Cryptology - EUROCRYPT '97, volume 1233, pages 495-507. Springer-Verlag, 1997.
Lecture Notes in Computer Science.

51

S. Goldwasser and S. Micali.
Probabilistic encryption.
J. of Computer and System Sciences, 28:270-299, 1984.

52

S. Goldwasser, S. Micali, and R. Rivest.
A digital signature scheme secure against adaptive chosen-message attacks.
SIAM J. of computing, 17(2):281-308, april 1988.

53

S. Goldwasser, S. Micali, and P. Tong.
Why and how to establish a private code on a public network.
Proc. 23rd IEEE Symp. on Foundations of Comp. Science, pages 134-144, 1982.

54

F. Grieu.
A chosen message attacks on the ISO/IEC 9796-1 signature scheme.
In B. Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume 1807, pages 70-80. Springer-Verlag, 2000.
Lecture Notes in Computer Science.

55

G.H. Hardy and E.M. Wright.
An Introduction to the theory of numbers.
Fifth edition, Oxford University Press, 1979.

56

J. Hastad.
Solving simultaneous modular equations of low degree.
SIAM J. of Computing, 17:336-341, 1988.

57

K. Hickman.
The SSL protocol, December 1995.
Disponible à l'adresse : http://www.netscape.com/newsref/std/ssl.html.

58

A. Ivic and G. Tenenbaum.
Local densities over integers free of large prime factors.
Quart. J. Math. Oxford (2), 37:401-417, 1986.

59

B. Kalisky and M. Robshaw.
The secure use of RSA.
CryptoBytes, 1(3):7-13, 1995.

60

C. Lanczos.
An iterative method for the solution of the eigenvalue problem of linear differential and integral operator.
J. Res. Nat. Bur. Standards, 45:255-282, 1950.

61

A.K. Lenstra, H.W. Lenstra Jr., and L. Lovász.
Factoring polynomials with rational coefficients.
Mathematischen Annalen, 261:515-535, 1982.

62

H. Lenstra.
Factoring integers with elliptic curves.
Annals of mathematics, 126, 1987.

63

M. Matsui.
Linear cryptanalysis method for DES cipher.
In Tor Helleseth, editor, Advances in Cryptology - EUROCRYPT '93, volume 765, pages 386-397. Springer-Verlag, 1993.
Lecture Notes in Computer Science.

64

A. Menezes, P. van Oorschot, and S. Vanstone.
Handbook of Applied Cryptography.
1996.

65

Multiprecision integer and rational arithmetic c/c++ library.
Disponible à ftp://ftp.compapp.dcu.ie/pub/crypto/miracl.zip.

66

J.-F. Misarsky.
A multiplicative attack using LLL algorithm on RSA signatures with redundancy.
In Burt Kaliski, editor, Advances in Cryptology - CRYPTO '97, volume 1294, pages 221-234. Springer-Verlag, 1997.
Lecture Notes in Computer Science.

67

J.-F. Misarsky.
How (not) to design RSA signature schemes.
In Public-key cryptography, volume 1431, pages 14-28. Springer-Verlag, 1998.
Lectures notes in computer science.

68

J.-F. Misarsky.
Cryptanalyse et spécification de schémas de signature RSA avec redondance.
PhD thesis, 1999.

69

K. Ohta and T. Okamoto.
On concrete security treatment of signatures derived from identification.
In Prooceedings of CRYPTO'98, volume 1462, pages 354-369. Springer Verlag, 1998.
Lecture Notes in Computer Science.

70

T. Okamoto and A. Shiraishi.
A fast signature scheme based on quadratic inequalities.
Proc. of the 1985 Symposium on Security and Privacy, April 1985.

71

P. Paillier.
Public-key cryptosystems based on composite degree residuosity classes.
In Proceedings of EUROCRYPT '99, volume 1592, pages 223-238. Springer-Verlag, 1999.
Lecture Notes in Computer Science.

72

D. Pointcheval and J. Stern.
Security proofs for signature schemes.
In Advances in Cryptology - EUROCRYPT '96, volume 1070, pages 387-398. Springer-Verlag, 1996.
Lecture Notes in Computer Science.

73

J. Pollard.
Factoring with cubic integers.
In The development of the number field sieve, volume 1554, pages 4-10. Springer-Verlag, 1993.
Lectures notes in computer science.

74

C. Pomerance.
The quadratic sieve factoring algorithm.
In Thomas Beth, Norbert Cot, , and Ingemar Ingemarsson, editors, Advances in Cryptology: Proceedings of EUROCRYPT '84, volume 209, pages 169-182. Springer-Verlag, 1984.
Lecture Notes in Computer Science.

75

A. Shamir R. Rivest and L. Adleman.
A method for obtaining digital signatures and public-key cryptosystems.
Communications of the ACM, 21-2:120-126, 1978.

76

M.O. Rabin.
Digitalized signatures and public-key functions as intractable as factorization.
Technical report, MIT Laboratory for Computer Science, 1979.

77

PKCS #1: RSA cryptography specifications, September 1998.
version 2.0.

78

B. Schneier.
Cryptographie appliquée.
International Thomson Publishing France, Paris, 1995.

79

RSA Data Security.
PKCS #1: RSA Encryption Standard, November 1993.
Version 1.5.

80

D. Stinson.
Cryptographie : théorie et pratique.
International Thomson Publishing France, 1996.
Traduction par S. Vaudenay de ``Cryptography: theory and practice'', CRC Press, Inc., 1995.

81

A. Turing.
On computable numbers with an application to the entscheidung problem.
Proc. London. Math. Society, 42(2):230-265, 1936.

82

M. Wiener.
Cryptanalysis of short RSA secret exponents.
IEEE Transactions on Informations Theory, 36:553-558, 1990.

83

H. Williams.
A modification of the RSA public key encryption procedure.
IEEE TIT, 26:726-729, 1980.