Jacques Patarin

According to our database1, Jacques Patarin authored at least 99 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
On the complexity of the Permuted Kernel Problem.
IACR Cryptology ePrint Archive, 2019

2018
PKP-Based Signature Scheme.
IACR Cryptology ePrint Archive, 2018

Generic attacks with standard deviation analysis on a-feistel schemes.
Cryptography and Communications, 2018

Combinatorial Digital Signature Scheme.
Proceedings of the 1st International Conference on Big Data and Cyber-Security Intelligence, 2018

Two Simple Composition Theorems with H-coefficients.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2018, 2018

Two-Face: New Public Key Multivariate Schemes.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2018, 2018

2017
Two-Face: New Public Key Multivariate Schemes.
IACR Cryptology ePrint Archive, 2017

Cryptographic Security Analysis of T-310.
IACR Cryptology ePrint Archive, 2017

Mirror theory and cryptography.
Appl. Algebra Eng. Commun. Comput., 2017

Commutativity, Associativity, and Public Key Cryptography.
Proceedings of the Number-Theoretic Methods in Cryptology - First International Conference, 2017

Feistel Ciphers - Security Proofs and Cryptanalysis
Springer, ISBN: 978-3-319-49530-9, 2017

2016
How to Build an Ideal Cipher: The Indifferentiability of the Feistel Construction.
J. Cryptology, 2016

Commutativity, Associativity, and Public Key Cryptography.
IACR Cryptology ePrint Archive, 2016

Two Simple Composition Theorems with H-coefficients.
IACR Cryptology ePrint Archive, 2016

Mirror Theory and Cryptography.
IACR Cryptology ePrint Archive, 2016

Mary of Guise's Enciphered Letters.
Proceedings of the New Codebreakers, 2016

2014
4-point Attacks with Standard Deviation Analysis on A-Feistel Schemes.
IACR Cryptology ePrint Archive, 2014

Security Amplification for the Composition of Block Ciphers: Simpler Proofs and New Results.
Proceedings of the Selected Areas in Cryptography - SAC 2014, 2014

The Indistinguishability of the XOR of k Permutations.
Proceedings of the Fast Software Encryption - 21st International Workshop, 2014

2013
Security in O(2n) for the Xor of Two Random Permutations \\ - Proof with the standard H technique -.
IACR Cryptology ePrint Archive, 2013

Zero Knowledge with Rubik's Cubes and Non-abelian Groups.
Proceedings of the Cryptology and Network Security - 12th International Conference, 2013

Differential Attacks on Generalized Feistel Schemes.
Proceedings of the Cryptology and Network Security - 12th International Conference, 2013

Generic Attacks for the Xor of k Random Permutations.
Proceedings of the Applied Cryptography and Network Security, 2013

2012
Transfinite Cryptography.
IJUC, 2012

Zero Knowledge with Rubik's Cubes.
IACR Cryptology ePrint Archive, 2012

Zero-Knowledge for Multivariate Polynomials.
IACR Cryptology ePrint Archive, 2012

Security of Feistel Schemes with New and Various Tools.
IACR Cryptology ePrint Archive, 2012

On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Analysis of Some Natural Variants of the PKP Algorithm.
Proceedings of the SECRYPT 2012, 2012

Zero-Knowledge for Multivariate Polynomials.
Proceedings of the Progress in Cryptology - LATINCRYPT 2012, 2012

Increasing Block Sizes Using Feistel Networks: The Example of the AES.
Proceedings of the Cryptography and Security: From Theory to Applications, 2012

Some Transfinite Generalisations of Gödel's Incompleteness Theorem.
Proceedings of the Computation, Physics and Beyond, 2012

An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Multivariate Cryptography.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Differential Attacks on Generalized Feistel Schemes.
IACR Cryptology ePrint Archive, 2011

On the Public Indifferentiability and Correlation Intractability of the 6-Round Feistel Construction.
IACR Cryptology ePrint Archive, 2011

Analysis of some natural variants of the PKP Algorithm.
IACR Cryptology ePrint Archive, 2011

2010
Security of balanced and unbalanced Feistel Schemes with Linear Non Equalities.
IACR Cryptology ePrint Archive, 2010

Introduction to Mirror Theory: Analysis of Systems of Linear Equalities and Linear Non Equalities for Cryptography.
IACR Cryptology ePrint Archive, 2010

Transfinite Cryptography.
IACR Cryptology ePrint Archive, 2010

"I Shall Love You Until Death" (Marie-Antoinette to Axel von Fersen).
Cryptologia, 2010

Generic Attacks on Misty Schemes.
Proceedings of the Progress in Cryptology, 2010

Indifferentiability beyond the Birthday Bound for the Xor of Two Public Random Permutations.
Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
QUAD: A multivariate stream cipher with provable security.
J. Symb. Comput., 2009

Generic Attacks on Misty Schemes -5 rounds is not enough-.
IACR Cryptology ePrint Archive, 2009

I shall love you up to the death.
IACR Cryptology ePrint Archive, 2009

Analysis of Intermediate Field Systems.
IACR Cryptology ePrint Archive, 2009

Generic Attacks on Feistel Networks with Internal Permutations.
Proceedings of the Progress in Cryptology, 2009

2008
Generic Attacks on Feistel Schemes.
IACR Cryptology ePrint Archive, 2008

