Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms

Daniel V. Bailey, Christof Paar. Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. In Hugo Krawczyk, editor, Advances in Cryptology - CRYPTO 98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings. Volume 1462 of Lecture Notes in Computer Science, pages 472-485, Springer, 1998. [doi]

Abstract

Abstract is missing.