Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
type: Item
instance of: scholarly article
title: Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
zbMATH Open document ID: 1409.94943
author: Léo Ducas
author: Cécile Pierrot
published in: Designs, Codes and Cryptography
publication date: 2019-06-27T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/28103
Mathematics Subject Classification ID: 94B35
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 11H31
Mathematics Subject Classification ID: 11H71
zbMATH DE Number: 7074416
zbMATH Keywords: dense lattices
zbMATH Keywords: bounded distance decoding (BDD)
zbMATH Keywords: Minkoswki's bound
MaRDI profile type: Publication
OpenAlex ID: W2798439327
cites work: A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
cites work: Linear Bandwidth Naccache-Stern Encryption
cites work: A knapsack-type public key cryptosystem based on arithmetic in finite fields
cites work: Q4317276
cites work: List-decoding Barnes-Wall lattices
cites work: Factoring integers with elliptic curves
cites work: On the Chor-Rivest knapsack cryptosystem
cites work: Tours de corps de classes et estimations de discriminants
cites work: Q4536799
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: On coding without restrictions for the AWGN channel
cites work: Q3839484
cites work: Mordell-Weil Lattices and Sphere Packings
DOI: 10.1007/S10623-018-0573-3
description: scientific article; zbMATH DE number 7074416