A Proof of Security in O(2n) for the Xor of Two Random Permutations.
IACR Cryptology ePrint Archive, 2008

Generic Attacks for the Xor of k random permutations.
IACR Cryptology ePrint Archive, 2008

The Random Oracle Model and the Ideal Cipher Model are Equivalent.
IACR Cryptology ePrint Archive, 2008

t-resilient functions and the partial exposure problem.
Appl. Algebra Eng. Commun. Comput., 2008

Building Secure Block Ciphers on Generic Attacks Assumptions.
Proceedings of the Selected Areas in Cryptography, 15th International Workshop, SAC 2008, 2008

The "Coefficients H" Technique.
Proceedings of the Selected Areas in Cryptography, 15th International Workshop, SAC 2008, 2008

A Proof of Security in O(2n) for the Xor of Two Random Permutations.
Proceedings of the Information Theoretic Security, Third International Conference, 2008

The Random Oracle Model and the Ideal Cipher Model Are Equivalent.
Proceedings of the Advances in Cryptology, 2008

A Proof of Security in O(2n) for the Benes Scheme.
Proceedings of the Progress in Cryptology, 2008

2007
Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions.
IACR Cryptology ePrint Archive, 2007

QUAD: Overview and Recent Developments.
Proceedings of the Symmetric Cryptography, 07.01. - 12.01.2007, 2007

Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions.
Proceedings of the Advances in Cryptology, 2007

2006
Probabilistic Multivariate Cryptography.
Proceedings of the Progressin Cryptology, 2006

QUAD: A Practical Stream Cipher with Provable Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions.
Proceedings of the Advances in Cryptology, 2006

2005
Benes and Butterfly schemes revisited.
IACR Cryptology ePrint Archive, 2005

Design of near-optimal pseudorandom functions and pseudorandom permutations in the information-theoretic model.
IACR Cryptology ePrint Archive, 2005

Benes and Butterfly Schemes Revisited.
Proceedings of the Information Security and Cryptology, 2005

On Linear Systems of Equations with Distinct Variables and Small Block Size.
Proceedings of the Information Security and Cryptology, 2005

2004
The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations.
Proceedings of the Progress in Cryptology, 2004

Security of Random Feistel Schemes with 5 or More Rounds.
Proceedings of the Advances in Cryptology, 2004

2003
SFLASHv3, a fast asymmetric signature scheme.
IACR Cryptology ePrint Archive, 2003

About the XL Algorithm over GF(2).
Proceedings of the Topics in Cryptology, 2003

Luby-Rackoff: 7 Rounds Are Enough for 2n(1-epsilon)Security.
Proceedings of the Advances in Cryptology, 2003

2001
FLASH, a Fast Multivariate Signature Algorithm.
Proceedings of the Topics in Cryptology, 2001

QUARTZ, 128-Bit Long Digital Signatures.
Proceedings of the Topics in Cryptology, 2001

Generic Attacks on Feistel Schemes.
Proceedings of the Advances in Cryptology, 2001

2000
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98.
Des. Codes Cryptogr., 2000

Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations.
Proceedings of the Advances in Cryptology, 2000

1999
Unbalanced Oil and Vinegar Signature Schemes.
Proceedings of the Advances in Cryptology, 1999

DES and Differential Power Analysis (The "Duplication" Method).
Proceedings of the Cryptographic Hardware and Embedded Systems, 1999

1998
About Feistel Schemes with Six (or More) Rounds.
Proceedings of the Fast Software Encryption, 5th International Workshop, 1998

Improved Algorithms for Isomorphisms of Polynomials.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

C*-+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai.
Proceedings of the Advances in Cryptology, 1998

1997
Asymmetric cryptography with S-Boxes.
Proceedings of the Information and Communication Security, First International Conference, 1997

Trapdoor one-way permutations and multivariate polynominals.
Proceedings of the Information and Communication Security, First International Conference, 1997

Improved Security Bounds for Pseudorandom Permutations.
Proceedings of the CCS '97, 1997

1996
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms.
Proceedings of the Advances in Cryptology, 1996

Low-Exponent RSA with Related Messages.
Proceedings of the Advances in Cryptology, 1996

Asymmetric Cryptography with a Hidden Monomial.
Proceedings of the Advances in Cryptology, 1996

1995
Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88.
Proceedings of the Advances in Cryptology, 1995

1994
Collisions and Inversions for Damgård's Whole Hash Function.
Proceedings of the Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28, 1994

1993
How to Find and Avoid Collisions for the Knapsack Hash Function.
Proceedings of the Advances in Cryptology, 1993

Improved Algorithms for the Permuted Kernel Problem.
Proceedings of the Advances in Cryptology, 1993

1992
How to Construct Pseudorandom and Super Pseudorandom Permutations from one Single Pseudorandom Function.
Proceedings of the Advances in Cryptology, 1992

1991
The Knapsack Hash Function proposed at Crypto'89 can be broken.
Proceedings of the Advances in Cryptology, 1991

New Results on Pseudorandom Permutation Generators Based on the DES Scheme.
Proceedings of the Advances in Cryptology, 1991

1990
Pseudorandom permutations based on the DES scheme.
Proceedings of the EUROCODE '90, 1990

Pseudorandom Permutations Based on the D.E.S. Scheme.
Proceedings of the ESORICS 90, 1990


  Loading...