Time-memory tradeoffs for large-weight syndrome decoding in ternary codes
From MaRDI portal
Publication:5087252
DOI10.1007/978-3-030-97121-2_4zbMATH Open1492.94127OpenAlexW4214557004MaRDI QIDQ5087252FDOQ5087252
Authors: Pierre Karpman, Charlotte Lefevre 
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_4
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
- Information-set decoding for linear codes over \(\mathbb F_q\)
- Title not available (Why is that?)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- The extended \(k\)-tree algorithm
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- New generic algorithms for hard knapsacks
- Ternary Syndrome Decoding with large weight
- Dissection-BKW
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- The complexity of information set decoding
- An algorithmic framework for the generalized birthday problem
- Time-memory tradeoffs for large-weight syndrome decoding in ternary 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)
