Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices

DOI10.1007/978-3-642-29952-0_18zbMath1354.68274OpenAlexW2106589562MaRDI QIDQ2898025

Jingguo Bi, Qi Cheng

Publication date: 16 July 2012

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-29952-0_18

zbMATH Keywords

Kolmogorov complexityshortest vector problemGaussian heuristicNTRU latticesrandom lattices

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (2)

Lower bounds of shortest vector lengths in random NTRU lattices ⋮ Provably Secure NTRU Instances over Prime Cyclotomic Rings

This page was built for publication: Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices