Improving BDD Cryptosystems in General Lattices
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 152-167
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 20032007
- Representing hard lattices with O(n log n) bits2005
- Immunizing Encryption Schemes from Decryption Errors2004
- A Lattice- Based Public-Key CryptosystemLecture Notes in Computer Science, 1999
- A public-key cryptosystem with worst-case/average-case equivalence1997
- Lattice Attacks on NTRU1997
- Eliminating decryption errors in the Ajtai-Dwork Cryptosystem1997
- Generating hard instances of lattice problems (extended abstract)1996
- A Course in Computational Algebraic Number Theory1993
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986