• Publications
  • Influence
Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels
TLDR
We introduce a new family of full-diversity LDPC codes that exhibit near-outage-limit performance under iterative decoding for all block-lengths. Expand
  • 112
  • 18
  • PDF
Generalized low density (Tanner) codes
TLDR
We build a class of pseudo-random error correcting codes, called generalized low density codes (GLD), from the intersection of two interleaved block codes. Expand
  • 184
  • 16
  • PDF
Hashing with SL_2
TLDR
We propose a new family of hash functions based on computations over a finite field of characteristic 2 based on the arithmetic of the group of matrices SL2. Expand
  • 82
  • 14
BIKE: Bit Flipping Key Encapsulation
TLDR
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. Expand
  • 52
  • 13
  • PDF
Quantum LDPC codes with positive rate and minimum distance proportional to n½
TLDR
We build quantum LDPC codes with fixed non-zero rate and prove that their minimum distance grows proportionally to the square root of the blocklength. Expand
  • 63
  • 12
  • PDF
Group-theoretic hash functions
TLDR
We discuss the security of group-theoretic hash functions for cryptographic purposes. Expand
  • 41
  • 10
Error exponents of expander codes
  • A. Barg, G. Zémor
  • Mathematics, Computer Science
  • IEEE Trans. Inf. Theory
  • 24 June 2001
TLDR
We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. Expand
  • 104
  • 9
  • PDF
Theoretical and Practical Boundaries of Binary Secure Sketches
TLDR
We propose a method that models discrepancies between biometric measurements as an erasure and error channel, and we estimate its capacity. Expand
  • 100
  • 9
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
  • J. Tillich, G. Zémor
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 3 March 2009
TLDR
We propose a construction of quantum LDPC codes with fixed non-zero rate and prove that the minimum distance grows proportionally to the square root of the blocklength. Expand
  • 111
  • 8
  • PDF
Ouroboros: A Simple, Secure and Efficient Key Exchange Protocol Based on Coding Theory
TLDR
We introduce Ouroboros (The Ouro Boros symbol is an ancient symbol which represents the notion of cyclicity in many civilizations), a new Key Exchange protocol based on coding theory. Expand
  • 37
  • 8
  • PDF