A Scalable RNS Montgomery Multiplier over F2m
スポンサーリンク
概要
- 論文の詳細を見る
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.
- The Institute of Electronics, Information and Communication Engineersの論文
著者
-
Cheung Ray
Department of Electronic Engineering, City University of Hong Kong
-
Hu Jingwei
School of Computer Science and Technology, Tianjin University
-
Guo Wei
School of Computer Science and Technology, Tianjin University
-
Wei Jizeng
School of Computer Science and Technology, Tianjin University