André Chailloux

A tight security reduction in the quantum random oracle model for code-based signature schemes

2017 · arXiv (Cornell University)

Quantum secure signature schemes have a lot of attention recently, in particular because of the NIST call to standardize quantum safe cryptography. However, only few signature schemes can have concrete quantum security because of technical …

A note on the quantum query complexity of permutation symmetric functions

2018 · arXiv (Cornell University)

It is known since the work of [AA14] that for any permutation symmetric function $f$, the quantum query complexity is at most polynomially smaller than the classical randomized query complexity, more precisely that $R(f) = …