Výsledky vyhledávání - "Bounded Distance Decoding Problem"

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

Autoři: Li, Zhe Ling, San Xing, Chaoping a další

Přispěvatelé: Li, Zhe Ling, San Xing, Chaoping a další

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

Témata: 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]

Popis souboru: application/pdf

Přístupová URL adresa: 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

Autoři: Bai, Shi Stehlé, Damien Wen, Weiqiang a další

Přispěvatelé: Bai, Shi Stehlé, Damien Wen, Weiqiang a další

Témata: Bounded Distance Decoding Problem, Sparsification, Unique Shortest Vector Problem, Lattices, ddc:004, [INFO] Computer Science [cs]

Popis souboru: application/pdf

Přístupová URL adresa: 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

Accurate Score Prediction for Dual-Sieve Attacks.

Autoři: Ducas, Léo Pulles, Ludo N.

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

Improved analysis of the reduction from BDD to uSVP.

Autoři: Zhao, Chunhuan Zheng, Zhongxiang

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

Témata: LATTICE constants, MATHEMATICAL equivalence, EMBEDDINGS (Mathematics)

Using Variational Quantum Algorithm to Solve the LWE Problem.

Autoři: Lv, Lihui Yan, Bao Wang, Hong a další

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

Témata: PROBLEM solving, ALGORITHMS, APPROXIMATION algorithms, MATHEMATICAL optimization, DECODING algorithms, QUBITS

An Extended Survey Concerning the Vector Commitments.

Autoři: Nutu, Maria Akhalaia, Giorgi Bocu, Razvan a další

Zdroj: Applied Sciences (2076-3417); Sep2025, Vol. 15 Issue 17, p9510, 32p

Témata: CRYPTOGRAPHY, BLOCKCHAINS

Post-Quantum Homomorphic Encryption: A Case for Code-Based Alternatives.

Autoři: Bhoi, Siddhartha Siddhiprada Arakala, Arathi Corman, Amy Beth a další

Zdroj: Cryptography (2410-387X); Jun2025, Vol. 9 Issue 2, p31, 37p

Témata: CRYPTOGRAPHY, ERROR-correcting codes, ENCRYPTION protocols, HOMOMORPHISMS, RESEARCH methodology

随机数泄露位置与模数对 ECDSA 安全性的影响. (Chinese)

Alternate Title: Impact of Nonces Leakage Location and Modulus on ECDSA Security. (English)

Autoři: 周呈景 王 更 谷大武

Zdroj: Journal of Cryptologic Research (2097-4116); Apr2025, Vol. 12 Issue 2, p337-352, 16p

Témata: ELLIPTIC curves, RANDOM numbers, DIGITAL signatures, SAMPLE size (Statistics), LEAKAGE

格签名综述. (Chinese)

Alternate Title: Survey for Lattice-Based Signature. (English)

Autoři: 夏雯雯 谷大武 王 更

Zdroj: Journal of Cryptologic Research (2097-4116); Apr2025, Vol. 12 Issue 2, p265-282, 18p

Témata: DIGITAL signatures, PROBLEM solving, CIPHERS, PROSPECTING

On Bounded Distance Decoding for General Lattices.

Autoři: Díaz, Josep Jansen, Klaus Rolim, José D. P. a další

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

On the List and Bounded Distance Decodability of ReedSolomon Codes

Autoři: Cheng, Qi Wan, Daqing

Zdroj: SIAM Journal on Computing. 37(1)

Témata: 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

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/8wc6425s
https://escholarship.org/content/qt8wc6425s/qt8wc6425s.pdf

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

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

Témata: LATTICE theory, NUMERICAL calculations, CRYPTOGRAPHY, MATHEMATICS, RADIUS (Geometry), ABSTRACT algebra, PHONOLOGICAL decoding, CONVEX bodies

People: AJTAI, Miklos

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

Autoři: Micciancio, Daniele

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

Témata: INTEGER programming, LATTICE theory, MATHEMATICAL programming, MATHEMATICAL crystallography, FUNCTIONAL equations, NONLINEAR programming

Syndrome decoding by quantum approximate optimization.

Autoři: Lai, Ching-Yi Kuo, Kao-Yueh Liao, Bo-Jyun

Zdroj: Quantum Information Processing; Nov2024, Vol. 23 Issue 11, p1-33, 33p

Témata: OPTIMIZATION algorithms, PARITY-check matrix, HAMMING codes, COMBINATORIAL optimization, QUBITS

Mind the Gap? Not for SVP Hardness under ETH!

Autoři: Aggarwal, Divesh Gupta, Rishav Morolia, Aditya

Témata: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Cryptography and Security, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Computational Complexity (cs.CC), Cryptography and Security (cs.CR)

Přístupová URL adresa: http://arxiv.org/abs/2504.02695

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

Autoři: GANDIKOTA, VENKATA GHAZI, BADIH GRIGORESCU, ELENA

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

Témata: *APPROXIMATION theory, *NUMERICAL analysis, *INFORMATION theory, *MATHEMATICAL models, *MATHEMATICAL analysis

Learning with Errors: A Lattice-Based Keystone of Post-Quantum Cryptography.

Autoři: Sabani, Maria E. Savvas, Ilias K. Garani, Georgia

Zdroj: Signals; Jun2024, Vol. 5 Issue 2, p216-243, 28p

Computationally Secure Semi‐Quantum All‐Or‐Nothing Oblivious Transfer from Dihedral Coset States.

Autoři: Yan, Xingyu Wang, Licheng Gu, Lize

Zdroj: Advanced Quantum Technologies; May2024, Vol. 7 Issue 5, p1-14, 14p

Témata: QUANTUM cryptography, POLYNOMIAL time algorithms, INFORMATION-theoretic security, HARDNESS

A new IND-CCA2 NTRU-like Cryptosystem for post-quantum cryptography with security proof in the standard model

Autoři: Sow, Djiby 35090

Témata: VoR

URL: http://hdl.handle.net/10061/11724
https://naist.repo.nii.ac.jp/records/9066

Overfull: Too Large Aggregate Signatures Based on Lattices.

Autoři: Boudgoust, Katharina Roux-Langlois, Adeline

Zdroj: Computer Journal; Feb2024, Vol. 67 Issue 2, p719-727, 9p

Témata: RESEARCH questions, CRYPTOGRAPHY, TECHNICAL institutes, HARDNESS, STANDARDIZATION