Comparison of FPGA implementation of the mod M reduction
暂无分享,去创建一个
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 gen- eralized version of the Barrett algorithm and a modi- fied version of the same Barrett algorithm. The four mentioned algorithms, as well as the classical integer non-restoring division algorithm, have been synthe- sized and implemented within xc3s4000 components.
[1] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[2] Alfred Menezes,et al. Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.
[3] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .