Search Results - Bounded Distance Decoding Problem*

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding

Authors: Divesh Aggarwal Yanlin Chen Rajendra Kumar et al.

Source: SIAM Journal on Computing. 54:233-278

Subject Terms: FOS: Computer and information sciences, Data Structures and Algorithms, Cryptography and Security, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Cryptography and Security (cs.CR)

Access URL: http://arxiv.org/abs/2002.07955

Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding

Authors: Aggarwal, D. (Divesh) Chen, Y. (Yanlin) Kumar, R. (Rajendra) et al.

Source: SIAM Journal on Computing vol. 54 no. 2, pp. 233-278

Index Terms: Lattices, Shortest vector problem, Discrete Gaussian sampling, Time-space tradeoff, Quantum computation, Bounded distance decoding, info:eu-repo/semantics/article

URL: https://ir.cwi.nl/pub/35122

improved provable algorithms for the shortest vector problem via bounded distance decoding

Authors: Rajendra Kumar Yixin Shen Divesh Aggarwal et al.

Contributors: Rajendra Kumar Yixin Shen Divesh Aggarwal et al.

Subject Terms: Shortest Vector Problem, Quantum computation, Lattices, Bounded distance decoding, [INFO] Computer Science [cs], ddc:004, Time-Space Tradeoff, Discrete Gaussian Sampling

File Description: application/pdf

Access URL: https://dblp.uni-trier.de/db/journals/corr/corr2002.html#abs-2002-07955
https://drops.dagstuhl.de/opus/volltexte/2021/13649/pdf/LIPIcs-STACS-2021-4.pdf/
https://hal.archives-ouvertes.fr/hal-03363367/document
https://drops.dagstuhl.de/opus/volltexte/2021/13649/
https://arxiv.org/pdf/2002.07955
https://hal.archives-ouvertes.fr/hal-03363367
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.4

On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications

Authors: Li, Zhe Ling, San Xing, Chaoping et al.

Contributors: Li, Zhe Ling, San Xing, Chaoping et al.

Source: IEEE Transactions on Information Theory. 66:2588-2598

Subject Terms: Trapdoor Function, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Closest Vector Problem, 01 natural sciences, Mathematics::Discrete mathematics::Cryptography [Science]

File Description: application/pdf

Access URL: https://dr.ntu.edu.sg/bitstream/10356/138650/2/polylattice.pdf
https://dr.ntu.edu.sg/bitstream/10356/138650/2/polylattice.pdf
https://ieeexplore.ieee.org/document/8961986
https://dblp.uni-trier.de/db/journals/tit/tit66.html#LiLXY20
https://dr.ntu.edu.sg/handle/10356/138650
https://hdl.handle.net/10356/138650

On Bounded Distance Decoding with Predicate: Breaking the 'Lattice Barrier' for the Hidden Number Problem

Authors: Albrecht, Martin R. Heninger, Nadia

Source: Lecture Notes in Computer Science ISBN: 9783030778699
Advances in Cryptology – EUROCRYPT 2021-40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, October 17–21, 2021, Proceedings, Part I
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2021

Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding

Authors: Divesh Aggarwal and Yanlin Chen and Rajendra Kumar and Yixin Shen Aggarwal, Divesh Chen, Yanlin et al.

Index Terms: Lattices, Shortest Vector Problem, Discrete Gaussian Sampling, Time-Space Tradeoff, Quantum computation, Bounded distance decoding, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.4
Is Part Of LIPIcs, Volume 187, 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)

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

Authors: Bai, Shi Stehlé, Damien Wen, Weiqiang et al.

Contributors: Bai, Shi Stehlé, Damien Wen, Weiqiang et al.

Subject Terms: Bounded Distance Decoding Problem, Sparsification, Unique Shortest Vector Problem, Lattices, ddc:004, [INFO] Computer Science [cs]

File Description: application/pdf

Access URL: https://inria.hal.science/hal-01394213v1
https://doi.org/10.4230/lipics.icalp.2016.76
https://dblp.uni-trier.de/db/conf/icalp/icalp2016.html#BaiSW16
https://drops.dagstuhl.de/opus/volltexte/2016/6208/
https://drops.dagstuhl.de/opus/volltexte/2016/6208/pdf/LIPIcs-ICALP-2016-76.pdf/
https://hal.inria.fr/hal-01394213
https://doi.org/10.4230/LIPIcs.ICALP.2016.76
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.76

