Benjamin Wesolowski
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
- Léo Ducasonce
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| 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… | ||
| nothing matches | ||