Cryptology ePrint Archive: Report 2017/397

Efficient Digital Signatures From Coding Theory

Edoardo Persichetti

Abstract: The design of an efficient code-based signature scheme is by all means still an open problem. In this paper, we propose a simple and efficient scheme following the framework detailed by Lyubashevsky to construct an identification scheme. The scheme is based on quasi-cyclic codes and, while security relies on the ring algebra that is associated with them, the proposal benefits from the quasi-cyclic structure in reducing key and signature sizes.

Category / Keywords: public-key cryptography / Signature, Coding Theory, Identification

Date: received 5 May 2017, last revised 12 Jul 2017

Contact author: epersichetti at fau edu

Available format(s): PDF | BibTeX Citation

Note: Forgot to compile bibliography.

Version: 20170712:101131 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]