scientific article; zbMATH DE number 2196508
From MaRDI portal
Publication:5465355
zbMath1071.11041MaRDI QIDQ5465355
Publication date: 22 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography, Improved hardness results for unique shortest vector problem, A note on the concrete hardness of the shortest independent vector in lattices, Bonsai trees, or how to delegate a lattice basis, Lattice Point Enumeration on Block Reduced Bases, Functional commitments for all functions, with transparent setup and from SIS, Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP), Cryptographic Functions from Worst-Case Complexity Assumptions, Asymptotically Efficient Lattice-Based Digital Signatures, Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures, The Geometry of Lattice Cryptography, A new Gaussian sampling for trapdoor lattices with arbitrary modulus, The remote set problem on lattices
