A note on BDD problems with lambda 2 lambda 2-gap

A note on BDD problems with lambda 2 lambda 2-gap

In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD1/2 gamma BDD1/2 gamma (Bounded Distance Decoding Problem) [el] uSVP gamma uSVP gamma (Unique Shortest Vector Problem) [el] BDD1/ gamma BDD1/ gamma , and posed an open problem whether the reduction gap can be closed. This paper conc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2014-02, Vol.114 (1-2), p.9-12
Hauptverfasser: Liu, Mingjie, Wang, Xiaoyun, Xu, Guangwu, Zheng, Xuexin
Format: Artikel
Sprache:eng
Schlagworte:
Data processing
Decoding
Lattices
Mathematical analysis
Reduction
Vectors (mathematics)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 12
container_issue 1-2
container_start_page 9
container_title Information processing letters
container_volume 114
creator Liu, Mingjie
Wang, Xiaoyun
Xu, Guangwu
Zheng, Xuexin
description In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD1/2 gamma BDD1/2 gamma (Bounded Distance Decoding Problem) [el] uSVP gamma uSVP gamma (Unique Shortest Vector Problem) [el] BDD1/ gamma BDD1/ gamma , and posed an open problem whether the reduction gap can be closed. This paper concerns bounded distance decoding (BDD) problems for lattices with large lambda 2 lambda 2-gap. In the presence of larger lambda 2 lambda 2-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.
doi_str_mv 10.1016/j.ipl.2013.10.004
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1531029267</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1531029267</sourcerecordid><originalsourceid>FETCH-proquest_miscellaneous_15310292673</originalsourceid><addsrcrecordid>eNqVi70OgjAURjtoIv48gNsdXaj3tghhVNH4AO6kaFVIoeiF-PoyGHen75zkfEIsCSUhxetKlq2TCkkPLhGjkQgQFYZIKU7ElLlCxDjSSSBoC43vLPgGdlkG7csXztYM77J7gDN1cTWgfhDeTTsX45txbBffnYnV8XDen8Lh--wtd3ld8sU6Zxrre85powlVquJE_5F-AMUGOpY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1531029267</pqid></control><display><type>article</type><title>A note on BDD problems with lambda 2 lambda 2-gap</title><source>Access via ScienceDirect (Elsevier)</source><creator>Liu, Mingjie ; Wang, Xiaoyun ; Xu, Guangwu ; Zheng, Xuexin</creator><creatorcontrib>Liu, Mingjie ; Wang, Xiaoyun ; Xu, Guangwu ; Zheng, Xuexin</creatorcontrib><description>In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD1/2 gamma BDD1/2 gamma (Bounded Distance Decoding Problem) [el] uSVP gamma uSVP gamma (Unique Shortest Vector Problem) [el] BDD1/ gamma BDD1/ gamma , and posed an open problem whether the reduction gap can be closed. This paper concerns bounded distance decoding (BDD) problems for lattices with large lambda 2 lambda 2-gap. In the presence of larger lambda 2 lambda 2-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.</description><identifier>ISSN: 0020-0190</identifier><identifier>DOI: 10.1016/j.ipl.2013.10.004</identifier><language>eng</language><subject>Data processing ; Decoding ; Lattices ; Mathematical analysis ; Reduction ; Vectors (mathematics)</subject><ispartof>Information processing letters, 2014-02, Vol.114 (1-2), p.9-12</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Liu, Mingjie</creatorcontrib><creatorcontrib>Wang, Xiaoyun</creatorcontrib><creatorcontrib>Xu, Guangwu</creatorcontrib><creatorcontrib>Zheng, Xuexin</creatorcontrib><title>A note on BDD problems with lambda 2 lambda 2-gap</title><title>Information processing letters</title><description>In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD1/2 gamma BDD1/2 gamma (Bounded Distance Decoding Problem) [el] uSVP gamma uSVP gamma (Unique Shortest Vector Problem) [el] BDD1/ gamma BDD1/ gamma , and posed an open problem whether the reduction gap can be closed. This paper concerns bounded distance decoding (BDD) problems for lattices with large lambda 2 lambda 2-gap. In the presence of larger lambda 2 lambda 2-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.</description><subject>Data processing</subject><subject>Decoding</subject><subject>Lattices</subject><subject>Mathematical analysis</subject><subject>Reduction</subject><subject>Vectors (mathematics)</subject><issn>0020-0190</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNqVi70OgjAURjtoIv48gNsdXaj3tghhVNH4AO6kaFVIoeiF-PoyGHen75zkfEIsCSUhxetKlq2TCkkPLhGjkQgQFYZIKU7ElLlCxDjSSSBoC43vLPgGdlkG7csXztYM77J7gDN1cTWgfhDeTTsX45txbBffnYnV8XDen8Lh--wtd3ld8sU6Zxrre85powlVquJE_5F-AMUGOpY</recordid><startdate>20140201</startdate><enddate>20140201</enddate><creator>Liu, Mingjie</creator><creator>Wang, Xiaoyun</creator><creator>Xu, Guangwu</creator><creator>Zheng, Xuexin</creator><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140201</creationdate><title>A note on BDD problems with lambda 2 lambda 2-gap</title><author>Liu, Mingjie ; Wang, Xiaoyun ; Xu, Guangwu ; Zheng, Xuexin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_miscellaneous_15310292673</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Data processing</topic><topic>Decoding</topic><topic>Lattices</topic><topic>Mathematical analysis</topic><topic>Reduction</topic><topic>Vectors (mathematics)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liu, Mingjie</creatorcontrib><creatorcontrib>Wang, Xiaoyun</creatorcontrib><creatorcontrib>Xu, Guangwu</creatorcontrib><creatorcontrib>Zheng, Xuexin</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liu, Mingjie</au><au>Wang, Xiaoyun</au><au>Xu, Guangwu</au><au>Zheng, Xuexin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A note on BDD problems with lambda 2 lambda 2-gap</atitle><jtitle>Information processing letters</jtitle><date>2014-02-01</date><risdate>2014</risdate><volume>114</volume><issue>1-2</issue><spage>9</spage><epage>12</epage><pages>9-12</pages><issn>0020-0190</issn><abstract>In CRYPTO 2009, Lyubashevsky and Micciancio presented reductions BDD1/2 gamma BDD1/2 gamma (Bounded Distance Decoding Problem) [el] uSVP gamma uSVP gamma (Unique Shortest Vector Problem) [el] BDD1/ gamma BDD1/ gamma , and posed an open problem whether the reduction gap can be closed. This paper concerns bounded distance decoding (BDD) problems for lattices with large lambda 2 lambda 2-gap. In the presence of larger lambda 2 lambda 2-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.</abstract><doi>10.1016/j.ipl.2013.10.004</doi></addata></record>
fulltext fulltext
identifier ISSN: 0020-0190
ispartof Information processing letters, 2014-02, Vol.114 (1-2), p.9-12
issn 0020-0190
language eng
recordid cdi_proquest_miscellaneous_1531029267
source Access via ScienceDirect (Elsevier)
subjects Data processing
Decoding
Lattices
Mathematical analysis
Reduction
Vectors (mathematics)
title A note on BDD problems with lambda 2 lambda 2-gap
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-22T20%3A09%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20note%20on%20BDD%20problems%20with%20lambda%202%20lambda%202-gap&rft.jtitle=Information%20processing%20letters&rft.au=Liu,%20Mingjie&rft.date=2014-02-01&rft.volume=114&rft.issue=1-2&rft.spage=9&rft.epage=12&rft.pages=9-12&rft.issn=0020-0190&rft_id=info:doi/10.1016/j.ipl.2013.10.004&rft_dat=%3Cproquest%3E1531029267%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1531029267&rft_id=info:pmid/&rfr_iscdi=true