Generating shorter bases for hard random lattices
type: Item
instance of: scholarly article
title: Generating shorter bases for hard random lattices
zbMATH Open document ID: 1217.94092
author: Joël Alwen
author: Chris Peikert
published in: Theory of Computing Systems
publication date: 2011-05-23T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/1832/
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11H06
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5898935
zbMATH Keywords: lattices
zbMATH Keywords: average-case hardness
zbMATH Keywords: cryptography
zbMATH Keywords: Hermite normal form
MaRDI profile type: Publication
OpenAlex ID: W2130410178
cites work: Q4938616
cites work: Bonsai Trees, or How to Delegate a Lattice Basis
cites work: Collision-Free Hashing from Lattice Problems
cites work: Q4364546
cites work: A Simple BGN-Type Cryptosystem from LWE
cites work: Trapdoors for hard lattices and new cryptographic constructions
cites work: A Pseudorandom Generator from any One-way Function
cites work: Lattice points in high-dimensional spheres
cites work: Q4787204
cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
cites work: Lattice-based Cryptography
cites work: Advances in Cryptology - CRYPTO 2003
cites work: A linear space algorithm for computing the hermite normal form
cites work: Q4941861
cites work: Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
cites work: Public-key cryptosystems from the worst-case shortest vector problem
cites work: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
cites work: A Framework for Efficient and Composable Oblivious Transfer
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
DOI: 10.1007/S00224-010-9278-3
description: scientific article; zbMATH DE number 5898935