Author:
Woodbury Adam D.,Bailey Daniel V.,Paar Christof
Reference25 articles.
1. Daniel V. Bailey. Optimal Extension Fields. Major Qualifying Project (Senior Thesis), 1998. Computer Science Department, Worcester Polytechnic Institute, Worcester, MA, USA.
2. Daniel V. Bailey and Christof Paar. Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. In Advances in Cryptology - CRYPTO ‘88. Springer-Verlag Lecture Notes in Computer Science, 1998.
3. Daniel V. Bailey and Christof Paar. Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography. Journal of Cryptology, to appear.
4. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. Cambridge University Press, 1999.
5. E. F. Brickell, D. M. Gordon, K. S. McCurley, and D. B. Wilson. Fast exponentiation with precomputation. In Advances in Cryptography — EUROCRYPT ‘82, pages 200–207. Springer-Verlag, 1993.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献