Search Results - bounded distance decoding (problem OR problemys)

Search alternatives:

Refine Results
  1. 1

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

    ISSN: 0018-9448, 1557-9654
    Published: New York IEEE 01.04.2020
    Published in IEEE transactions on information theory (01.04.2020)
    “…In this paper, we propose new classes of trapdoor functions to solve the bounded distance decoding problem in lattices…”
    Get full text
    Journal Article
  2. 2

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

    ISSN: 1070-9908, 1558-2361
    Published: New York IEEE 2023
    Published in IEEE signal processing letters (2023)
    “… compromised. To solve the challenge, a new coded framework for BDQCD utilizing bounded distance decoding at the fusion center…”
    Get full text
    Journal Article
  3. 3

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

    ISSN: 0925-1022, 1573-7586
    Published: New York Springer US 15.08.2019
    Published in Designs, codes, and cryptography (15.08.2019)
    “…We propose a concrete family of dense lattices of arbitrary dimension n in which the lattice bounded distance decoding (BDD…”
    Get full text
    Journal Article
  4. 4

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

    ISSN: 0097-5397, 1095-7111
    Published: Philadelphia Society for Industrial and Applied Mathematics 01.01.2007
    Published in SIAM journal on computing (01.01.2007)
    “… 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…”
    Get full text
    Journal Article
  5. 5

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

    ISSN: 0747-7171, 1095-855X
    Published: Elsevier Ltd 01.12.2009
    Published in Journal of symbolic computation (01.12.2009)
    “…The problem of bounded distance decoding of arbitrary linear codes using Gröbner bases is addressed…”
    Get full text
    Journal Article
  6. 6

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

    ISSN: 0018-9448, 1557-9654
    Published: New York IEEE 01.01.2003
    Published in IEEE transactions on information theory (01.01.2003)
    “…We show that the minimum distance d of a linear code is not approximable to within any constant factor in random polynomial time (RP…”
    Get full text
    Journal Article
  7. 7

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

    ISSN: 0020-0190, 1872-6119
    Published: Elsevier B.V 01.08.2019
    Published in Information processing letters (01.08.2019)
    “…, the Bounded Distance Decoding (BDD) problem with parameter 1/(2γ) can be probabilistically reduced to the unique Shortest Vector Problem (uSVP) with parameter γ…”
    Get full text
    Journal Article
  8. 8

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

    ISSN: 2523-3246, 2523-3246
    Published: Singapore Springer Nature Singapore 01.12.2023
    Published in Cybersecurity (Singapore) (01.12.2023)
    “…Unique shortest vector problem (uSVP) plays an important role in lattice based cryptography…”
    Get full text
    Journal Article
  9. 9

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

    ISSN: 2169-3536, 2169-3536
    Published: Piscataway IEEE 2020
    Published in IEEE access (2020)
    “…) 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…”
    Get full text
    Journal Article
  10. 10

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

    ISSN: 0925-1022, 1573-7586
    Published: New York Springer US 01.01.2018
    Published in Designs, codes, and cryptography (01.01.2018)
    “…We provide for the first time an asymptotic comparison of all known algorithms for the search version of the Learning with Errors (LWE) problem…”
    Get full text
    Journal Article
  11. 11

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

    ISSN: 1556-6013, 1556-6021
    Published: New York, NY IEEE 01.12.2013
    “…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…”
    Get full text
    Journal Article
  12. 12

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

    ISSN: 0018-9448, 1557-9654
    Published: New York, NY IEEE 01.05.2013
    Published in IEEE transactions on information theory (01.05.2013)
    “… In this paper, the embedding technique is analyzed from a bounded distance decoding (BDD) viewpoint. We present two complementary analyses of the embedding technique…”
    Get full text
    Journal Article
  13. 13

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

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 10.05.2022
    Published in arXiv.org (10.05.2022)
    “…The most important computational problem on lattices is the Shortest Vector Problem (SVP…”
    Get full text
    Paper
  14. 14

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

    ISSN: 1016-3328, 1420-8954
    Published: Cham Springer International Publishing 01.06.2017
    Published in Computational complexity (01.06.2017)
    “…The question of list-decoding error-correcting codes over finite fields (under the Hamming metric…”
    Get full text
    Journal Article
  15. 15

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

    ISSN: 1570-0755, 1573-1332
    Published: New York Springer US 01.04.2020
    Published in Quantum information processing (01.04.2020)
    “…: quantum bounded distance decoding (QBDD), quantum maximum likelihood decoding (QMLD), and quantum minimum error probability decoding (QMEPD…”
    Get full text
    Journal Article
  16. 16

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

    ISSN: 1554-1045, 1554-1053
    Published: Hershey IGI Global 01.07.2015
    “…Fully homomorphic encryption schemes available are not efficient enough to be practical, and a number of real-world applications require only that a…”
    Get full text
    Journal Article
  17. 17

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

    ISSN: 0018-9448, 1557-9654
    Published: New York, NY IEEE 01.12.2006
    Published in IEEE transactions on information theory (01.12.2006)
    “… Several alternative decoding approaches are discussed. In particular, a provably bounded-distance decoder is presented…”
    Get full text
    Journal Article
  18. 18

    Weight Distribution and List-Decoding Size of Reed-Muller Codes by Kaufman, T., Lovett, S., Porat, E.

    ISSN: 0018-9448, 1557-9654
    Published: New York, NY IEEE 01.05.2012
    Published in IEEE transactions on information theory (01.05.2012)
    “…The weight distribution and list-decoding size of Reed-Muller codes are studied in this work…”
    Get full text
    Journal Article
  19. 19

    The List Decoding Radius for Reed-Muller Codes Over Small Fields by Bhowmick, Abhishek, Lovett, Shachar

    ISSN: 0018-9448, 1557-9654
    Published: New York IEEE 01.06.2018
    Published in IEEE transactions on information theory (01.06.2018)
    “…The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords…”
    Get full text
    Journal Article
  20. 20

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

    ISSN: 0018-9448, 1557-9654
    Published: New York, NY IEEE 01.10.2010
    Published in IEEE transactions on information theory (01.10.2010)
    “…It has been proved that the maximum likelihood decoding problem of Reed-Solomon codes is NP-hard…”
    Get full text
    Journal Article