A multiplier to enhance the speed of encryption/decryption

  • Authors:
  • Yang Ai-Min;Zhang Wen-Xiang

  • Affiliations:
  • Doctor of Wuhan University of Technology and Computer Science and Information Technology College, Zhejiang Wanli University, Ningbo, Zhejiang Province, China;Doctor of Wuhan University of Technology and Computer Science and Information Technology College, Zhejiang Wanli University, Ningbo, Zhejiang Province, China

  • Venue:
  • ISP'06 Proceedings of the 5th WSEAS International Conference on Information Security and Privacy
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

It has become increasingly common to implement discrete-algorithm based public-key protocols on elliptic curves over finite fields. The operations, especially multiplication, over finite fields affect greatly the speed of encryption/decryption. For this reason the contribution describes a fast multiplier for Elliptic Curve Cryptosystems over finite fields GF ((2m1)m2). This multiplier adopts mixed parallel-serial approaches., The number of clock cycles for one field multiplication can be reduced from former m= m2m1 to current m2 with less increase of hardware scales.