Generating Shorter Bases for Hard Random Lattices
Top Cited Papers
Open Access
- 13 July 2010
- journal article
- research article
- Published by Springer Science and Business Media LLC in Theory of Computing Systems
- Vol. 48 (3), 535-553
- https://doi.org/10.1007/s00224-010-9278-3
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A Simple BGN-Type Cryptosystem from LWELecture Notes in Computer Science, 2010
- A Framework for Efficient and Composable Oblivious TransferLecture Notes in Computer Science, 2008
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice ProblemsLecture Notes in Computer Science, 2008
- Worst‐Case to Average‐Case Reductions Based on Gaussian MeasuresSIAM Journal on Computing, 2007
- Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and MoreLecture Notes in Computer Science, 2003
- Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto ’97Lecture Notes in Computer Science, 1999
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Public-key cryptosystems from lattice reduction problemsLecture Notes in Computer Science, 1997
- Lattice points in high-dimensional spheresMonatshefte für Mathematik, 1990