Skip to main navigation Skip to search Skip to main content

Efficient multiplier over finite field represented in type II optimal normal basis

  • Youbo Wang*
  • , Zhiguang Tian
  • , Xinyan Bi
  • , Zhendong Niu
  • *Corresponding author for this work
  • Beijing Institute of Technology
  • Nanjing University of Aeronautics and Astronautics
  • National University of Singapore

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

Abstract

Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation part. In this paper an efficient tradeoff multiplier implementation between full parallel and full serial multiplier is proposed based on optimal normal basis of type II and shifted canonical basis. Experiments show that the multiplier is suitable to realize in FPGA device.

Original languageEnglish
Title of host publicationProceedings - ISDA 2006
Subtitle of host publicationSixth International Conference on Intelligent Systems Design and Applications
Pages1132-1135
Number of pages4
DOIs
Publication statusPublished - 2006
EventISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications - Jinan, China
Duration: 16 Oct 200618 Oct 2006

Publication series

NameProceedings - ISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications
Volume1

Conference

ConferenceISDA 2006: Sixth International Conference on Intelligent Systems Design and Applications
Country/TerritoryChina
CityJinan
Period16/10/0618/10/06

Keywords

  • Bit parallel multiplier
  • Bit serial multiplier
  • Elliptic curve
  • Finite field

Fingerprint

Dive into the research topics of 'Efficient multiplier over finite field represented in type II optimal normal basis'. Together they form a unique fingerprint.

Cite this