Accelerating Lattice Reduction with FPGAs

DOI10.1007/978-3-642-14712-8_8zbMath1285.94056OpenAlexW1579367023MaRDI QIDQ3584979

Xavier Pujol, Damien Stehlé, Guillaume Hanrot, Jérémie Detrey

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14712-8_8

zbMATH Keywords

FPGAEuclidean latticesShortest Vector Problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (4)

Another 80-dimensional extremal lattice ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices ⋮ A Parallel Implementation of GaussSieve for the Shortest Vector Problem in Lattices

This page was built for publication: Accelerating Lattice Reduction with FPGAs