Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
From MaRDI portal
Publication:2894429
DOI10.1007/978-3-642-29011-4_31zbMath1291.94206OpenAlexW72398006MaRDI QIDQ2894429
Antoine Joux, Anja Becker, Alexander Meurer, Alexander May
Publication date: 29 June 2012
Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_31
Related Items
Structural cryptanalysis of McEliece schemes with compact keys, Enhanced public key security for the McEliece cryptosystem, Information set decoding in the Lee metric with applications to cryptography, About Low DFR for QC-MDPC Decoding, How to meet ternary LWE keys, 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, Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory, Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension, 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, A rank metric code-based group signature scheme, Information-set decoding with hints, Performance bounds for QC-MDPC codes decoders, McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD, Syndrome Decoding Estimator, Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications], Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems, 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, Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece}, On the hardness of the Lee syndrome decoding problem, Solving the learning parity with noise problem using quantum algorithms, Finding low-weight polynomial multiples using the rho method, Assessing and Countering Reaction Attacks Against Post-Quantum Public-Key Cryptosystems Based on QC-LDPC Codes, A code-based signature scheme from the Lyubashevsky framework, 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, Polynomial-time plaintext recovery attacks on the IKKR code-based cryptosystems, Breaking Goppa-based McEliece with hints, A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors, Improved information set decoding algorithms over Galois ring in the Lee metric, Decoding McEliece with a hint -- secret Goppa key parts reveal everything, Non-interactive secure computation of inner-product from LPN and LWE, Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks, Correlated pseudorandomness from expand-accumulate codes, On new problems in asymmetric cryptography based on error-resistant coding, 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, A new decryption failure attack against HQC, 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, Code-based signatures from new proofs of knowledge for the syndrome decoding problem, Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature, Computational aspects of retrieving a representation of an algebraic geometry code, Code-Based Cryptosystems Using Generalized Concatenated Codes, CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN, Bounded Independence Plus Noise Fools Products, Reproducible families of codes and cryptographic applications, Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity, A code-based group signature scheme, An algorithmic framework for the generalized birthday problem, 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$$, A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions, Encryption scheme based on expanded Reed-Solomon codes, A modified Dual-Ouroboros public-key encryption using Gabidulin codes, An improved algorithm for learning sparse parities in the presence of noise, Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory, 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, Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN, Unnamed Item, Cryptanalysis of LEDAcrypt, On the design and security of Lee metric McEliece cryptosystems, A sieve algorithm based on overlattices, Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
