Zobrazeno 1 - 10
of 112
pro vyhledávání: '"Chailloux, André"'
Autor:
Chailloux, André, Tillich, Jean-Pierre
In the last years, Regev's reduction has been used as a quantum algorithmic tool for providing a quantum advantage for variants of the decoding problem. Following this line of work, the authors of [JSW+24] have recently come up with a quantum algorit
Externí odkaz:
http://arxiv.org/abs/2411.12553
Autor:
Chailloux, André, Etinski, Simona
Stern's signature scheme is a historically important code-based signature scheme. A crucial optimization of this scheme is to generate pseudo-random vectors and a permutation instead of random ones, and most proposals that are based on Stern's signat
Externí odkaz:
http://arxiv.org/abs/2408.15843
Understanding the maximum size of a code with a given minimum distance is a major question in computer science and discrete mathematics. The most fruitful approach for finding asymptotic bounds on such codes is by using Delsarte's theory of associati
Externí odkaz:
http://arxiv.org/abs/2405.07666
Autor:
Chailloux, André, Tillich, Jean-Pierre
One of the founding results of lattice based cryptography is a quantum reduction from the Short Integer Solution problem to the Learning with Errors problem introduced by Regev. It has recently been pointed out by Chen, Liu and Zhandry that this redu
Externí odkaz:
http://arxiv.org/abs/2310.20651
Autor:
Barsamian, Yann, Chailloux, André
Inverted indexes allow to query large databases without needing to search in the database at each query. An important line of research is to construct the most efficient inverted indexes, both in terms of compression ratio and time efficiency. In thi
Externí odkaz:
http://arxiv.org/abs/2209.02089
Given a random function $f$ with domain $[2^n]$ and codomain $[2^m]$, with $m \geq n$, a collision of $f$ is a pair of distinct inputs with the same image. Collision finding is an ubiquitous problem in cryptanalysis, and it has been well studied usin
Externí odkaz:
http://arxiv.org/abs/2205.14023
Autor:
Chailloux, André, Barsamian, Yann
Relativistic cryptography is a proposal for achieving unconditional security that exploits the fact that no information carrier can travel faster than the speed of light. It is based on space-time constraints but doesn't require quantum hardware. Nev
Externí odkaz:
http://arxiv.org/abs/2112.01386
Autor:
Chailloux, André, Loyer, Johanna
Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) is arguably the most important problem for the cryptanalysis of lattice-based cryptography, and many lattice-based schemes hav
Externí odkaz:
http://arxiv.org/abs/2105.05608
The security of code-based cryptography usually relies on the hardness of the syndrome decoding (SD) problem for the Hamming weight. The best generic algorithms are all improvements of an old algorithm by Prange, and they are known under the name of
Externí odkaz:
http://arxiv.org/abs/2104.12810
Instantaneous nonlocal quantum computation (INQC) evades apparent quantum and relativistic constraints and allows to attack generic quantum position verification (QPV) protocols (aiming at securely certifying the location of a distant prover) at an e
Externí odkaz:
http://arxiv.org/abs/2007.15808