A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography
作者： Ernest F. Brickell
DOI: 10.1007/978-1-4757-0602-4_5
关键词:
摘要: This paper presents an algorithm which will perform multiplication modulo C in [log2C] + 7 clock pulses.
springer.com
sci-hub.st 参考文章(8)
S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) IEEE Transactions on Information Theory. ,vol. 24, pp. 106- 110 ,(1978) , 10.1109/TIT.1978.1055817
C. S. Wallace, A Suggestion for a Fast Multiplier IEEE Transactions on Electronic Computers. ,vol. 13, pp. 14- 17 ,(1964) , 10.1109/PGEC.1964.263830
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM. ,vol. 26, pp. 96- 99 ,(1983) , 10.1145/357980.358017
R. Merkle, M. Hellman, Hiding information and signatures in trapdoor knapsacks IEEE Transactions on Information Theory. ,vol. 24, pp. 525- 530 ,(1978) , 10.1109/TIT.1978.1055927
Whitfield Diffie, Martin E Hellman, None, New Directions in Cryptography IEEE Transactions on Information Theory. ,vol. 22, pp. 644- 654 ,(1976) , 10.1109/TIT.1976.1055638
Fredrich Adam Rohatsch, A Study of Transformations Applicable to the Development of Limited Carry-Borrow Propagation Adders ,(1967)
Donald Ervin Knuth, The Art of Computer Programming ,(1968)
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM. ,vol. 21, pp. 120- 126 ,(1978) , 10.1145/359340.359342