Bounded Distance Decoding for Random Lattices

Authors: Gao, Shuhong

Subject Terms: FOS: Computer and information sciences, 68Q25 (primary), 11H06 (secondary), Computational Complexity, Computational Complexity (cs.CC), F.2.2

Access URL: http://arxiv.org/abs/2506.16662

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding

Authors: Aggarwal, Divesh Chen, Yanlin Kumar, Rajendra et al.

Index Terms: Computer Science - Data Structures and Algorithms, Computer Science - Cryptography and Security, text

URL: http://arxiv.org/abs/2002.07955

IMPROVED CLASSICAL AND QUANTUM ALGORITHMS FOR THE SHORTEST VECTOR PROBLEM VIA BOUNDED DISTANCE DECODING.

Authors: AGGARWAL, DIVESH YANLIN CHEN KUMARS, RAJENDRA et al.

Source: SIAM Journal on Computing; 2025, Vol. 54 Issue 2, p233-278, 46p

Subject Terms: TIME complexity, RANDOM access memory, QUANTUM computing, ISOMORPHISM (Mathematics), ALGORITHMS

On the List and Bounded Distance Decodability of ReedSolomon Codes

Authors: Cheng, Qi Wan, Daqing

Source: SIAM Journal on Computing. 37(1)

Subject Terms: list decoding algorithm, bounded distance decoding algorithm, Reed-Solomon codes, discrete logarithm problem, math.NT, cs.IT, math.IT, 11Y16, 68Q25, Pure Mathematics, Computation Theory and Mathematics, Computation Theory & Mathematics

File Description: application/pdf

Access URL: https://escholarship.org/uc/item/8wc6425s
https://escholarship.org/content/qt8wc6425s/qt8wc6425s.pdf

Improved lower bound for the complexity of unique shortest vector problem

Authors: Baolong Jin Rui Xue

Source: Cybersecurity, Vol 6, Iss 1, Pp 1-9 (2023)

Subject Terms: Computational complexity, Unique shortest vector problem, Bounded distance decoding, Complexity reduction, Computer engineering. Computer hardware, TK7885-7895, Electronic computers. Computer science, QA75.5-76.95

File Description: electronic resource

Relation: https://doaj.org/toc/2523-3246

Access URL: https://doaj.org/article/c09b809ccade432d9a8c22c656beb4e3

On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem

Authors: Daniele Micciancio Vadim Lyubashevsky

Source: Lecture Notes in Computer Science ISBN: 9783642033551
CRYPTO

Access URL: https://link.springer.com/content/pdf/10.1007%2F978-3-642-03356-8_34.pdf

Hardness of Bounded Distance Decoding on Lattices in $\ell_p$ Norms

Authors: Bennett, Huck Peikert, Chris Huck Bennett and Chris Peikert

Contributors: Bennett, Huck Peikert, Chris Huck Bennett and Chris Peikert

Subject Terms: FOS: Computer and information sciences, Lattices, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Fine-Grained Complexity, Bounded Distance Decoding, Computer Science - Data Structures and Algorithms, NP-hardness, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2003.07903
https://drops.dagstuhl.de/opus/volltexte/2020/12588/
http://ui.adsabs.harvard.edu/abs/2020arXiv200307903B/abstract
http://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07903
https://arxiv.org/abs/2003.07903
https://doi.org/10.4230/LIPIcs.CCC.2020.36
https://dblp.uni-trier.de/db/journals/corr/corr2003.html#abs-2003-07903
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.36

Improving BDD Enumeration for LWE Problem Using GPU

Authors: Mohamed S. Esseissah Ashraf Bhery Hatem M. Bahig

Source: IEEE Access, Vol 8, Pp 19737-19749 (2020)

Subject Terms: Parallel computing, closest vector problem, General-purpose computing on graphics processing units, Enumeration, Combinatorial Optimization and Complexity Theory, CUDA, 0102 computer and information sciences, 01 natural sciences, Database, Artificial Intelligence, LLL algorithm, FOS: Mathematics, Linear Programming, Factor (programming language), Cryptography and Error-Correcting Codes, bounded distance decoding, Advanced Cryptographic Schemes and Protocols, Computer graphics (images), Scalability, lattice-based cryptography, Discrete mathematics, Computer science, shortest vector problem, TK1-9971, Programming language, Learning with error, Computational Theory and Mathematics, Computer Science, Physical Sciences, Graphics, Electrical engineering. Electronics. Nuclear engineering, Mathematics

