Some cryptanalytic and coding-theoretic applications of a soft Stern algorithm

DOI10.3934/AMC.2019035zbMATH Open1419.94037OpenAlexW2951314354WikidataQ127656976 ScholiaQ127656976MaRDI QIDQ2274236FDOQ2274236

Authors: Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner 

Publication date: 19 September 2019

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2019035

Recommendations

• The complexity of information set decoding
• On the complexity of some cryptographic problems based on the general decoding problem
• Information-set decoding for linear codes over \(\mathbb F_q\)
• Improvement of binary and non binary statistical decoding algorithm
• scientific article; zbMATH DE number 3963726

zbMATH Keywords

side-channel attackssoft decodinginformation set decodingsoft Stern algorithmStern algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (3)

• A new decryption failure attack against HQC
• Concrete time/memory trade-offs in generalised Stern's ISD algorithm
• Integer syndrome decoding in the presence of noise

This page was built for publication: Some cryptanalytic and coding-theoretic applications of a soft Stern algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274236)