Jacques Patarin

发表

The Random Oracle Model and the Ideal Cipher Model Are Equivalent

Jean-Sébastien Coron, Yannick Seurin, Jacques Patarin, 2008, CRYPTO.

QUAD: A Practical Stream Cipher with Provable Security

Jacques Patarin, Henri Gilbert, Côme Berbain, 2006, EUROCRYPT.

Generic Attacks on Feistel Schemes

Jacques Patarin, Jacques Patarin, 2001, ASIACRYPT.

Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations

N. Courtois, A. Shamir, Jacques Patarin, 2000, EUROCRYPT.

A Proof of Security in O ( 2 n ) for the Xor of Two Random Permutations – Proof with the “ H σ technique ” –

Jacques Patarin, 2014 .

Unbalanced Oil and Vinegar Signature Schemes -extended Version

Louis Goubin, Jacques Patarin, Aviad Kipnis, 1999 .

A Proof of Security in O ( 2 n ) for the Xor of Two Random Permutations – Proof with the “ H σ technique ” –

Jacques Patarin, 2014 .

Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations

Adi Shamir, Jacques Patarin, Nicolas Courtois, 2000, EUROCRYPT.

Improved Algorithms for Isomorphisms of Polynomials – Extended Version –

Jacques Patarin, Louis GoubinBull, L. Goubing, 1998 .

(Quantum) Cryptanalysis of Misty Schemes

Jacques Patarin, A. Gouget, Ambre Toulemonde, 2020, ICISC.

On the Method of "xl" and Its Ineeciency to Ttm

Adi Shamir, Jacques Patarin, Nicolas Courtois, 2000 .

MQ or Multivariate Quadratic Public-Key Cryptosystem (MQPKC)

Stefan Katzenbeisser, Tor Helleseth, Friedrich L. Bauer, 2011, Encyclopedia of Cryptography and Security.

Quantum Cryptanalysis of 5 rounds Feistel schemes and Benes schemes

Jacques Patarin, Ambre Toulemonde, Maya Chartouny, 2022, IACR Cryptol. ePrint Arch..

Public ball of signature method and systems

Louis Goubin, Jacques Patarin, Aviad Kipnis, 1999 .

Apparatus and method for computing a digital signature

Louis Goubin, Jacques Patarin, Aviad Kipnis, 1999 .

QUAD: A multivariate stream cipher with provable security

Jacques Patarin, Henri Gilbert, Côme Berbain, 2009, J. Symb. Comput..

A method for entering a confidential information and corresponding terminal

Jacques Patarin, Michel Ugon, Jacques Patarin, 1994 .

Some Transfinite Generalisations of Gödel's Incompleteness Theorem

Jacques Patarin, Jacques Patarin, 2012, Computation, Physics and Beyond.

Introduction to Cryptanalysis and Generic Attacks

Valérie Nachef, Jacques Patarin, Emmanuel Volte, 2017 .

Generic attacks with standard deviation analysis on a-feistel schemes

Valérie Nachef, Jacques Patarin, Emmanuel Volte, 2017, Cryptography and Communications.

Differential Attacks on Generalized Feistel Schemes

Valérie Nachef, Jacques Patarin, Emmanuel Volte, 2013, CANS.

On Linear Systems of Equations with Distinct Variables and Small Block Size

Jacques Patarin, Jacques Patarin, J. Patarin, 2005, ICISC.

Asymmetric Cryptography with a Hidden Monomial

Jacques Patarin, Jacques Patarin, 1996, CRYPTO.

Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms

Jacques Patarin, Jacques Patarin, J. Patarin, 1996, EUROCRYPT.

Low-Exponent RSA with Related Messages

Matthew K. Franklin, Michael K. Reiter, Jacques Patarin, 1996, EUROCRYPT.

Collisions and Inversions for Damgård's Whole Hash Function

Jacques Patarin, Jacques Patarin, 1994, ASIACRYPT.

How to Find and Avoid Collisions for the Knapsack Hash Function

Jacques Patarin, Jacques Patarin, 1994, EUROCRYPT.

Improved Algorithms for the Permuted Kernel Problem

Jacques Patarin, Pascal Chauvaud, Jacques Patarin, 1993, CRYPTO.

How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function

Jacques Patarin, Jacques Patarin, 1992, EUROCRYPT.

The Knapsack Hash Function proposed at Crypto'89 can be broken

Jacques Patarin, Paul Camion, P. Camion, 1991, EUROCRYPT.

Cryptographic Security Analysis of T-310

Jacques Patarin, Nicolas Courtois, Klaus Schmeh, 2017, IACR Cryptol. ePrint Arch..

C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai

Louis Goubin, Jacques Patarin, Nicolas Courtois, 1998, ASIACRYPT.

An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher

Yannick Seurin, Jacques Patarin, Rodolphe Lampe, 2012, ASIACRYPT.

FLASH, a Fast Multivariate Signature Algorithm

Louis Goubin, Jacques Patarin, Nicolas Courtois, 2001, CT-RSA.

DES and Differential Power Analysis (The "Duplication" Method)

Louis Goubin, Jacques Patarin, Jacques Patarin, 1999, CHES.

Ultra-Short Multivariate Public Key Signatures – with Public Keys of Degree 2 –

Jacques Patarin, Maxime Bros, Gilles Macario-Rat, 2021 .

The "Coefficients H" Technique

Jacques Patarin, Jacques Patarin, J. Patarin, 2009, Selected Areas in Cryptography.

A Proof of Security in O(2n) for the Xor of Two Random Permutations

Jacques Patarin, Jacques Patarin, 2008, ICITS.

Security of Random Feistel Schemes with 5 or More Rounds

