Suchergebnisse - bounded distance decoding problems~

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

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

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

Schlagwörter: *TIME complexity, *RANDOM access memory, *QUANTUM computing, *ISOMORPHISM (Mathematics), *ALGORITHMS

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

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

Quelle: IEEE Transactions on Information Theory. Apr2020, Vol. 66 Issue 4, p2588-2598. 11p.

Schlagwörter: *DISTANCES, *POLYNOMIALS

On the List and Bounded Distance Decodability of ReedSolomon Codes

Autoren: Cheng, Qi Wan, Daqing

Quelle: SIAM Journal on Computing. 37(1)

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-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

Autoren: Baolong Jin Rui Xue

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

Schlagwörter: 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

Dateibeschreibung: electronic resource

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

Zugangs-URL: https://doaj.org/article/c09b809ccade432d9a8c22c656beb4e3

Improving BDD Enumeration for LWE Problem Using GPU

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

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

Schlagwörter: Learning with error, lattice-based cryptography, LLL algorithm, shortest vector problem, closest vector problem, bounded distance decoding, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

Dateibeschreibung: electronic resource

Relation: https://ieeexplore.ieee.org/document/8937542/; https://doaj.org/toc/2169-3536

Zugangs-URL: https://doaj.org/article/2db4648b4da8450498db369e00274f6d

Research on SCLOUD+ post-quantum key encapsulation adaptation and BW lattice optimization for intelligent computing networks

Autoren: PAN Jie XI Zhuoning ZHAO Zhanjun et al.

Quelle: Dianxin kexue, Vol 41, Pp 176-186 (2025)

Schlagwörter: intelligent computing network, Barnes-Wall lattice, bounded distance decoding, post-quantum cryptography, key encapsulation, Telecommunication, TK5101-6720, Technology

Dateibeschreibung: electronic resource

Relation: https://doaj.org/toc/1000-0801

Zugangs-URL: https://doaj.org/article/e66275d6c5524a6392d4c8ef4036501e

A Test Pattern Selection Method for a Joint Bounded-Distance and Encoding-Based Decoding Algorithm of Binary Codes.

Autoren: Tokushige, Hitoshi Fossorier, Marc P. C. Kasami, Tadao

Quelle: IEEE Transactions on Communications. Jun2010, Vol. 58 Issue 6, p1601-1604. 4p.

Schlagwörter: *LINEAR systems, *NUMERICAL solutions to boundary value problems, *MATHEMATICAL sequences, *ALGORITHMS, *SIMULATION methods & models

NP-HARDNESS OF REED-SOLOMON DECODING, AND THE PROUHET-TARRY-ESCOTT PROBLEM.

Autoren: GANDIKOTA, VENKATA GHAZI, BADIH GRIGORESCU, ELENA

Quelle: SIAM Journal on Computing. 2018, Vol. 47 Issue 4, p1547-1584. 38p.

Schlagwörter: *APPROXIMATION theory, *NUMERICAL analysis, *INFORMATION theory, *MATHEMATICAL models, *MATHEMATICAL analysis

Bounded distance decoding of linear error-correcting codes with Gröbner bases

Autoren: Bulygin, Stanislav Pellikaan, Ruud

Quelle: Journal of Symbolic Computation. Dec2009, Vol. 44 Issue 12, p1626-1643. 18p.

Schlagwörter: *CODING theory, *LINEAR statistical models, *ERROR analysis in mathematics, *GROBNER bases, *POLYNOMIALS, *MATHEMATICAL analysis

On the hardnesses of several quantum decoding problems.

Autoren: Kuo, Kao-Yueh Lu, Chung-Chin

Quelle: Quantum Information Processing. Apr2020, Vol. 19 Issue 4, p1-17. 17p.

Schlagwörter: *QUANTUM cryptography, *ERROR probability, *DECODING algorithms, *HARDNESS, *DEFINITIONS

On the Complexity of Bounded Distance Decoding for the AWGN Channel.

Autoren: Anderson, John B.

Quelle: IEEE Transactions on Information Theory. May2002, Vol. 48 Issue 5, p1046. 15p. 6 Diagrams, 2 Charts, 3 Graphs.

Schlagwörter: *DECODERS (Electronics), *ELECTRIC noise, *CODING theory, *ELECTRONICS

Improved analysis of the reduction from BDD to uSVP.

Autoren: Zhao, Chunhuan Zheng, Zhongxiang

Quelle: Information Processing Letters. Aug2019, Vol. 148, p28-32. 5p.

Schlagwörter: LATTICE constants, MATHEMATICAL equivalence, EMBEDDINGS (Mathematics)

On the List and Bounded Distance Decodibility of the Reed-Solomon Codes

Autoren: Cheng, Qi Wan, Daqing

Index Begriffe: Mathematics - Number Theory, Computer Science - Information Theory, 11Y16, 68Q25, text

URL: http://arxiv.org/abs/math/0405082

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

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

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

Index Begriffe: 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

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

Index Begriffe: 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)

Using Variational Quantum Algorithm to Solve the LWE Problem.

Autoren: Lv, Lihui Yan, Bao Wang, Hong et al.

Quelle: Entropy. Oct2022, Vol. 24 Issue 10, p1428-N.PAG. 16p.

Schlagwörter: *PROBLEM solving, *ALGORITHMS, *APPROXIMATION algorithms, *MATHEMATICAL optimization, *DECODING algorithms, *QUBITS

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

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

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

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

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

Autoren: Bai, Shi Wen, Weiqiang

Index Begriffe: Lattices, Bounded Distance Decoding Problem, Unique Shortest Vector Problem, Sparsification, Data processing Computer science, InProceedings, publishedVersion

Hardness of Bounded Distance Decoding on Lattices in ?_p Norms

Autoren: Bennett, Huck Peikert, Chris

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

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

Autoren: Bennett, Huck Peikert, Chris

Index Begriffe: Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, text

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