You are looking at a specific version 20170509:121756 of this paper. See the latest version.

Paper 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.

Note: Latex citation in abstract

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
SignatureCoding TheoryIdentification
Contact author(s)
epersichetti @ fau edu
History
2018-09-24: last of 4 revisions
2017-05-09: received
See all versions
Short URL
https://ia.cr/2017/397
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.