论文信息 - A Fast Modular-multiplication Algorithm based on a Higher Radix

A Fast Modular-multiplication Algorithm based on a Higher Radix

This paper presents a new fast compact modular-multiplication algorithm, which will multiply modulo N in log(N)/log(r) clock pulses when the algorithm is based on radix r (r ? 4).

Hikaru Morita | H. Morita

[1] P. W. Baker. Fast computation of A * B modulo N , 1987 .

[2] Kai Hwang,et al. Computer arithmetic: Principles, architecture, and design , 1979 .

[3] Blakely. A Computer Algorithm for Calculating the Product AB Modulo M , 1983, IEEE Transactions on Computers.

[4] Ernest F. Brickell,et al. A Fast Modular Multiplication Algorithm With Application To Two Key Cryptography , 1982, CRYPTO.

[5] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[6] Joos Vandewalle,et al. Fast RSA-Hardware: Dream or Reality? , 1988, EUROCRYPT.