Just How Hard Are Rotations of $\mathbb {Z}^n$? Algorithms and Cryptography with the Simplest Lattice
- 16 April 2023
- book chapter
- Published by Springer Nature
- p. 252-281
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- On the Lattice Isomorphism Problem2013
- Faster exponential time algorithms for the shortest vector problem2010
- Bonsai Trees, or How to Delegate a Lattice Basis2010
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem2009
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- Hypercubic Lattice Reduction and Analysis of GGH and NTRU Signatures2003
- Computing the M = UU t Integer Matrix Decomposition2003
- Cryptanalysis of the Revised NTRU Signature Scheme2002
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963