Latin American applied research
versión impresa ISSN 0327-0793
Several algorithms for computing x mod m are presented, among others the reduction mod Bk-a, the pre-computation of Bi.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.
Palabras llave : Arithmetic in FPGA; Galois Field; Cryptography; Modular Operation.