Sciweavers

37 search results - page 8 / 8
» Fast Algorithms for Elliptic Curve Cryptosystems over Binary...
Sort
View
SACRYPT
2001
Springer
106views Cryptology» more  SACRYPT 2001»
13 years 10 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
CHES
2009
Springer
162views Cryptology» more  CHES 2009»
14 years 6 months ago
Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers
Abstract. This paper is devoted to the design of fast parallel accelerators for the cryptographic Tate pairing in characteristic three over supersingular elliptic curves. We propos...
Jean-Luc Beuchat, Jérémie Detrey, Ni...