Jacques Patarin |
|
|---|---|
Author's Web Page | |
| 30 papers in database with 2136 citations ![]() ![]() ![]() H-number: 21 | |
Journal Papers |
|
| 1. Jacques Patarin, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98, Designs, Codes and Cryptography,
Volume 20(2), pp. 175 - 209,
Springer, 2000. [ Electronic
Edition][ Cited
4 times
] | |
Conference Papers |
|
| 1. Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin, The Random Oracle Model and the Ideal Cipher Model Are Equivalent, pp. 1 - 20, CRYPTO 2008. [ Electronic
Edition][ Cited
26 times
] | |
| 2. Jacques Patarin, A Proof of Security in O(2^n) for the Benes Scheme, pp. 209 - 220, AFRICACRYPT 2008. [ Electronic
Edition][ Cited
9 times
] | |
| 3. Jacques Patarin, Valérie Nachef, Côme Berbain, Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions, pp. 325 - 341, ASIACRYPT 2007. [ Electronic
Edition][ Cited
10 times
] | |
| 4. Aline Gouget, Jacques Patarin, Probabilistic Multivariate Cryptography, pp. 1 - 18, VIETCRYPT 2006. [ Electronic
Edition][ Cited
2 times
] | |
| 5. Côme Berbain, Henri Gilbert, Jacques Patarin, QUAD: A Practical Stream Cipher with Provable Security, pp. 109 - 128, EUROCRYPT 2006. [ Electronic
Edition][ IACR Online
Archive ][ Cited
56 times
] | |
| 6. Jacques Patarin, Valérie Nachef, Côme Berbain, Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions, pp. 396 - 411, ASIACRYPT 2006. [ Electronic
Edition][ Cited
17 times
] | |
| 7. Audrey Montreuil, Jacques Patarin, The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations, pp. 33 - 47, INDOCRYPT 2004. [ Electronic
Edition][ No
citation] | |
| 8. Jacques Patarin, Security of Random Feistel Schemes with 5 or More Rounds, pp. 106 - 122, CRYPTO 2004. [ Electronic
Edition][ IACR Online
Archive ][ Cited
47 times
] | |
| 9. Jacques Patarin, Luby-Rackoff: 7 Rounds Are Enough for 2, pp. 513 - 529, CRYPTO 2003. [ Electronic
Edition][ IACR Online
Archive ][ Cited
28 times
] | |
| 10. Nicolas Courtois, Jacques Patarin, About the XL Algorithm over GF(2), pp. 141 - 157, CT-RSA 2003. [ Electronic
Edition][ Cited
72 times
] | |
| 11. Jacques Patarin, Generic Attacks on Feistel Schemes, pp. 222 - 238, ASIACRYPT 2001. [ Electronic
Edition][ IACR Online
Archive ][ Cited
25 times
] | |
| 12. Jacques Patarin, Nicolas Courtois, Louis Goubin, QUARTZ, 128-Bit Long Digital Signatures, pp. 282 - 297, CT-RSA 2001. [ Electronic
Edition][ Cited
51 times
] | |
| 13. Jacques Patarin, Nicolas Courtois, Louis Goubin, FLASH, a Fast Multivariate Signature Algorithm, pp. 298 - 307, CT-RSA 2001. [ Electronic
Edition][ Cited
56 times
] | |
| 14. Nicolas Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir, Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, pp. 392 - 407, EUROCRYPT 2000. [ Electronic
Edition][ IACR Online
Archive ][ Cited
340 times
![]() ![]() ] | |
| 15. Louis Goubin, Jacques Patarin, DES and Differential Power Analysis (The "Duplication" Method), pp. 158 - 172, CHES 1999. [ Electronic
Edition][ Cited
274 times
![]() ![]() ] | |
| 16. Aviad Kipnis, Jacques Patarin, Louis Goubin, Unbalanced Oil and Vinegar Signature Schemes, pp. 206 - 222, EUROCRYPT 1999. [ Electronic
Edition][ Cited
109 times
![]() ] | |
| 17. Jacques Patarin, Louis Goubin, Nicolas Courtois, C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai, pp. 35 - 49, ASIACRYPT 1998. [ Electronic
Edition][ Cited
73 times
] | |
| 18. Jacques Patarin, Louis Goubin, Nicolas Courtois, Improved Algorithms for Isomorphisms of Polynomials, pp. 184 - 200, EUROCRYPT 1998. [ Electronic
Edition][ Cited
52 times
] | |
| 19. Jacques Patarin, About Feistel Schemes with Six (or More) Rounds, pp. 103 - 121, FSE 1998. [ Electronic
Edition][ Cited
38 times
] | |
| 20. Jacques Patarin, Asymmetric Cryptography with a Hidden Monomial, pp. 45 - 60, CRYPTO 1996. [ Electronic
Edition][ Cited
45 times
] | |
| 21. Jacques Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, pp. 33 - 48, EUROCRYPT 1996. [ Electronic
Edition][ Cited
292 times
![]() ![]() ] | |
| 22. Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter, Low-Exponent RSA with Related Messages, pp. 1 - 9, EUROCRYPT 1996. [ Electronic
Edition][ Cited
151 times
![]() ] | |
| 23. Jacques Patarin, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88, pp. 248 - 261, CRYPTO 1995. [ Electronic
Edition][ Cited
189 times
![]() ] | |
| 24. Jacques Patarin, Collisions and Inversions for Damgård's Whole Hash Function, pp. 307 - 321, ASIACRYPT 1994. [ Electronic
Edition][ Cited
9 times
] | |
| 25. Jacques Patarin, Pascal Chauvaud, Improved Algorithms for the Permuted Kernel Problem, pp. 391 - 402, CRYPTO 1993. [ Electronic
Edition][ Cited
10 times
] | |
| 26. Jacques Patarin, How to Find and Avoid Collisions for the Knapsack Hash Function, pp. 305 - 317, EUROCRYPT 1993. [ Electronic
Edition][ Cited
6 times
] | |
| 27. Jacques Patarin, How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function, pp. 256 - 266, EUROCRYPT 1992. [ Electronic
Edition][ Cited
54 times
] | |
| 28. Jacques Patarin, New Results on Pseudorandom Permutation Generators Based on the DES Scheme, pp. 301 - 312, CRYPTO 1991. [ Electronic
Edition][ Cited
45 times
] | |
| 29. Paul Camion, Jacques Patarin, The Knapsack Hash Function proposed at Crypto'89 can be broken, pp. 39 - 53, EUROCRYPT 1991. [ Electronic
Edition][ Cited
46 times
] | |
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals

Electronic
Edition
Cited
4 times
]
IACR Online
Archive
]