A scalable RNS montgomery multiplier over F2m

Jingwei Hu, Wei Guo, Jizeng Wei, Ray C.C. Cheung

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

This paper presents a fully parallelized and scalable RNS Montgomery multiplier over binary field. By generalizing the RNS Montgomery Multiplication (RNS MM) and elaborating a highly efficient RNS base selection, we are able to obtain a considerably high speed in our FPGA implementation experiments with acceptable circuit area and modest critical path delay. Furthermore, this design can be easily scalable by adjusting a variety of field sizes and field polynomials. © IEICE 2013.
Original languageEnglish
JournalIEICE Electronics Express
Volume10
Issue number23
DOIs
Publication statusPublished - 10 Dec 2013

Research Keywords

  • Binary field
  • FPGA
  • RNS MM
  • Scalable

Fingerprint

Dive into the research topics of 'A scalable RNS montgomery multiplier over F2m'. Together they form a unique fingerprint.

Cite this