On the security of the Courtois-Finiasz-Sendrier signature

DOI10.1515/MATH-2018-0011zbMath1444.94091OpenAlexW2800673364WikidataQ114846041 ScholiaQ114846041MaRDI QIDQ1643411

Kirill Morozov, Partha Sarathi Roy, Rui Xu, Rainer Steinwandt

Publication date: 19 June 2018

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2018-0011

zbMATH Keywords

provable securitypost-quantum cryptographycode-based digital signatureCourtois-Finiasz-Sendrier signature

Mathematics Subject Classification ID

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

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security of signature schemes in a multi-user setting
• An Efficient Attack on a Code-Based Signature Scheme
• A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
• Post-quantum Cryptography: Code-Based Signatures
• Digital Signatures
• A Summary of McEliece-Type Cryptosystems and their Security
• Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme

This page was built for publication: On the security of the Courtois-Finiasz-Sendrier signature