Jacques Patarin, Jacques Patarin, J. Patarin, 2004, CRYPTO.

Proof of Mirror Theory for any ξ max

Jacques Patarin, Abishanka Saha, M. Nandi, 2022 .

Security of balanced and unbalanced Feistel Schemes with Linear Non Equalities

Jacques Patarin, Jacques Patarin, 2010, IACR Cryptol. ePrint Arch..

Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security

Jacques Patarin, Jacques Patarin, 2003, CRYPTO.

The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations

Jacques Patarin, Audrey Montreuil, Jacques Patarin, 2004, INDOCRYPT.

Unbalanced Oil and Vinegar Signature Schemes

Louis Goubin, Jacques Patarin, Aviad Kipnis, 1999, EUROCRYPT.

Asymmetric cryptography with S-Boxes

Louis Goubin, Jacques Patarin, Jacques Patarin, 1997, ICICS.

Trapdoor one-way permutations and multivariate polynominals

Louis Goubin, Jacques Patarin, Jacques Patarin, 1997, ICICS.

Mirror theory and cryptography

Jacques Patarin, 2017, Applicable Algebra in Engineering, Communication and Computing.

Feistel Ciphers - Security Proofs and Cryptanalysis

Valérie Nachef, Jacques Patarin, Emmanuel Volte, 2017 .

Introduction to Mirror Theory: Analysis of Systems of Linear Equalities and Linear Non Equalities for Cryptography

Jacques Patarin, Jacques Patarin, 2010, IACR Cryptol. ePrint Arch..

The Indistinguishability of the XOR of k Permutations

Benoit Cogliati, Jacques Patarin, Rodolphe Lampe, 2014, FSE.

Introduction to Mirror Theory

Jacques Patarin, Valérie Nachef, Emmanuel Volte, 2017 .

Security in O(2n) for the Xor of Two Random Permutations \\ - Proof with the standard H technique -

Jacques Patarin, Jacques Patarin, 2013, IACR Cryptol. ePrint Arch..

Mirror Theory: A simple proof of the Pi+Pj Theorem with xi_max=2

Benoit Cogliati, Jacques Patarin, Jacques Patarin, 2020, IACR Cryptol. ePrint Arch..

Proof of Mirror Theory for any $\xi_{\max}$

Jacques Patarin, Abishanka Saha, M. Nandi, 2022, IACR Cryptology ePrint Archive.

A Proof of Security in O(2n) for the Benes Scheme

Jacques Patarin, Jacques Patarin, 2008, AFRICACRYPT.

Probabilistic Multivariate Cryptography

Aline Gouget, Jacques Patarin, Jacques Patarin, 2006, VIETCRYPT.

Improved Algorithms for Isomorphisms of Polynomials

Louis Goubin, Jacques Patarin, Nicolas Courtois, 1998, EUROCRYPT.

QUAD: Overview and Recent Developments

Olivier Billet, Jacques Patarin, Henri Gilbert, 2007, Symmetric Cryptography.

GeMSS: A Great Multivariate Short Signature

Ludovic Perret, Jacques Patarin, Gilles Macario-Rat, 2017 .

QUARTZ, 128-Bit Long Digital Signatures

Louis Goubin, Jacques Patarin, Nicolas Courtois, 2001, CT-RSA.

Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88

Jacques Patarin, Jacques Patarin, J. Patarin, 1995, CRYPTO.

A New Perturbation for Multivariate Public Key Schemes such as HFE and UOV

J. Faugère, Jacques Patarin, Ludovic Perret, 2022, IACR Cryptol. ePrint Arch..

UOV-Pepper: New Public Key Short Signature in Degree 3

Jacques Patarin, Gilles Macario-Rat, Jacques Patarin, 2021, IACR Cryptol. ePrint Arch..

Unpredictability properties in Algorand consensus protocol

Aline Gouget, Jacques Patarin, Ambre Toulemonde, 2021, 2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC).

How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction

Jean-Sébastien Coron, Yannick Seurin, Stefano Tessaro, 2014, Journal of Cryptology.

Proof of Mirror Theory for a Wide Range of $\xi _{\max }$

Jacques Patarin, Abishanka Saha, M. Nandi, 2023, International Conference on the Theory and Application of Cryptographic Techniques.

Two-Face: New Public Key Multivariate Schemes

Jacques Patarin, Gilles Macario-Rat, Jacques Patarin, 2018, IACR Cryptol. ePrint Arch..

Zero Knowledge with Rubik's Cubes and Non-abelian Groups

Valérie Nachef, Jacques Patarin, Emmanuel Volte, 2013, CANS.

Zero Knowledge with Rubik's Cubes

Valérie Nachef, Jacques Patarin, Emmanuel Volte, 2012, IACR Cryptol. ePrint Arch..

Hidden Field Equations (HFE) and Isomorphisms of Polynomials (IP): two new Families of Asymmetric Algorithms - Extended Version -

Jacques Patarin, Jacques Patarin, 1996 .

DES and Differential Power Analysis (The "Duplication" Method)

Jacques Patarin, L. Goubin, 1999, CHES.

Proof of Mirror Theory for a Wide Range of ξ max

Jacques Patarin, Abishanka Saha, Benoît Cogliati, 2023 .

Increasing Block Sizes Using Feistel Networks: The Example of the AES

Jacques Patarin, Joana Treger, Benjamin Gittins, 2012, Cryptography and Security.

About Feistel Schemes with Six (or More) Rounds

Jacques Patarin, Jacques Patarin, J. Patarin, 1998, FSE.

Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions

Jacques Patarin, C. Berbain, Valérie Nachef, 2007, ASIACRYPT.

Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions

Valérie Nachef, Jacques Patarin, Côme Berbain, 2006, ASIACRYPT.