Sciweavers

SACRYPT
2001
Springer
106views Cryptology» more  SACRYPT 2001»
13 years 9 months ago
Fast Normal Basis Multiplication Using General Purpose Processors
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
Arash Reyhani-Masoleh, M. Anwarul Hasan