The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP

DOI10.2140/obs.2020.4.251zbMath1472.11318OpenAlexW3117387215MaRDI QIDQ5853801

Thomas Espitau, Paul Kirchner

Publication date: 11 March 2021

Published in: Open Book Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/obs.2020.4.251

zbMATH Keywords

latticeclosest vector problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (3)

On the Security of OSIDH ⋮ A key-recovery attack against Mitaka in the \(t\)-probing model ⋮ Shorter hash-and-sign lattice-based signatures

This page was built for publication: The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP