Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes
From MaRDI portal
Publication:5087252
DOI10.1007/978-3-030-97121-2_4zbMath1492.94127MaRDI QIDQ5087252
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
Related Items
Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes, New time-memory trade-offs for subset sum -- improving ISD in theory and practice
Cites Work
- Unnamed Item
- The extended \(k\)-tree algorithm
- Ternary Syndrome Decoding with large weight
- Dissection-BKW
- An algorithmic framework for the generalized birthday problem
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- New Generic Algorithms for Hard Knapsacks
- Information-Set Decoding for Linear Codes over F q
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- The complexity of information set decoding
- Time-Memory Tradeoffs for Large-Weight Syndrome Decoding in Ternary Codes