Search Results - bounded distance decoding (problem OR problems)

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

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

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

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

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

Authors: GANDIKOTA, VENKATA GHAZI, BADIH GRIGORESCU, ELENA

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

Subject Terms: *APPROXIMATION theory, *NUMERICAL analysis, *INFORMATION theory, *MATHEMATICAL models, *MATHEMATICAL analysis

Using Variational Quantum Algorithm to Solve the LWE Problem.

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

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

Subject Terms: PROBLEM solving, ALGORITHMS, APPROXIMATION algorithms, MATHEMATICAL optimization, DECODING algorithms, QUBITS

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

On Bounded Distance Decoding for General Lattices.

Authors: Díaz, Josep Jansen, Klaus Rolim, José D. P. et al.

Source: Approximation, Randomization & Combinatorial Optimization. Algorithms & Techniques (9783540380443); 2006, p450-461, 12p

Improved analysis of the reduction from BDD to uSVP.

Authors: Zhao, Chunhuan Zheng, Zhongxiang

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

Subject Terms: LATTICE constants, MATHEMATICAL equivalence, EMBEDDINGS (Mathematics)

On the NP-hardness of bounded distance decoding of Reed-Solomon codes

Authors: Badih Ghazi Venkata Gandikota Elena Grigorescu

Source: 2015 IEEE International Symposium on Information Theory (ISIT).

Subject Terms: 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, 3. Good health

Access URL: https://dblp.uni-trier.de/db/conf/isit/isit2015.html#GandikotaGG15
https://ieeexplore.ieee.org/document/7282988/
http://people.csail.mit.edu/badih/papers/RS-NPHard.pdf
https://www.cs.purdue.edu/homes/egrigore/papers/RS-NPHard-ISITs.pdf

On Bounded Distance Decoding for General Lattices

Authors: Vadim Lyubashevsky Daniele Micciancio Yi-Kai Liu

Source: Lecture Notes in Computer Science ISBN: 9783540380443

Two-stage memetic algorithm for green flexible job shop scheduling problem considering machine deterioration and maintenance.

Authors: Zhu, Guoqiang Liu, Jianfeng Gong, Wenyin

Source: Memetic Computing; Jun2025, Vol. 17 Issue 2, p1-33, 33p

ALMOST PERFECT LATTICES, THE COVERING RADIUS PROBLEM, AND APPLICATIONS TO AJTAI'S CONNECTION FACTOR.

Source: SIAM Journal on Computing; 2004, Vol. 34 Issue 1, p118-169, 52p

Subject Terms: LATTICE theory, NUMERICAL calculations, CRYPTOGRAPHY, MATHEMATICS, RADIUS (Geometry), ABSTRACT algebra, PHONOLOGICAL decoding, CONVEX bodies

People: AJTAI, Miklos

Lattice Problems: New Lower and Upper Bounds

Authors: Tang, Yi

Subject Terms: Computational Complexity, Engineering, Fine-grained Complexity, Lattice Problems, Parallel Algorithms, Computer Science, NP-hardness, Post-quantum Cryptography

Accurate Score Prediction for Dual-Sieve Attacks.

Authors: Ducas, Léo Pulles, Ludo N.

Source: Journal of Cryptology; Jan2026, Vol. 39 Issue 1, p1-51, 51p

A note on BDD problems with -gap.

Authors: Liu, Mingjie Wang, Xiaoyun Xu, Guangwu et al.

Source: Information Processing Letters. Jan2014, Vol. 114 Issue 1/2, p9-12. 4p.

Subject Terms: *PROBLEM solving, MATHEMATICAL bounds, DECODERS & decoding, LATTICE theory, COMPUTER science research, CODING theory

Deep Reinforcement Learning for the Capacitated Pickup and Delivery Problem with Time Windows.

Authors: Soroka, A. G. Meshcheryakov, A. V. Gerasimov, S. V.

Source: Pattern Recognition & Image Analysis; Jun2023, Vol. 33 Issue 2, p169-178, 10p

Gase: graph attention sampling with edges fusion for solving vehicle routing problems.

Authors: Wang, Zhenwei Bai, Ruibin Khan, Fazlullah et al.

Source: Memetic Computing; Sep2024, Vol. 16 Issue 3, p337-353, 17p

Integration of DDPM and ILUES for Simultaneous Identification of Contaminant Source Parameters and Non‐Gaussian Channelized Hydraulic Conductivity Field.

Authors: Zhang, Xun Jiang, Simin Zheng, Na et al.

Source: Water Resources Research; Sep2024, Vol. 60 Issue 9, p1-28, 28p

Subject Terms: HYDRAULIC conductivity, GROUNDWATER remediation, PARAMETER identification, DEEP learning, INVERSE problems, AQUIFERS

ALMOST PERFECT LATTICES, THE COVERING RADIUS PROBLEM, AND APPLICATIONS TO AJTAI'S CONNECTION FACTOR.

Authors: Micciancio, Daniele

Source: SIAM Journal on Computing; 2004, Vol. 33 Issue 6, p118-169, 52p

Subject Terms: INTEGER programming, LATTICE theory, MATHEMATICAL programming, MATHEMATICAL crystallography, FUNCTIONAL equations, NONLINEAR programming