Decoding random linear codes in O(2⁰.054n)
From MaRDI portal
Publication:3102180
Recommendations
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Smaller decoding exponents: ball-collision decoding
- Decoding one out of many
- On computing nearest neighbors with applications to decoding of binary linear codes
- Decoding linear codes with high error rate and its impact for LPN security
Cited in
(only showing first 100 items - show all)- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
- Decoding linear codes with high error rate and its impact for LPN security
- 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
- Structural cryptanalysis of McEliece schemes with compact keys
- 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
- Enhanced public key security for the McEliece cryptosystem
- On solving LPN using BKW and variants, Implementation and analysis
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- A sieve algorithm based on overlattices
- Cryptography from learning parity with noise
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- On computing nearest neighbors with applications to decoding of binary linear codes
- Optimization of \(\mathsf {LPN}\) solving algorithms
- Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension
- Decoding one out of many
- 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
- Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications
- Syndrome Decoding Estimator
- On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes
- Smaller decoding exponents: ball-collision decoding
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
- Generalization of the ball-collision algorithm
- TinyKeys: a new approach to efficient multi-party computation
- 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
- Interleaved Prange: a new generic decoder for interleaved codes
- 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
- Wave Parameter Selection
- Low memory attacks on small key CSIDH
- Memory-efficient quantum information set decoding algorithm
- High weight code-based signature scheme from QC-LDPC codes
- \textsf{FuLeeca}: a Lee-based signature scheme
- \textsf{PALOMA}: binary separable Goppa-based \textsf{KEM}
- A fault attack on the Niederreiter cryptosystem using binary irreducible Goppa codes
- An iterative correction method for practically LPN solving
- Rigorous foundations for dual attacks in coding theory
- Pseudorandomness of decoding, revisited: adapting OHCP to code-based cryptography
- Revisiting nearest-neighbor-based information set decoding
- A new approach based on quadratic forms to attack the McEliece cryptosystem
- Memory-efficient attacks on small LWE keys
- Concrete time/memory trade-offs in generalised Stern's ISD algorithm
- The hardness of LPN over any integer ring and field for PCG applications
- Asymptotics and improvements of sieving for codes
- Reduction from sparse LPN to LPN, dual attack 3.0
- Integer syndrome decoding in the presence of noise
- CryptAttackTester: high-assurance attack analysis
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- The quantum decoding problem
- Stationary syndrome decoding for improved PCGs
- Increasing index sizes for information set decoding algorithms
- Complexity estimation of decoding problem and finding of low-weight codewords using basis reduction
- Information-set decoding for convolutional codes
- How to lose some weight: a practical template syndrome decoding attack
- Quantum sieving for code-based cryptanalysis and its limitations for ISD
- Reducing the number of qubits in quantum information set decoding
- The code equivalence problem and its applications to cryptography
- An improved both-may information set decoding algorithm: towards more efficient time-memory trade-offs
- Quadratic modelings of syndrome decoding
- A new path to code-based signatures via identification schemes with restricted errors
- On the matrix code of quadratic relationships for a Goppa code
- A hybrid algorithm for the regular syndrome decoding problem
- Pseudorandom correlation generators for multiparty Beaver triples over \(\mathbb{F}_2\)
- Slightly sublinear trapdoor hash functions and PIR from low-noise LPN
This page was built for publication: Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102180)
