Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
From MaRDI portal
Publication:5087252
Recommendations
- Ternary Syndrome Decoding with large weight
- Improved information set decoding for code-based cryptosystems with constrained memory
- Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
- An algorithm for generalized syndrome decoding problem
- Smaller decoding exponents: ball-collision decoding
Cites work
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- An algorithmic framework for the generalized birthday problem
- Dissection-BKW
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- Information-set decoding for linear codes over \(\mathbb F_q\)
- New generic algorithms for hard knapsacks
- Ternary Syndrome Decoding with large weight
- The complexity of information set decoding
- The extended \(k\)-tree algorithm
- Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
Cited in
(5)
This page was built for publication: Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087252)