Comparison of FPGA implementation of the mod M reduction

Deschamps, J-P.; Sutter, G.

Services on Demand

Journal

SciELO Analytics
Google Scholar H5M5 ()

Article

English (pdf)
Article in xml format
Article references
How to cite this article
SciELO Analytics

Automatic translation
Send this article by e-mail

Indicators

Cited by SciELO

Latin American applied research

Print version ISSN 0327-0793

Abstract

DESCHAMPS, J-P. and SUTTER, G.. Comparison of FPGA implementation of the mod M reduction. Lat. Am. appl. res. [online]. 2007, vol.37, n.1, pp.93-97. ISSN 0327-0793.

Several algorithms for computing x mod m are presented, among others the reduction mod B^k-a, the pre-computation of B^i.k mod m, a generalized version of the Barrett algorithm and a modified version of the same Barrett algorithm. The four mentioned algorithms, as well as the classical integer non-restoring division algorithm, have been synthesized and implemented within xc3s4000 components.

Keywords : Arithmetic in FPGA; Galois Field; Cryptography; Modular Operation.

· text in English · English (

pdf )