Zobrazit v EDS

A note on BDD problems with -gap.

Uloženo v:
Podrobná bibliografie
Název: A note on BDD problems with -gap.
Autoři: Liu, Mingjie1,2, Wang, Xiaoyun2,3, Xu, Guangwu2,4, Zheng, Xuexin3
Zdroj: Information Processing Letters. Jan2014, Vol. 114 Issue 1/2, p9-12. 4p.
Témata: *PROBLEM solving, MATHEMATICAL bounds, DECODERS & decoding, LATTICE theory, COMPUTER science research, CODING theory
Abstrakt: Abstract: In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions (Bounded Distance Decoding Problem) ⩽ (Unique Shortest Vector Problem) ⩽ , and posed an open problem whether the reduction gap can be closed. This paper concerns bounded distance decoding (BDD) problems for lattices with large -gap. In the presence of larger -gap, better reductions from BDD to uSVP and exact SVP are obtained. Some result can be regarded as a partial solution to the open problem. [Copyright &y& Elsevier]
Copyright of Information Processing Letters is the property of Elsevier B.V. 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.)
Databáze: Business Source Index
Popis
Abstrakt:Abstract: In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions (Bounded Distance Decoding Problem) ⩽ (Unique Shortest Vector Problem) ⩽ , and posed an open problem whether the reduction gap can be closed. This paper concerns bounded distance decoding (BDD) problems for lattices with large -gap. In the presence of larger -gap, better reductions from BDD to uSVP and exact SVP are obtained. Some result can be regarded as a partial solution to the open problem. [Copyright &y& Elsevier]
ISSN:00200190
DOI:10.1016/j.ipl.2013.10.004