Abstract
The design of a practical code-based signature scheme is an open problem in post-quantum cryptography. This paper is the full version of a work appeared at SIN’18 as a short paper, which introduced a simple and efficient one-time secure signature scheme based on quasi-cyclic codes. As such, this paper features, in a fully self-contained way, an accurate description of the scheme setting and related previous work, a detailed security analysis, and an extensive comparison and performance discussion.
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Software
Reference38 articles.
1. How to Achieve a McEliece-Based Digital Signature Scheme;Courtois,2001
2. A Digital Signature Scheme Based on Random Error-Correcting Codes;Kabatianskii,1997
3. How to Prove Yourself: Practical Solutions to Identification and Signature Problems;Fiat,1986
4. Improved identification schemes based on error-correcting codes;Véron;Appl. Algebra Eng. Commun. Comput.,1996
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献