Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices.
Saved in:
| Title: | Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices. |
|---|---|
| Authors: | Ducas, Léo, Pierrot, Cécile |
| Source: | Designs, Codes & Cryptography; Aug2019, Vol. 87 Issue 8, p1737-1748, 12p |
| Subject Terms: | POLYNOMIAL time algorithms, RADIUS (Geometry), TARDINESS, DECODING algorithms, LOGARITHMS, BUILDING design & construction, DISTANCES |
| Company/Entity: | INSTITUTE of Electrical & Electronics Engineers |
| Abstract: | We propose a concrete family of dense lattices of arbitrary dimension n in which the lattice bounded distance decoding (BDD) problem can be solved in deterministic polynomial time. This construction is directly adapted from the Chor–Rivest cryptosystem (IEEE-TIT 1988). The lattice construction needs discrete logarithm computations that can be made in deterministic polynomial time for well-chosen parameters. Each lattice comes with a deterministic polynomial time decoding algorithm able to decode up to large radius. Namely, we reach decoding radius within O (log n) Minkowski's bound, for both ℓ 1 and ℓ 2 norms. [ABSTRACT FROM AUTHOR] |
| Copyright of Designs, Codes & Cryptography is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!