Weak keys in QC-MDPC-based cryptosystems via the extended euclidean algorithm

DOI10.1007/S12095-026-00876-0MaRDI QIDQ7363954zbMATH OpenFDO

Authors Alessio Meneghetti, Federica Zanetti

Publication date 1 October 2026

Published in Cryptography and Communications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S12095-026-00876-0

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Analysis of algorithms (68W40) Cryptography (94A60) Other types of codes (94B60)

Cites work

• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• Breaking HWQCS: a code-based signature scheme from high weight QC-LDPC codes
• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 4070796 (Why is no real title available?)
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• scientific article; zbMATH DE number 3586931 (Why is no real title available?)
• scientific article; zbMATH DE number 3251924 (Why is no real title available?)
• Mathematical statistics. Basic ideas and selected topics. Volume I
• On computing nearest neighbors with applications to decoding of binary linear codes
• On the Combinatorics of Placing Balls into Ordered Bins
• QC-MDPC decoders with several shades of gray
• The Magma algebra system. I: The user language
• Weak keys for the quasi-cyclic MDPC public key encryption scheme

This page was built for publication: Weak keys in QC-MDPC-based cryptosystems via the extended euclidean algorithm

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