Faster 2-Regular Information-Set Decoding

DOI10.1007/978-3-642-20901-7_5zbMath1272.94096MaRDI QIDQ3005582

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

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

binary codes; information-set decoding; 2-regular decoding; FSB

Mathematics Subject Classification ID

94B05: Linear codes (general theory)

94B35: Decoding

Related Items

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$

Uses Software

• McEliece

Cites Work

• Post-quantum cryptography. Second international workshop, PQCrypto 2008, Cincinnati, OH, USA, October 17--19, 2008. Proceedings
• 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
• 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.
• Really Fast Syndrome-Based Hashing
• Attacking and Defending the McEliece Cryptosystem
• Syndrome Based Collision Resistant Hashing
• Security Bounds for the Design of Code-Based Cryptosystems
• FSBday
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• A note on Wyner's wiretap channel (Corresp.)
• 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
• Progress in Cryptology – Mycrypt 2005
• Unnamed Item
• Unnamed Item
• Unnamed Item