LLL for ideal lattices: re-evaluation of the security of Gentry–Halevi’s FHE scheme
- 23 March 2014
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 76 (2) , 325-344
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme2011
- Computing arbitrary functions of encrypted dataCommunications of the ACM, 2010
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes2010
- Faster Fully Homomorphic Encryption2010
- Predicting Lattice Reduction2008
- Asymptotically Efficient Lattice-Based Digital Signatures2008
- Fast LLL-type lattice reductionInformation and Computation, 2005
- On the equidistribution of Hecke pointsForum Mathematicum, 2003
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982