Design of Finite Field Multiplier for Elliptic Curve Cryptosystems

타원곡선 암호화 시스템을 위한 유한필드 곱셈기의 설계

  • 이욱 (원광대학교 전기공학과) ;
  • 이상설 (원광대학교 전기공학과)
  • Published : 2001.07.18

Abstract

Elliptic curve cryptosystems based on discrete logarithm problem in the group of points of an elliptic curve defined over a finite field. The discrete logarithm in an elliptic curve group appears to be more difficult than discrete logarithm problem in other groups while using the relatively small key size. An implementation of elliptic curve cryptosystems needs finite field arithmetic computation. Hence finite field arithmetic modules must require less hardware resources to archive high performance computation. In this paper, a new architecture of finite field multiplier using conversion scheme of normal basis representation into polynomial basis representation is discussed. Proposed architecture provides less resources and lower complexity than conventional bit serial multiplier using normal basis representation. This architecture has synthesized using synopsys FPGA express successfully.

Keywords