| 2012 | ||
|---|---|---|
| j5 | ||
| c50 | Rodolphe Lampe, Jacques Patarin, Yannick Seurin: An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher. ASIACRYPT 2012: 278-295 | |
| c49 | Jacques Patarin, Benjamin Gittins, Joana Treger: Increasing Block Sizes Using Feistel Networks: The Example of the AES. Cryptography and Security 2012: 67-82 | |
| c48 | Jacques Patarin: Some Transfinite Generalisations of Gödel's Incompleteness Theorem. Computation, Physics and Beyond 2012: 183-193 | |
| c47 | Valérie Nachef, Jacques Patarin, Emmanuel Volte: Zero-Knowledge for Multivariate Polynomials. LATINCRYPT 2012: 194-213 | |
| c46 | Rodolphe Lampe, Jacques Patarin: Analysis of Some Natural Variants of the PKP Algorithm. SECRYPT 2012: 209-214 | |
| c45 | Avradip Mandal, Jacques Patarin, Yannick Seurin: On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. TCC 2012: 285-302 | |
| i20 | Rodolphe Lampe, Jacques Patarin: Security of Feistel Schemes with New and Various Tools. IACR Cryptology ePrint Archive 2012: 131 (2012) | |
| i19 | Emmanuel Volte, Jacques Patarin, Valérie Nachef: Zero Knowledge with Rubik's Cubes. IACR Cryptology ePrint Archive 2012: 174 (2012) | |
| i18 | Valérie Nachef, Jacques Patarin, Emmanuel Volte: Zero-Knowledge for Multivariate Polynomials. IACR Cryptology ePrint Archive 2012: 239 (2012) | |
| 2011 | ||
| r1 | Louis Goubin, Jacques Patarin, Bo-Yin Yang: Multivariate Cryptography. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 824-828 | |
| i17 | Avradip Mandal, Jacques Patarin, Yannick Seurin: On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction. IACR Cryptology ePrint Archive 2011: 496 (2011) | |
| i16 | Rodolphe Lampe, Jacques Patarin: Analysis of some natural variants of the PKP Algorithm. IACR Cryptology ePrint Archive 2011: 686 (2011) | |
| i15 | Valérie Nachef, Emmanuel Volte, Jacques Patarin: Differential Attacks on Generalized Feistel Schemes. IACR Cryptology ePrint Archive 2011: 705 (2011) | |
| 2010 | ||
| j4 | Jacques Patarin, Valérie Nachef: "I Shall Love You Until Death" (Marie-Antoinette to Axel von Fersen). Cryptologia 34(2): 104-114 (2010) | |
| c44 | Emmanuel Volte, Valérie Nachef, Jacques Patarin: Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. ASIACRYPT 2010: 94-111 | |
| c43 | Avradip Mandal, Jacques Patarin, Valérie Nachef: Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations. INDOCRYPT 2010: 69-81 | |
| c42 | Valérie Nachef, Jacques Patarin, Joana Treger: Generic Attacks on Misty Schemes. LATINCRYPT 2010: 222-240 | |
| i14 | ||
| i13 | Jacques Patarin: Introduction to Mirror Theory: Analysis of Systems of Linear Equalities and Linear Non Equalities for Cryptography. IACR Cryptology ePrint Archive 2010: 287 (2010) | |
| i12 | Jacques Patarin: Security of balanced and unbalanced Feistel Schemes with Linear Non Equalities. IACR Cryptology ePrint Archive 2010: 293 (2010) | |
| 2009 | ||
| j3 | Côme Berbain, Henri Gilbert, Jacques Patarin: QUAD: A multivariate stream cipher with provable security. J. Symb. Comput. 44(12): 1703-1723 (2009) | |
| c41 | Joana Treger, Jacques Patarin: Generic Attacks on Feistel Networks with Internal Permutations. AFRICACRYPT 2009: 41-59 | |
| i11 | Valérie Nachef, Jacques Patarin: I shall love you up to the death. IACR Cryptology ePrint Archive 2009: 166 (2009) | |
| i10 | Valérie Nachef, Jacques Patarin, Joana Treger: Generic Attacks on Misty Schemes -5 rounds is not enough-. IACR Cryptology ePrint Archive 2009: 405 (2009) | |
| i9 | Olivier Billet, Jacques Patarin, Yannick Seurin: Analysis of Intermediate Field Systems. IACR Cryptology ePrint Archive 2009: 542 (2009) | |
| 2008 | ||
| j2 | Paul Camion, Jacques Patarin: t-resilient functions and the partial exposure problem. Appl. Algebra Eng. Commun. Comput. 19(2): 99-133 (2008) | |
| c40 | ||
| c39 | Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin: The Random Oracle Model and the Ideal Cipher Model Are Equivalent. CRYPTO 2008: 1-20 | |
| c38 | Jacques Patarin: A Proof of Security in O(2n) for the Xor of Two Random Permutations. ICITS 2008: 232-248 | |
| c37 | Jacques Patarin, Yannick Seurin: Building Secure Block Ciphers on Generic Attacks Assumptions. Selected Areas in Cryptography 2008: 66-81 | |
| c36 | ||
| i8 | Jacques Patarin: Generic Attacks for the Xor of k random permutations. IACR Cryptology ePrint Archive 2008: 9 (2008) | |
| i7 | Jacques Patarin: A Proof of Security in O(2^n) for the Xor of Two Random Permutations. IACR Cryptology ePrint Archive 2008: 10 (2008) | |
| i6 | ||
| i5 | Jean-Sébastien Coron, Jacques Patarin, Yannick Seurin: The Random Oracle Model and the Ideal Cipher Model are Equivalent. IACR Cryptology ePrint Archive 2008: 246 (2008) | |
| 2007 | ||
| c35 | Jacques Patarin, Valérie Nachef, Côme Berbain: Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. ASIACRYPT 2007: 325-341 | |
| c34 | David Arditti, Côme Berbain, Olivier Billet, Henri Gilbert, Jacques Patarin: QUAD: Overview and Recent Developments. Symmetric Cryptography 2007 | |
| i4 | Jacques Patarin, Valérie Nachef, Côme Berbain: Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. IACR Cryptology ePrint Archive 2007: 449 (2007) | |
| 2006 | ||
| c33 | Jacques Patarin, Valérie Nachef, Côme Berbain: Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions. ASIACRYPT 2006: 396-411 | |
| c32 | Côme Berbain, Henri Gilbert, Jacques Patarin: QUAD: A Practical Stream Cipher with Provable Security. EUROCRYPT 2006: 109-128 | |
| c31 | ||
| 2005 | ||
| c30 | ||
| c29 | Jacques Patarin: On Linear Systems of Equations with Distinct Variables and Small Block Size. ICISC 2005: 299-321 | |
| i3 | Jacques Patarin, Audrey Montreuil: Benes and Butterfly schemes revisited. IACR Cryptology ePrint Archive 2005: 4 (2005) | |
| i2 | Jacques Patarin, Paul Camion: Design of near-optimal pseudorandom functions and pseudorandom permutations in the information-theoretic model. IACR Cryptology ePrint Archive 2005: 135 (2005) | |
| 2004 | ||
| c28 | ||
| c27 | Audrey Montreuil, Jacques Patarin: The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations. INDOCRYPT 2004: 33-47 | |
| 2003 | ||
| c26 | ||
| c25 | ||
| i1 | Nicolas T. Courtois, Louis Goubin, Jacques Patarin: SFLASHv3, a fast asymmetric signature scheme. IACR Cryptology ePrint Archive 2003: 211 (2003) | |
| 2001 | ||
| c24 | ||
| c23 | Jacques Patarin, Nicolas Courtois, Louis Goubin: QUARTZ, 128-Bit Long Digital Signatures. CT-RSA 2001: 282-297 | |
| c22 | Jacques Patarin, Nicolas Courtois, Louis Goubin: FLASH, a Fast Multivariate Signature Algorithm. CT-RSA 2001: 298-307 | |
| 2000 | ||
| j1 | Jacques Patarin: Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98. Des. Codes Cryptography 20(2): 175-209 (2000) | |
| c21 | Nicolas Courtois, Alexander Klimov, Jacques Patarin, Adi Shamir: Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations. EUROCRYPT 2000: 392-407 | |
| 1999 | ||
| c20 | Louis Goubin, Jacques Patarin: DES and Differential Power Analysis (The "Duplication" Method). CHES 1999: 158-172 | |
| c19 | Aviad Kipnis, Jacques Patarin, Louis Goubin: Unbalanced Oil and Vinegar Signature Schemes. EUROCRYPT 1999: 206-222 | |
| 1998 | ||
| c18 | Jacques Patarin, Louis Goubin, Nicolas Courtois: C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai. ASIACRYPT 1998: 35-49 | |
| c17 | Jacques Patarin, Louis Goubin, Nicolas Courtois: Improved Algorithms for Isomorphisms of Polynomials. EUROCRYPT 1998: 184-200 | |
| c16 | ||
| 1997 | ||
| c15 | Jacques Patarin: Improved Security Bounds for Pseudorandom Permutations. ACM Conference on Computer and Communications Security 1997: 142-150 | |
| c14 | Jacques Patarin, Louis Goubin: Trapdoor one-way permutations and multivariate polynominals. ICICS 1997: 356-368 | |
| c13 | ||
| 1996 | ||
| c12 | ||
| c11 | Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter: Low-Exponent RSA with Related Messages. EUROCRYPT 1996: 1-9 | |
| c10 | Jacques Patarin: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. EUROCRYPT 1996: 33-48 | |
| 1995 | ||
| c9 | Jacques Patarin: Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88. CRYPTO 1995: 248-261 | |
| 1994 | ||
| c8 | Jacques Patarin: Collisions and Inversions for Damgård's Whole Hash Function. ASIACRYPT 1994: 307-321 | |
| 1993 | ||
| c7 | Jacques Patarin, Pascal Chauvaud: Improved Algorithms for the Permuted Kernel Problem. CRYPTO 1993: 391-402 | |
| c6 | Jacques Patarin: How to Find and Avoid Collisions for the Knapsack Hash Function. EUROCRYPT 1993: 305-317 | |
| 1992 | ||
| c5 | Jacques Patarin: How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function. EUROCRYPT 1992: 256-266 | |
| 1991 | ||
| c4 | Jacques Patarin: New Results on Pseudorandom Permutation Generators Based on the DES Scheme. CRYPTO 1991: 301-312 | |
| c3 | Paul Camion, Jacques Patarin: The Knapsack Hash Function proposed at Crypto'89 can be broken. EUROCRYPT 1991: 39-53 | |
| 1990 | ||
| c2 | ||
| c1 | ||
Data released under the ODC-BY 1.0 license — See also our legal information page