Access URL: https://ieeexplore.ieee.org/ielx7/6287639/8948470/08937542.pdf
https://doaj.org/article/2db4648b4da8450498db369e00274f6d
https://ieeexplore.ieee.org/document/8937542
https://dblp.uni-trier.de/db/journals/access/access8.html#EsseissahBB20

On the complexity of bounded distance decoding for the AWGN channel

Authors: John B. Anderson

Source: IEEE Transactions on Information Theory. 48:1046-1060

Subject Terms: Decoding, Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Convolutional codes, 0102 computer and information sciences, 02 engineering and technology, Channel models (including quantum) in information and communication theory, 01 natural sciences

File Description: application/xml

Access URL: https://lup.lub.lu.se/record/340322
https://dblp.uni-trier.de/db/journals/tit/tit48.html#Anderson02
https://ieeexplore.ieee.org/document/995541/
https://www.lunduniversity.lu.se/lup/publication/e236ce25-7e78-4f7b-8bd7-bb787dc5bd4b

Hardness of Bounded Distance Decoding on Lattices in ?_p Norms

Authors: Bennett, Huck Peikert, Chris

Index Terms: Lattices, Bounded Distance Decoding, NP-hardness, Fine-Grained Complexity, Data processing Computer science, InProceedings, publishedVersion

On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract)

Authors: Cheng, Qi Wan, Daqing

Source: SIAM Journal on Computing, vol 37, iss 1

Subject Terms: discrete logarithm problem, Reed-Solomon codes, 68Q25, Computation Theory and Mathematics, 0102 computer and information sciences, 02 engineering and technology, 11Y16, Pure Mathematics, 01 natural sciences, bounded distance decoding algorithm, Computation Theory & Mathematics, math.NT, cs.IT, 0202 electrical engineering, electronic engineering, information engineering, math.IT, list decoding algorithm

File Description: application/pdf

Access URL: http://cr.yp.to/bib/2004/cheng-codes.pdf
https://epubs.siam.org/doi/10.1137/S0097539705447335
https://escholarship.org/uc/item/8wc6425s.pdf
https://doi.org/10.1137/S0097539705447335
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp37.html#ChengW07
https://locus.siam.org/doi/abs/10.1137/S0097539705447335
https://escholarship.org/uc/item/8wc6425s
http://www.math.uci.edu/~dwan/code.pdf
https://www.math.uci.edu/~dwan/listcode.pdf
https://ieeexplore.ieee.org/document/1366253/
https://www.cs.ou.edu/~qcheng/paper/ld.pdf
http://ieeexplore.ieee.org/document/1366253/
https://dblp.uni-trier.de/db/conf/focs/focs2004.html#ChengW04
https://escholarship.org/uc/item/8wc6425s

Hardness of Bounded Distance Decoding on Lattices in 𝓁_p Norms

Authors: Bennett, Huck Peikert, Chris Huck Bennett and Chris Peikert

Contributors: Bennett, Huck Peikert, Chris Huck Bennett and Chris Peikert

Subject Terms: Lattices, Bounded Distance Decoding, NP-hardness, Fine-Grained Complexity

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 169, 35th Computational Complexity Conference (CCC 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.36

Availability: https://doi.org/10.4230/LIPIcs.CCC.2020.36
https://nbn-resolving.org/urn:nbn:de:0030-drops-125881
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.36

Exploring Trade-offs in Batch Bounded Distance Decoding

Authors: Albrecht, Martin R. Curtis, Benjamin R. Wunderer, Thomas

Source: Lecture Notes in Computer Science ISBN: 9783030384708
Selected Areas in Cryptography – SAC 2019-26th International Conference, Waterloo, ON, Canada, August 12–16, 2019, Revised Selected Papers
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Selected Areas in Cryptography – SAC 2019

Access URL: https://link.springer.com/chapter/10.1007/978-3-030-38471-5_19
https://eprint.iacr.org/2019/1122
https://dblp.uni-trier.de/db/journals/iacr/iacr2019.html#MassartS19
https://rd.springer.com/chapter/10.1007/978-3-030-38471-5_19
http://dblp.uni-trier.de/db/conf/sacrypt/sacrypt2019.html#AlbrechtCW19