138 citations · 204 across the 15 of their papers we have counts for
17 papers
Security Assessment of the LG Cryptosystem
Étienne Burle, Hervé Talé Kalachi, Freddy Lende Metouke +1
The LG cryptosystem is a public-key encryption scheme in the rank metric using the recent family of $\lambdav-$Gabidulin codes and introduced in 2019 by Lau and Tan. In this paper,…
Injective Rank Metric Trapdoor Functions with Homogeneous Errors
Étienne Burle, Philippe Gaborit, Younes Hatri +1
In rank-metric cryptography, a vector from a finite dimensional linear space over a finite field is viewed as the linear space spanned by its entries. The rank decoding problem whi…
An Upper-Bound on the Decoding Failure Probability of the LRPC Decoder
Étienne Burle, Ayoub Otmani
Low Rank Parity Check (LRPC) codes form a class of rank-metric error-correcting codes that was purposely introduced to design public-key encryption schemes. An LRPC code is defined…
Practical Algebraic Attack on DAGS
Magali Bardet, Manon Bertin, Alain Couvreur +1
DAGS scheme is a key encapsulation mechanism (KEM) based on quasi-dyadic alternant codes that was submitted to NIST standardization process for a quantum resistant public key algor…
Permutation Code Equivalence is not Harder than Graph Isomorphism when Hulls are Trivial
Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha
The paper deals with the problem of deciding if two finite-dimensional linear subspaces over an arbitrary field are identical up to a permutation of the coordinates. This problem i…
Cryptanalysis of an Identity-Based Authenticated Key Exchange Protocol
Younes Hatri, Ayoub Otmani, Kenza Guenda
Authenticated Key Exchange (AKE) protocols represent an important cryptographic mechanism that enables several parties to communicate securely over an open network. Elashry, Mu and…
Polynomial-Time Key Recovery Attack on the Faure-Loidreau Scheme based on Gabidulin Codes
Philippe Gaborit, Ayoub Otmani, Hervé Talé Kalachi
Encryption schemes based on the rank metric lead to small public key sizes of order of few thousands bytes which represents a very attractive feature compared to Hamming metric-bas…
Algebraic Properties of Polar Codes From a New Polynomial Formalism
Magali Bardet, Vlad Dragoi, Ayoub Otmani +1
Polar codes form a very powerful family of codes with a low complexity decoding algorithm that attain many information theoretic limits in error correction and source coding. These…
Improved Cryptanalysis of Rank Metric Schemes Based on Gabidulin Codes
Ayoub Otmani, Hervé Talé Kalachi, Sélestin Ndjeya
We prove that any variant of the GPT cryptosystem which uses a right column scrambler over the extension field as advocated by the works of Gabidulin et al. with the goal to resist…
A Polynomial-Time Attack on the BBCRS Scheme
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich +1
The BBCRS scheme is a variant of the McEliece public-key encryption scheme where the hiding phase is performed by taking the inverse of a matrix which is of the form $\mathbf{T} +\…
Folding Alternant and Goppa Codes with Non-Trivial Automorphism Groups
Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret +2
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 on subclasses of alter…
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich
We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such co…
New Identities Relating Wild Goppa Codes
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich
For a given support and a polynomial with no roots in , we prove equality between the -ary Goppa codes $Γ…
Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes
Alain Couvreur, Philippe Gaborit, Valérie Gauthier-Umaña +2
Because of their interesting algebraic properties, several authors promote the use of generalized Reed-Solomon codes in cryptography. Niederreiter was the first to suggest an insta…
A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes
Valérie Gauthier, Ayoub Otmani, Jean-Pierre Tillich
Baldi et \textit{al.} proposed a variant of McEliece's cryptosystem. The main idea is to replace its permutation matrix by adding to it a rank 1 matrix. The motivation for this cha…
A Distinguisher-Based Attack of a Homomorphic Encryption Scheme Relying on Reed-Solomon Codes
Valérie Gauthier, Ayoub Otmani, Jean-Pierre Tillich
Bogdanov and Lee suggested a homomorphic public-key encryption scheme based on error correcting codes. The underlying public code is a modified Reed-Solomon code obtained from inse…
Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes
Ayoub Otmani, Jean-Pierre Tillich, Leonard Dallot
We cryptanalyse here two variants of the McEliece cryptosystem based on quasi-cyclic codes. Both aim at reducing the key size by restricting the public and secret generator matrice…