Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices

DOI10.1007/s10623-018-0573-3zbMath1409.94943OpenAlexW2798439327MaRDI QIDQ1999896

Léo Ducas, Cécile Pierrot

Publication date: 27 June 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/28103

zbMATH Keywords

bounded distance decoding (BDD)dense latticesMinkoswki's bound

Mathematics Subject Classification ID

Bounds on codes (94B65) Lattice packing and covering (number-theoretic aspects) (11H31) Decoding (94B35) Relations with coding theory (11H71)

Related Items (2)

On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Obfuscated fuzzy Hamming distance and conjunctions from subset product problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Tours de corps de classes et estimations de discriminants
• On the Chor-Rivest knapsack cryptosystem
• List-decoding Barnes-Wall lattices
• Linear Bandwidth Naccache-Stern Encryption
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• Mordell-Weil Lattices and Sphere Packings
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• On coding without restrictions for the AWGN channel
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic

This page was built for publication: Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices