Léo Ducas
where else to find them
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Benjamin Wesolowskionce
- Erdem Alkimonce
- Peter Schwabeonce
all 4 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Lattice based cryptography | Post-Quantum Cryptography Conference Amsterdam 2023 | 2023-11-07 |
Lattice cryptography explains encryption as encoding a message as a lattice point then adding noise so decryption is matrix–vector multiplications with a short… | ||
| New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks | Lattices: Geometry, Algorithms and Hardness 2020 | 2020-02-18 |
Shows a worst-case to average-case reduction for Hermite-ideal SVP: if an oracle solves random ideal lattices of a ring, the reduction solves any ideal lattice… | ||
| Algorithms for Algebraic Lattices: Classical and Quantum | Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020 | 2020-01-21 |
Claim: quantum procedures turn ideal-SVP on cyclotomic rings from seemingly exponential hardness into an approx exp(√n) drop (and even polynomial beyond that… | ||
| Post-quantum Key Exchange—A New Hope | USENIX Security '16 | 2016-08-10 |
Post-quantum key-exchange called New Hope targets Ring-LWE at 1024-dimension and swaps BCNS’s discrete Gaussian for a portable binomial noise from Hamming… | ||
| nothing matches | ||