Suchergebnisse - bounded distance decoding (problem OR (problems OR problems))*

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

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

Weitere Verfasser: Li, Zhe Ling, San Xing, Chaoping et al.

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

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

Dateibeschreibung: application/pdf

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

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

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

Schlagwörter: Bounded Distance Decoding Problem, Sparsification, Unique Shortest Vector Problem, Lattices, ddc:004, [INFO] Computer Science [cs]

Dateibeschreibung: application/pdf

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

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

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

Autoren: Cheng, Qi Wan, Daqing

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

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

Dateibeschreibung: application/pdf

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

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

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

On Bounded Distance Decoding for General Lattices.

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

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

Exploring Trade-offs in Batch Bounded Distance Decoding

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

Quelle: 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

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

Lattice Problems: New Lower and Upper Bounds

Autoren: Tang, Yi

Schlagwörter: Computational Complexity, Engineering, Fine-grained Complexity, Lattice Problems, Parallel Algorithms, Computer Science, NP-hardness, Post-quantum Cryptography

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

Autoren: Zhu, Guoqiang Liu, Jianfeng Gong, Wenyin

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

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)

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

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

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

A note on BDD problems with λ2-gap

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

Weitere Verfasser: Liu, Mingjie Wang, Xiaoyun Xu, Guangwu et al.

Quelle: Information Processing Letters. 114:9-12

Schlagwörter: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 13. Climate action, Successive minima, Lattice, Cryptography, uSVP, 0102 computer and information sciences, 0101 mathematics, BDD, 01 natural sciences, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]

Zugangs-URL: https://inria.hal.science/hal-00922234v1
https://doi.org/10.1016/j.ipl.2013.10.004
https://hal.inria.fr/hal-00922234
https://dblp.uni-trier.de/db/journals/ipl/ipl114.html#LiuWXZ14
https://www.sciencedirect.com/science/article/abs/pii/S0020019013002615

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

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

Schlagwörter: LATTICE theory, NUMERICAL calculations, CRYPTOGRAPHY, MATHEMATICS, RADIUS (Geometry), ABSTRACT algebra, PHONOLOGICAL decoding, CONVEX bodies

People: AJTAI, Miklos

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

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

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

Engineering Problems - Uncertainties, Constraints and Optimization Techniques

Autoren: Marcos S.G. Tsuzuki Rogerio Yugo Takimoto Andre Kubagawa Sato et al.

Resource Type: eBook.

Schlagworte: Engineering mathematics, Mathematical optimization

Categories: TECHNOLOGY & ENGINEERING / Industrial Design / General

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

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

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

Schlagwörter: HYDRAULIC conductivity, GROUNDWATER remediation, PARAMETER identification, DEEP learning, INVERSE problems, AQUIFERS

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

Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor: Almost perfect lattices, the covering radius problem, and applications to Ajtai's connection factor

Autoren: Daniele Micciancio

Quelle: SIAM Journal on Computing. 34:118-169

Schlagwörter: average-case complexity, cryptography, Data encryption (aspects in computer science), covering radius, Analysis of algorithms and problem complexity, hash functions, almost perfect lattices, Combinatorics in computer science, 0102 computer and information sciences, Relations with coding theory, Lattices and convex bodies in \(n\) dimensions (aspects of discrete geometry), closest vector problem with preprocessing, 01 natural sciences, shortest vector problem, point lattices, Packing and covering in \(n\) dimensions (aspects of discrete geometry), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Number-theoretic algorithms, complexity

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2135830
https://doi.org/10.1137/s0097539703433511