Author:
Peeters Eric,Neve Michael,Ciet Mathieu
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society, August 29 (2000)
2. Lecture Notes in Computer Science;P. Barrett,1987
3. Brent, R.P., Kung, H.T.: The Area-Time Complexity of Binary Multiplication. J. ACM 28, 521–534 (1981)
4. Brickell, E.F.: A fast modular multiplication algorithm with application to two key cryptography. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in cryptology Proc. of CRYPTO 1982, pp. 51–60. Plenum Press (1983)
5. Blum, T., Paar, C.: High-Radix montgomery modular exponentiation on reconfigurable hardware. IEEE Trans. on Computers 50(7), 759–764 (2001)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献