Pierre Loidreau

According to our database1, Pierre Loidreau authored at least 30 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Cryptanalysis of rank-metric schemes based on distorted Gabidulin codes.
IACR Cryptol. ePrint Arch., 2023

2022
LowMS: a new rank metric code-based KEM without ideal structure.
IACR Cryptol. ePrint Arch., 2022

2021
An analysis of Coggia-Couvreur attack on Loidreau's rank-metric public key encryption scheme in the general case.
CoRR, 2021

On the decoding of the sum of Gabidulin codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

2019
On circulant involutory MDS matrices.
Des. Codes Cryptogr., 2019

RAMESSES, a Rank Metric Encryption Scheme with Short Keys.
CoRR, 2019

Using algebraic structures to improve LDPC code reconstruction over a noisy channel.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Generalized Gabidulin codes over fields of any characteristic.
Des. Codes Cryptogr., 2018

2017
A new rank metric codes based encryption scheme.
IACR Cryptol. ePrint Arch., 2017

2016
Direct construction of quasi-involutory recursive-like MDS matrices from 2-cyclic codes.
IACR Cryptol. ePrint Arch., 2016

2014
Asymptotic behaviour of codes in rank metric over finite fields.
Des. Codes Cryptogr., 2014

2013
Rank metric and Gabidulin codes in characteristic zero.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Projected subcodes of the second order binary Reed-Muller code.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2010
Designing a Rank Metric Based McEliece Cryptosystem.
Proceedings of the Post-Quantum Cryptography, Third International Workshop, 2010

2009
Skew codes of prescribed distance or rank.
Des. Codes Cryptogr., 2009

2008
Properties of subspace subcodes of Gabidulin codes.
Adv. Math. Commun., 2008

2007
Metrique rang et cryptographie. (Rank metric and cryptography).
, 2007

2006
Properties of codes in rank metric
CoRR, 2006

Properties of subspace subcodes of optimum codes in rank metric
CoRR, 2006

2005
How to Mask the Structure of Codes for a Cryptographic Use.
Des. Codes Cryptogr., 2005

A Welch-Berlekamp Like Algorithm for Decoding Gabidulin Codes.
Proceedings of the Coding and Cryptography, International Workshop, 2005

A New Public-Key Cryptosystem Based on the Problem of Reconstructing <i>p</i>-Polynomials.
Proceedings of the Coding and Cryptography, International Workshop, 2005

Application of Groebner bases techniques for searching new sequences with good periodic correlation properties.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On subcodes of codes in rank metric.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Designing an Efficient and Secure Public-Key Cryptosystem Based on Reducible Rank Codes.
Proceedings of the Progress in Cryptology, 2004

2003
Using the Trace Operator to repair the Polynomial Reconstruction based Cryptosystem presented at Eurocrypt 2003.
IACR Cryptol. ePrint Arch., 2003

2001
Weak keys in the McEliece public-key cryptosystem.
IEEE Trans. Inf. Theory, 2001

Codes Derived from Binary Goppa Codes.
Probl. Inf. Transm., 2001

2000
Strengthening McEliece Cryptosystem.
Proceedings of the Advances in Cryptology, 2000


  Loading...