Search Results - "Ludovic Perret"

Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic by Bettale, Luk, Faugère, Jean-Charles, Perret, Ludovic

“…We investigate in this paper the security of HFE and Multi-HFE schemes as well as their minus and embedding variants. Multi-HFE is a generalization of the…”
Get full text

Cryptanalysis of the extension field cancellation cryptosystem by Chakraborty, Olive, Faugère, Jean-Charles, Perret, Ludovic

“…In this article, we present algebraic attacks against the Extension Field Cancellation ( EFC ) scheme, a multivariate public-key encryption scheme which was…”
Get full text

On the complexity of the BKW algorithm on LWE by Albrecht, Martin R., Cid, Carlos, Faugère, Jean-Charles, Fitzpatrick, Robert, Perret, Ludovic

“…This work presents a study of the complexity of the Blum–Kalai–Wasserman (BKW) algorithm when applied to the Learning with Errors (LWE) problem, by providing…”
Get full text

Hybrid approach for solving multivariate systems over finite fields by Bettale Luk, Faugère Jean-Charles, Perret Ludovic

“…In this paper, we present an improved approach to solve multivariate systems over finite fields. Our approach is a tradeoff between exhaustive search and…”
Get full text

Software Toolkit for HFE-based Multivariate Schemes by Jean-Charles Faugère, Ludovic Perret, Jocelyn Ryckeghem

“…In 2017, NIST shook the cryptographic world by starting a process for standardizing post-quantum cryptography. Sixty-four submissions have been considered for…”
Get full text

A Distinguisher for High-Rate McEliece Cryptosystems by Faugere, Jean-Charles, Gauthier-Umana, Valerie, Otmani, Ayoub, Perret, Ludovic, Tillich, Jean-Pierre

“…The Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. The hardness of this problem is an…”
Get full text

A distinguisher for high rate McEliece cryptosystems by Faugere, J-C, Gauthier-Umana, V., Otmani, A., Perret, L., Tillich, J-P

“…The Goppa Code Distinguishing (GCD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. Up to now, it is widely believed that…”
Get full text

Software Toolkit for HFE-based Multivariate Schemes by Faugère, Jean-Charles, Perret, Ludovic, Ryckeghem, Jocelyn

“…In 2017, NIST shook the cryptographic world by starting a process for standardizing post-quantum cryptography. Sixty-four submissions have been considered for…”
Get full text

A nearly optimal algorithm to decompose binary forms by Bender, Matías R., Faugère, Jean-Charles, Perret, Ludovic, Tsigaridas, Elias

“…Symmetric tensor decomposition is an important problem with applications in several areas, for example signal processing, statistics, data analysis and…”
Get full text

Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups by Faugere, Jean-Charles, Otmani, Ayoub, Perret, Ludovic, de Portzamparc, Frederic, Tillich, Jean-Pierre

“…The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus…”
Get full text

Structural cryptanalysis of McEliece schemes with compact keys by Faugère, Jean-Charles, Otmani, Ayoub, Perret, Ludovic, de Portzamparc, Frédéric, Tillich, Jean-Pierre

“…A very popular trend in code-based cryptography is to decrease the public-key size by focusing on subclasses of alternant/Goppa codes which admit a very…”
Get full text

Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case by Berthomieu, Jérémy, Faugère, Jean-Charles, Perret, Ludovic

“…Let f=(f1,…,fm) and g=(g1,…,gm) be two sets of m≥1 nonlinear polynomials in K[x1,…,xn] (K being a field). We consider the computational problem of finding–if…”
Get full text

Algebraic Cryptanalysis of McEliece Variants with Compact Keys by Faugère, Jean-Charles, Otmani, Ayoub, Perret, Ludovic, Tillich, Jean-Pierre

“…In this paper we propose a new approach to investigate the security of the McEliece cryptosystem. We recall that this cryptosystem relies on the use of…”
Get full text

Hardness of learning problems over Burnside groups of exponent 3 by Fazio, Nelly, Iga, Kevin, Nicolosi, Antonio R., Perret, Ludovic, Skeith, William E.

“…In this work, we investigate the hardness of learning Burnside homomorphisms with noise ( B n - LHN ), a computational problem introduced in the recent work of…”
Get full text

Polly Cracker, revisited by Albrecht, Martin R., Faugère, Jean-Charles, Farshim, Pooya, Herold, Gottfried, Perret, Ludovic

“…We formally treat cryptographic constructions based on the hardness of deciding ideal membership in multivariate polynomial rings. Of particular interest to us…”
Get full text

On the relation between the MXL family of algorithms and Gröbner basis algorithms by Albrecht, Martin R., Cid, Carlos, Faugère, Jean-Charles, Perret, Ludovic

“…The computation of Gröbner bases remains one of the most powerful methods for tackling the Polynomial System Solving (PoSSo) problem. The most efficient known…”
Get full text

Mathematical and computer algebra techniques in cryptology by Faugère, Jean-Charles, Gómez-Pérez, Domingo, Gutierrez, Jaime, Perret, Ludovic

“…This issue of the Journal of Symbolic Computation is devoted to Mathematical and Computer Algebra Techniques in Cryptology. It has been organized after the…”
Get full text

Quantum-Safe Hybrid Key Exchanges with KEM-Based Authentication by Battarbee, Christopher, Striecks, Christoph, Perret, Ludovic, Ramacher, Sebastian, Verhaeghe, Kevin

“…Authenticated Key Exchange (AKE) between any two entities is one of the most important security protocols available for securing our digital networks and…”
Get full text

Foreword by Augot, Daniel, Faugère, Jean-Charles, Perret, Ludovic

Get full text

Foreword by Faugère, Jean-Charles, Perret, Ludovic

Get full text