A McEliece cryptosystem using permutation codes

DOI10.1515/JMC-2024-0029MaRDI QIDQ6876476zbMATH OpenFDO

Authors Adarsh Srinivasan, Ayan Mahalanobis

Publication date 13 January 2026

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/JMC-2024-0029

zbMATH Keywords

McEliece cryptosystempermutation error correcting codespostquantum cryptosystems

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60) Other types of codes (94B60)

Cites work

• Attacking and Defending the McEliece Cryptosystem
• Coding with permutations
• Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns
• Error-correcting codes from permutation groups
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• scientific article; zbMATH DE number 1849958 (Why is no real title available?)
• Information-set decoding for linear codes over F_q
• On the subgroup distance problem.
• Permutation codes for discrete channels (Corresp.)
• Permutation Decoding of Systematic Codes
• Statistics for \(S_n\) acting on \(k\)-sets
• The Symmetric Group as Metric Space
• The wonderful Walecki construction
• Uncoverings-by-bases for base-transitive permutation groups.

This page was built for publication: A McEliece cryptosystem using permutation codes

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