Faster 2-regular information-set decoding

DOI10.1007/978-3-642-20901-7_5MaRDI QIDQ3005582zbMATH OpenOpenAlexFDO

Authors Daniel J. Bernstein, Tanja Lange, Christiane Peters, Peter Schwabe

Publication date 8 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-20901-7_5

zbMATH Keywords

2-regular decodingbinary codesFSBinformation-set decoding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
• Information-set decoding for linear codes over F_q
• Analysis of information set decoding for a sub-linear error weight
• The complexity of information set decoding
• On computing nearest neighbors with applications to decoding of binary linear codes

Cites work

• A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
• A note on Wyner's wiretap channel (Corresp.)
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• Advances in cryptology -- ASIACRYPT 2009. 15th international conference on the theory and application of cryptology and information security, Tokyo, Japan, December 6--10, 2009. Proceedings
• Attacking and Defending the McEliece Cryptosystem
• FSBday
• scientific article; zbMATH DE number 4063029 (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?)
• Post-quantum cryptography. Second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17--19, 2008. Proceedings
• Progress in cryptology -- INDOCRYPT 2009. 10th international conference on cryptology in India, New Delhi, India, December 13--16, 2009. Proceedings
• Progress in cryptology -- Mycrypt 2005. First international conference on cryptology in Malaysia, Kuala Lumpur, Malaysia, September 28--30, 2005. Proceedings.
• Progress in Cryptology – Mycrypt 2005
• Really fast syndrome-based hashing
• Security bounds for the design of code-based cryptosystems
• Syndrome Based Collision Resistant Hashing

Cited in

(8)

• Information-set decoding with hints
• Post-quantum cryptography: state of the art
• Really fast syndrome-based hashing
• Statistical Decoding of Codes over $\mathbb{F}_q$
• A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
• Group encryption: full dynamicity, message filtering and code-based instantiation
• Fully dynamic attribute-based signatures for circuits from codes
• Code-based zero-knowledge from VOLE-in-the-head and their applications: simpler, faster, and smaller

Describes a project that uses

Uses Software

• McEliece

This page was built for publication: Faster 2-regular information-set decoding

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