Smaller Decoding Exponents: Ball-Collision Decoding
From MaRDI portal
Publication:5199223
DOI10.1007/978-3-642-22792-9_42zbMath1287.94053OpenAlexW1565337244MaRDI QIDQ5199223
Christiane Peters, Tanja Lange, Daniel J. Bernstein
Publication date: 12 August 2011
Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_42
attacksMcEliece cryptosystemNiederreiter cryptosystempost-quantum cryptographyinformation set decodingcollision decoding
Related Items (42)
Structural cryptanalysis of McEliece schemes with compact keys ⋮ Construction of binary Hadamard codes and their \(s\)-PD sets ⋮ Enhanced public key security for the McEliece cryptosystem ⋮ On solving LPN using BKW and variants, Implementation and analysis ⋮ Information set decoding in the Lee metric with applications to cryptography ⋮ 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 ⋮ Generalization of the Ball-Collision Algorithm ⋮ Information-set decoding with hints ⋮ Syndrome Decoding Estimator ⋮ Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x\) and some cryptographic applications] ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions ⋮ On the hardness of the Lee syndrome decoding problem ⋮ Solving the learning parity with noise problem using quantum algorithms ⋮ 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 ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ Statistical decoding 2.0: reducing decoding to LPN ⋮ 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 ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Strongly secure authenticated key exchange from factoring, codes, and lattices ⋮ CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN ⋮ 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$$ ⋮ Encryption scheme based on expanded Reed-Solomon codes ⋮ An improved algorithm for learning sparse parities in the presence of noise ⋮ Decoding One Out of Many ⋮ An Efficient Attack on All Concrete KKS Proposals ⋮ Monoidic Codes in Cryptography ⋮ Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN ⋮ Unnamed Item ⋮ Cryptanalysis of LEDAcrypt ⋮ A new post-quantum multivariate polynomial public key encapsulation algorithm ⋮ On the design and security of Lee metric McEliece cryptosystems ⋮ Cryptanalysis of the binary permuted kernel problem
This page was built for publication: Smaller Decoding Exponents: Ball-Collision Decoding
