Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Benaloh, J., Dai, W.: Fast Modular Reduction. In: CRYPTO 1995 Rump Session (1995)
2. Beth, T., Gollmann, D.: Algorithm engineering for public key algorithms. IEEE J. SAC 7(4), 458–466 (1989)
3. Brickell, E.F.: A Fast Modular Multiplication Algorithm with Applications to Two Key Cryptography. In: Proc. CRYPTO 1982, pp. 51–60. Plenum Press (1983)
4. Lecture Notes in Computer Science;S. Chari,2003
5. Elbirt, A.J., Paar, C.: Towards an FPGA architecture optimized for public-key algorithms. In: The SPIE’s Symposium on Voice, Video, and Communications, Boston (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献