Ludovic Perret

According to our database1, Ludovic Perret authored at least 71 papers between 2003 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
A nearly optimal algorithm to decompose binary forms.
J. Symb. Comput., 2021

Cryptanalysis of the extension field cancellation cryptosystem.
Des. Codes Cryptogr., 2021

2019
Software Toolkit for HFE-based Multivariate Schemes.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019

Non-quantum cryptanalysis of the noisy version of Aaronson-Christiano's quantum money scheme.
IET Inf. Secur., 2019

PKP-Based Signature Scheme.
Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

2018
PKP-Based Signature Scheme.
IACR Cryptol. ePrint Arch., 2018

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

2017
Fast Quantum Algorithm for Solving Multivariate Quadratic Equations.
IACR Cryptol. ePrint Arch., 2017

2016
Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups.
IEEE Trans. Inf. Theory, 2016

Structural cryptanalysis of McEliece schemes with compact keys.
Des. Codes Cryptogr., 2016

Polly Cracker, revisited.
Des. Codes Cryptogr., 2016

The Quantum-Safe Revolution.
Proceedings of the Information Security Applications - 17th International Workshop, 2016

A Superfast Randomized Algorithm to Decompose Binary Forms.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Bases de Gröbner en Cryptographie Post-Quantique. (Gröbner bases techniques in Quantum-Safe Cryptography).
, 2016

2015
Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case.
J. Complex., 2015

Hardness of learning problems over Burnside groups of exponent 3.
Des. Codes Cryptogr., 2015

On the complexity of the BKW algorithm on LWE.
Des. Codes Cryptogr., 2015

Algebraic algorithms for LWE problems.
ACM Commun. Comput. Algebra, 2015

Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

2014
Mathematical and computer algebra techniques in cryptology.
J. Symb. Comput., 2014

A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems.
IACR Cryptol. ePrint Arch., 2014

Lazy Modulus Switching for the BKW Algorithm on LWE.
IACR Cryptol. ePrint Arch., 2014

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Structural weakness of compact variants of the McEliece cryptosystem.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
A Distinguisher for High-Rate McEliece Cryptosystems.
IEEE Trans. Inf. Theory, 2013

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions.
IACR Cryptol. ePrint Arch., 2013

Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic.
Des. Codes Cryptogr., 2013

Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials.
CoRR, 2013

2012
On the relation between the MXL family of algorithms and Gröbner basis algorithms.
J. Symb. Comput., 2012

On enumeration of polynomial equivalence classes and their application to MPKC.
Finite Fields Their Appl., 2012

Solving polynomial systems over finite fields: improved analysis of the hybrid approach.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
Random Self-Reducibility Properties of Learning Problems over Burnside Groups of Exponent 3.
IACR Cryptol. ePrint Arch., 2011

New Subexponential Algorithms for Factoring in SL(2, fq).
IACR Cryptol. ePrint Arch., 2011

On Constructing Homomorphic Encryption Schemes from Coding Theory.
IACR Cryptol. ePrint Arch., 2011

Polly Cracker, Revisited.
IACR Cryptol. ePrint Arch., 2011

On the Relation Between the Mutant Strategy and the Normal Selection Strategy in Gröbner Basis Algorithms.
IACR Cryptol. ePrint Arch., 2011

Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

MQQ-SIG - An Ultra-Fast and Provably CMA Resistant Digital Signature Scheme.
Proceedings of the Trusted Systems - Third International Conference, 2011

2010
Foreword.
Math. Comput. Sci., 2010

The Digital Signature Scheme MQQ-SIG.
IACR Cryptol. ePrint Arch., 2010

Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem.
IACR Cryptol. ePrint Arch., 2010

Security analysis of word problem-based cryptosystems.
Des. Codes Cryptogr., 2010

Cryptanalysis of the Hidden Matrix Cryptosystem.
Proceedings of the Progress in Cryptology, 2010

Decomposition of generic multivariate polynomials.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Algebraic Cryptanalysis of McEliece Variants with Compact Keys.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Algebraic Precomputations in Differential and Integral Cryptanalysis.
Proceedings of the Information Security and Cryptology - 6th International Conference, 2010

Analysis of the MQQ Public Key Cryptosystem.
Proceedings of the Cryptology and Network Security - 9th International Conference, 2010

2009
An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography.
J. Symb. Comput., 2009

Foreword.
J. Symb. Comput., 2009

Hybrid approach for solving multivariate systems over finite fields.
J. Math. Cryptol., 2009

On the Security of UOV.
IACR Cryptol. ePrint Arch., 2009

Differential-Algebraic Algorithms for the Isomorphism of Polynomials Problem.
IACR Cryptol. ePrint Arch., 2009

High order derivatives and decomposition of multivariate polynomials.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

A Survey on Polly Cracker Systems.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
Algebraic Cryptanalysis of Curry and Flurry using Correlated Messages.
IACR Cryptol. ePrint Arch., 2008

Total Break of the <i>l</i>-IC Signature Scheme.
Proceedings of the Public Key Cryptography, 2008

Cryptanalysis of MinRank.
Proceedings of the Advances in Cryptology, 2008

Security Analysis of Multivariate Polynomials for Hashing.
Proceedings of the Information Security and Cryptology, 4th International Conference, 2008

Cryptanalysis of the TRMS Signature Scheme of PKC'05.
Proceedings of the Progress in Cryptology, 2008

2007
Algebraic Cryptanalysis of 58-Round SHA-1.
Proceedings of the Fast Software Encryption, 14th International Workshop, 2007

2006
Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects.
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

Cryptanalysis of 2R<sup>-</sup> Schemes.
Proceedings of the Advances in Cryptology, 2006

2005
A Chosen Ciphertext Attack on a Public Key Cryptosystem Based on Lyndon Words.
IACR Cryptol. ePrint Arch., 2005

On the Wagner-Magyarik Cryptosystem.
Proceedings of the Coding and Cryptography, International Workshop, 2005

A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem.
Proceedings of the Advances in Cryptology, 2005

2004
On the computational complexity of some equivalence problems of polynomial systems of equations over finite fields
Electron. Colloquium Comput. Complex., 2004

A differential approach to a polynomial equivalence problem.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups.
Proceedings of the Progress in Cryptology, 2004

2003
Polynomial Equivalence Problems and Applications to Multivariate Cryptosystems.
Proceedings of the Progress in Cryptology, 2003


  Loading...