High radix Montgomery Multipliers for residue arithmetic channels on FPGAs | Macquarie University ResearchOnline

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/139256

40 Visitors

43 Hits

0 Downloads

Title: High radix Montgomery Multipliers for residue arithmetic channels on FPGAs
Related: International Conference on Electrical and Electronics Engineering (ICEEE 2010) (1st : 2010) (4 - 5 December 2010 : Wuhan, China)
Related: Zeng, Dehuai. Future intelligent information systems : Vol. 1, p.23-30
DOI: 10.1007/978-3-642-19706-2_4
Related: Lecture Notes in Electrical Engineering Vol. 86
Publisher: Berlin ; Heidelberg : Springer
Date: 2011
FoR/RFCD Code(s): 010000 Mathematical Sciences 080500 Distributed Computing
Author/Creator: Kong, Yinan
Description: This work targets an efficient Montgomery Modular Multiplier for use in the channels of a Residue Number System (RNS). It is implemented on FPGA and optimized by attempting and evaluating the high radix techniques of the Montgomery Algorithm. The usual correction shift step at the end is proved to be infeasible. The resulting multiplier achieves 15ns for a modular multiplication using high radix without correction shift.
Description: 8 page(s)
Subject Keyword: 010000 Mathematical Sciences
Subject Keyword: 080500 Distributed Computing
Subject Keyword: Montgomery Modular Multiplication
Subject Keyword: Residue Number System
Subject Keyword: FPGA
Subject Keyword: digital arithmetic
Subject Keyword: public-key cryptosystems
Resource Type: conference paper
Organisation: Macquarie University. Dept. of Electronic Engineering

Macquarie University ResearchOnline