On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
From MaRDI portal
Publication:2948329
DOI10.1007/978-3-662-46800-5_9zbMath1365.94597OpenAlexW566315627MaRDI QIDQ2948329
Publication date: 30 September 2015
Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46800-5_9
Related Items
Information set decoding in the Lee metric with applications to cryptography, How to meet ternary LWE keys, Lower bounds on lattice sieving and information set decoding, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Two attacks on rank metric code-based schemes: RankSign and an IBE scheme, Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory, Structural properties of self-dual monomial codes with application to code-based cryptography, How to find ternary LWE keys using locality sensitive hashing, A new approach for finding low-weight polynomial multiples, Generalization of the Ball-Collision Algorithm, McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD, Syndrome Decoding Estimator, Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes, Pseudorandom correlation functions from variable-density LPN, revisited, A new coding-based algorithm for finding closest pair of vectors, New time-memory trade-offs for subset sum -- improving ISD in theory and practice, A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions, Solving the learning parity with noise problem using quantum algorithms, Finding low-weight polynomial multiples using the rho method, Code-Based Signature Schemes from Identification Protocols in the Rank Metric, Hybrid decoding -- classical-quantum trade-offs for information set decoding, An algorithm for generalized syndrome decoding problem, Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems, Breaking Goppa-based McEliece with hints, Improved information set decoding algorithms over Galois ring in the Lee metric, Decoding McEliece with a hint -- secret Goppa key parts reveal everything, Correlated pseudorandomness from expand-accumulate codes, Statistical decoding 2.0: reducing decoding to LPN, Key-recovery by side-channel information on the matrix-vector product in code-based cryptosystems, Correlated pseudorandomness from the hardness of quasi-abelian decoding, Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation, Improved classical and quantum algorithms for subset-sum, Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time, On the dimension and structure of the square of the dual of a Goppa code, Inner-product functional encryption from random linear codes: trial and challenges, Identifying an unknown code by partial Gaussian elimination, Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes, Quantum Resistant Public Key Encryption Scheme polarRLCE, TinyKeys: a new approach to efficient multi-party computation, Improved Algorithms for the Approximate k-List Problem in Euclidean Norm, Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$, Encryption scheme based on expanded Reed-Solomon codes, Unnamed Item, Unnamed Item, Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures, Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem, Cryptanalysis of LEDAcrypt, On the design and security of Lee metric McEliece cryptosystems, Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
