Abstract
In this paper, fast and compact implementations for code-based signature are presented. Existing designs are either using enormous memory storage or suffering from slow issuing speed of signatures. A vastly optimized new design solving these problems is proposed by exploiting quasi-cyclic low-density generator matrix codes at different levels. In particular, this paper provides a new algorithmic enhancement of signature generation and gives detailed and optimized solutions for critical steps of this algorithm. The design presented in this paper is the fastest implementation of code-based signatures in open literature. It is shown, for instance, that our implementation of signature generation engine can generate approximately 60,000 signatures per second on a Xilinx Virtex-6 FPGA, requiring only 5992 slices and 60 memory blocks. In addition, a very compact implementation is also provided, producing 5438 signatures per second with only 18 memory blocks.
| Original language | English |
|---|---|
| Article number | 7891573 |
| Pages (from-to) | 2086-2097 |
| Journal | IEEE Transactions on Circuits and Systems I: Regular Papers |
| Volume | 64 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - Aug 2017 |
Research Keywords
- CFS signature scheme
- Code-based cryptography
- FPGA
- QC-LDGM code
Fingerprint
Dive into the research topics of 'Toward Practical Code-Based Signature: Implementing Fast and Compact QC-LDGM Signature Scheme on Embedded Hardware'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver