Solving BDD by Enumeration: An Update

DOI10.1007/978-3-642-36095-4_19zbMath1312.94070OpenAlexW1547036183MaRDI QIDQ4910246

Phong Q. Nguyen, Ming-Jie Liu

Publication date: 18 March 2013

Published in: Topics in Cryptology – CT-RSA 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36095-4_19

zbMATH Keywords

shortest vectors in latticesBounded Distance Decoding (BDD)enumeration with pruning speedup

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (27)

Evaluating the Cache Side Channel Attacks Against ECDSA ⋮ Homomorphic Encryption Standard ⋮ Partially Known Nonces and Fault Injection Attacks on SM2 Signature Algorithm ⋮ Coded-BKW: Solving LWE Using Lattice Codes ⋮ An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices ⋮ On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes ⋮ Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA ⋮ On the Efficacy of Solving LWE by Reduction to Unique-SVP ⋮ High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers ⋮ A Low Data Complexity Attack on the GMR-2 Cipher Used in the Satellite Phones ⋮ Faster Dual Lattice Attacks for Solving LWE with Applications to CRYSTALS ⋮ On the hardness of module learning with errors with short distributions ⋮ On the asymptotic complexity of solving LWE ⋮ Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds ⋮ Revisiting group oriented secret sharing schemes ⋮ An Experimental Study of Kannan’s Embedding Technique for the Search LWE Problem ⋮ A public-key encryption scheme based on non-linear indeterminate equations ⋮ On the complexity of the BKW algorithm on LWE ⋮ Random Sampling Revisited: Lattice Enumeration with Discrete Pruning ⋮ On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Post-Quantum Cryptography: State of the Art ⋮ Safe-Errors on SPA Protected Implementations with the Atomicity Technique ⋮ TFHE: fast fully homomorphic encryption over the torus ⋮ On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem ⋮ Parallel Implementation of BDD Enumeration for LWE ⋮ On the success probability of solving unique SVP via BKZ

This page was built for publication: Solving BDD by Enumeration: An Update