Improved Reduction from the Bounded Distance Decoding Problem to 
the Unique Shortest Vector Problem in Lattices

Shi Bai; Damien Stehlé; Wen Weiqiang

doi:10.4230/LIPIcs.ICALP.2016.76

Conference papers

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices

Shi Bai ¹ Damien Stehlé ^{1, 2} Wen Weiqiang ¹

1 ARIC - Arithmetic and Computing

Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme

2 LIP - Laboratoire de l'Informatique du Parallélisme

Document type :

Conference papers

Domain :

Computer Science [cs]

Complete list of metadata

https://hal.inria.fr/hal-01394213
Contributor : Damien Stehle <>
Submitted on : Tuesday, November 8, 2016 - 8:28:05 PM
Last modification on : Friday, June 25, 2021 - 3:40:05 PM

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices

Identifiers

Collections

Citation

Export

Metrics

259

Contact Legal Notice Personal Data

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices

Identifiers

Collections

Citation

Export

Share

Metrics

259

Contact Legal Notice Personal Data