Concrete time/memory trade-offs in generalised Stern's ISD algorithm
From MaRDI portal
Recommendations
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- Analysis of information set decoding for a sub-linear error weight
- Improved information set decoding for code-based cryptosystems with constrained memory
- Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
- Some cryptanalytic and coding-theoretic applications of a soft Stern algorithm
Cites work
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Analysis of information set decoding for a sub-linear error weight
- Attacking and Defending the McEliece Cryptosystem
- Decoding linear codes with high error rate and its impact for LPN security
- Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
- Decoding random linear codes in \(\tilde{\mathcal{O}}(2^{0.054n})\)
- scientific article; zbMATH DE number 4070796 (Why is no real title available?)
- scientific article; zbMATH DE number 4112524 (Why is no real title available?)
- McEliece needs a break -- solving McEliece-1284 and quasi-cyclic-2918 with modern ISD
- New time-memory trade-offs for subset sum -- improving ISD in theory and practice
- On computing nearest neighbors with applications to decoding of binary linear codes
- Probability and Computing
- Security bounds for the design of code-based cryptosystems
- Smaller decoding exponents: ball-collision decoding
- Syndrome Decoding Estimator
Cited in
(2)
This page was built for publication: Concrete time/memory trade-offs in generalised Stern's ISD algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623311)
