Suchergebnisse - bounded distance decoding (problem OR problems)

On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications von Li, Zhe, Ling, San, Xing, Chaoping, Yeo, Sze Ling

“… In this paper, we propose new classes of trapdoor functions to solve the bounded distance decoding problem in lattices …”
Volltext

Byzantine Distributed Quickest Change Detection Based on Bounded-Distance-Decoding von Saputra, Bagus Aris, Lin, Shih-Chun

“… compromised. To solve the challenge, a new coded framework for BDQCD utilizing bounded distance decoding at the fusion center …”
Volltext

Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices von Ducas, Léo, Pierrot, Cécile

“… We propose a concrete family of dense lattices of arbitrary dimension n in which the lattice bounded distance decoding (BDD …”
Volltext

On the List and Bounded Distance Decodability of Reed–Solomon Codes von Cheng, Qi, Wan, Daqing

“… The bounded distance decoding problem is to find one codeword if there is at least one codeword within the given distance, or to output the empty set if there is …”
Volltext

Improved lower bound for the complexity of unique shortest vector problem von Jin, Baolong, Xue, Rui

“… Unique shortest vector problem (uSVP) plays an important role in lattice based cryptography …”
Volltext

Hardness of approximating the minimum distance of a linear code von Dumer, I., Micciancio, D., Sudan, M.

“… We show that the minimum distance d of a linear code is not approximable to within any constant factor in random polynomial time (RP …”
Volltext

Improved analysis of the reduction from BDD to uSVP von Zhao, Chunhuan, Zheng, Zhongxiang

“… , the Bounded Distance Decoding (BDD) problem with parameter 1/(2γ) can be probabilistically reduced to the unique Shortest Vector Problem (uSVP) with parameter γ …”
Volltext

Improving BDD Enumeration for LWE Problem Using GPU von Esseissah, Mohamed S., Bhery, Ashraf, Bahig, Hatem M.

“… ) problem using a lattice-based Bounded Distance Decoding (BDD) approach. To the best of our knowledge, this is the first GPU-based implementation for the LWE problem …”
Volltext

Bounded distance decoding of linear error-correcting codes with Gröbner bases von Bulygin, Stanislav, Pellikaan, Ruud

“… The problem of bounded distance decoding of arbitrary linear codes using Gröbner bases is addressed …”
Volltext

On the asymptotic complexity of solving LWE von Herold, Gottfried, Kirshanova, Elena, May, Alexander

“… We provide for the first time an asymptotic comparison of all known algorithms for the search version of the Learning with Errors (LWE) problem …”
Volltext

Fully Homomorphic Encryption Using Hidden Ideal Lattice von Plantard, Thomas, Susilo, Willy, Zhenfei Zhang

“… All the existing fully homomorphic encryption schemes are based on three different problems, namely the bounded distance decoding problem over ideal lattice, the approximate greatest common divisor …”
Volltext

Decoding by Embedding: Correct Decoding Radius and DMT Optimality von Luzzi, L., Stehle, D., Cong Ling

“… In this paper, the embedding technique is analyzed from a bounded distance decoding (BDD) viewpoint. We present two complementary analyses of the embedding technique …”
Volltext

On the hardnesses of several quantum decoding problems von Kuo, Kao-Yueh, Lu, Chung-Chin

“… : quantum bounded distance decoding (QBDD), quantum maximum likelihood decoding (QMLD), and quantum minimum error probability decoding (QMEPD …”
Volltext

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding von Aggarwal, Divesh, Chen, Yanlin, Kumar, Rajendra, Shen, Yixin

“… The most important computational problem on lattices is the Shortest Vector Problem (SVP …”
Volltext

List-Decoding Barnes–Wall Lattices von Grigorescu, Elena, Peikert, Chris

“… The question of list-decoding error-correcting codes over finite fields (under the Hamming metric …”
Volltext

An Additively Homomorphic Encryption over Large Message Space von Chen, Hu, Hu, Yupu, Lian, Zhizhu, Jia, Huiwen, Wang, Xu An

“… Fully homomorphic encryption schemes available are not efficient enough to be practical, and a number of real-world applications require only that a …”
Volltext

On the Closest Vector Problem with a Distance Guarantee von Dadush, Daniel, Regev, Oded, Stephens-Davidowitz, Noah

“… We present a new efficient algorithm for the search version of the approximate Closest Vector Problem with Preprocessing (CVPP …”
Volltext

Complexity of Decoding Positive-Rate Primitive Reed-Solomon Codes von Cheng, Qi, Wan, Daqing

“… It has been proved that the maximum likelihood decoding problem of Reed-Solomon codes is NP-hard …”
Volltext

NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem von Gandikota, Venkata, Ghazi, Badih, Grigorescu, Elena

“… Establishing the complexity of Bounded Distance Decoding for Reed-Solomon codes is a fundamental open problem in coding theory, explicitly asked by Guruswami and Vardy (IEEE Trans. Inf. Theory, 2005 …”
Volltext

Encoding and Decoding Binary Product Lattices von Salomon, A.J., Amrani, O.

“… Several alternative decoding approaches are discussed. In particular, a provably bounded-distance decoder is presented …”
Volltext