• Publications
  • Influence
How to Achieve a McEliece-Based Digital Signature Scheme
TLDR
We show that it is indeed possible to construct a practical signature scheme based on Niederreiter’s variant [12] on the McEliece cryptosystem. Expand
  • 359
  • 35
  • PDF
Security Bounds for the Design of Code-Based Cryptosystems
TLDR
Code-based cryptography is often viewed as an interesting "Post-Quantum" alternative to the classical number theory cryptography. Expand
  • 211
  • 23
  • PDF
A Family of Fast Syndrome Based Cryptographic Hash Functions
TLDR
We present a family of secure hash functions, whose security is directly related to the syndrome decoding problem from the theory of error-correcting codes. Expand
  • 82
  • 11
  • PDF
Reconstruction of punctured convolutional codes
TLDR
We present here a new technique to reconstruct punctured convolutional codes from a noisy intercepted bit-stream. Expand
  • 45
  • 8
  • PDF
Direct Construction of Recursive MDS Diffusion Layers Using Shortened BCH Codes
TLDR
Recursive MDS matrices allow to build optimal linear diffusion layers in block ciphers. Expand
  • 63
  • 7
  • PDF
Recovering a code's length and synchronization from a noisy intercepted bitstream
TLDR
We focus on the problem of recovering the length and synchronization of a linear block code from an intercepted bitstream. Expand
  • 44
  • 5
  • PDF
Exhaustive search for small dimension recursive MDS diffusion layers for block ciphers and hash functions
  • D. Augot, M. Finiasz
  • Mathematics, Computer Science
  • IEEE International Symposium on Information…
  • 15 May 2013
TLDR
This article presents a new algorithm to find MDS matrices that are well suited for use as a diffusion layer in lightweight block ciphers, yielding an efficient 80-bit diffusion layer with maximal branch number. Expand
  • 44
  • 4
  • PDF
A Fast Provably Secure Cryptographic Hash Function
TLDR
We propose a family of fast and provably secure cryptographic hash functions. Expand
  • 31
  • 4
  • PDF
TCHo: A Hardware-Oriented Trapdoor Cipher
TLDR
This paper improves the Finiasz-Vaudenay construction of \(\mathcal{TCH}o\), a hardware-oriented public-key cryptosystem, whose security relies on the hardness of finding a low-weight multiple of a given polynomial, and on the decoding of certain noisy cyclic linear codes. Expand
  • 22
  • 4
  • PDF