Ternary Syndrome Decoding with large weight
From MaRDI portal
Publication:778941
DOI10.1007/978-3-030-38471-5_18zbMath1453.94064arXiv1903.07464OpenAlexW3003672243MaRDI QIDQ778941
Rémi Bricout, Matthieu Lequesne, André Chailloux, Thomas Debris-Alazard
Publication date: 21 July 2020
Full work available at URL: https://arxiv.org/abs/1903.07464
Related Items (9)
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 ⋮ An algorithm for generalized syndrome decoding problem ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields ⋮ Information set decoding for Lee-metric codes using restricted balls ⋮ Improved classical and quantum algorithms for subset-sum ⋮ Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures ⋮ Classical and quantum algorithms for generic syndrome decoding problems and applications to the Lee metric
This page was built for publication: Ternary Syndrome Decoding with large weight
