Research on computing IP core for the digital signature algorithm

  • Jianpeng Chu
  • , Yongsheng Xu
  • , Xiaojin Li
  • , Zongsheng Lai*
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Polynomial multiplication with big integer coefficients over finite field is frequently used in some digital signature algorithms, in which this kind of calculation is the most time consuming part realized by software. This paper presents a new method (FFT/IFFT) and try to solve it using FPGA. With the reduced calculation amount compared with normal algorithm and realized in hardware, it will greatly raise not only the performance of this calculation procedure but also the level of security. At the end of this paper, some intermediate results are given.

Original languageEnglish
Title of host publicationASICON 2003 - 2003 5th International Conference on ASIC, Proceedings
EditorsTing-Ao Tang, Wenhong Li, Huihua Yu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1329-1331
Number of pages3
ISBN (Electronic)078037889X
DOIs
StatePublished - 2003
Event5th International Conference on ASIC, ASICON 2003 - Beijing, China
Duration: 21 Oct 200324 Oct 2003

Publication series

NameIEEE International Symposium on Semiconductor Manufacturing Conference Proceedings
Volume2
ISSN (Print)1523-553X

Conference

Conference5th International Conference on ASIC, ASICON 2003
Country/TerritoryChina
CityBeijing
Period21/10/0324/10/03

Fingerprint

Dive into the research topics of 'Research on computing IP core for the digital signature algorithm'. Together they form a unique fingerprint.

Cite this