fplll contains several algorithms on lattices that rely on floating-point computations. This includes implementations of the floating-point LLL reduction algorithm, offering different speed/guarantees ratios. It contains a ’wrapper’ choosing the estimated best sequence of variants in order to provide a guaranteed output as fast as possible. In the case of the wrapper, the succession of variants is oblivious to the user. It also includes a rigorous floating-point implementation of the Kannan-Fincke-Pohst algorithm that finds a shortest non-zero lattice vector, and the BKZ reduction algorithm.
Keywords for this software
References in zbMATH (referenced in 10 articles )
Showing results 1 to 10 of 10.
- Bi, Jingguo; Liu, Jiayang; Wang, Xiaoyun: Cryptanalysis of a homomorphic encryption scheme over integers (2017)
- Albrecht, Martin; Bai, Shi; Ducas, Léo: A subfield lattice attack on overstretched NTRU assumptions. Cryptanalysis of some FHE and graded encoding schemes (2016)
- Raum, Martin: Computing genus 1 Jacobi forms (2016)
- van de Pol, Joop; Smart, Nigel P.; Yarom, Yuval: Just a little bit more (2015)
- Albrecht, Martin R.; Faugère, Jean-Charles; Fitzpatrick, Robert; Perret, Ludovic; Todo, Yosuke; Xagawa, Keita: Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions (2014)
- Plantard, Thomas; Susilo, Willy; Zhang, Zhenfei: Lattice reduction for modular knapsack (2013)
- Hanrot, Guillaume; Pujol, Xavier; Stehlé, Damien: Algorithms for the shortest and closest lattice vector problems (2011)
- Schneider, Michael: Analysis of Gauss-sieve for solving the shortest vector problem in lattices (2011)
- Pujol, Xavier; Stehlé, Damien: Rigorous and efficient short lattice vectors enumeration (2008)
- Roune, Bjarke Hammersholt: Solving thousand-digit Frobenius problems using Gröbner bases (2008)