Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
From MaRDI portal
Publication:3102180
DOI10.1007/978-3-642-25385-0_6zbMath1227.94055MaRDI QIDQ3102180
Alexander May, Enrico Thomae, Alexander Meurer
Publication date: 2 December 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_6
Related Items
Syndrome Decoding Estimator, TinyKeys: a new approach to efficient multi-party computation, Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$, Generalization of the Ball-Collision Algorithm, Pseudorandom correlation functions from variable-density LPN, revisited, 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, The return of the SDitH, Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece}, On the hardness of the Lee syndrome decoding problem, S-semantics -- an example, Solving the learning parity with noise problem using quantum algorithms, Syndrome decoding in the head: shorter signatures from zero-knowledge proofs, Assessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC Codes, Hybrid decoding -- classical-quantum trade-offs for information set decoding, A study of error floor behavior in QC-MDPC codes, An algorithm for generalized syndrome decoding problem, 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, Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks, Correlated pseudorandomness from expand-accumulate codes, Information set decoding for Lee-metric codes using restricted balls, 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, Structural cryptanalysis of McEliece schemes with compact keys, Enhanced public key security for the McEliece cryptosystem, On solving LPN using BKW and variants, Implementation and analysis, Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension, Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications], Information set decoding in the Lee metric with applications to cryptography, Two attacks on rank metric code-based schemes: RankSign and an IBE scheme, 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, Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric, Lower bounds on lattice sieving and information set decoding, Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN, Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes, Structural properties of self-dual monomial codes with application to code-based cryptography, Information-set decoding with hints, McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD, A code-based signature scheme from the Lyubashevsky framework, Reproducible families of codes and cryptographic applications, Computational aspects of retrieving a representation of an algebraic geometry code, 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, 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, Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature, Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN, A sieve algorithm based on overlattices, Cryptography from Learning Parity with Noise, Optimization of $$\mathsf {LPN}$$ Solving Algorithms, Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes, Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory
