43 search results - page 5 / 9 » A Fast Finite Field Multiplier |
116
Voted
CHES
2009
Springer
16 years 1 months ago
2009
Springer
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...
107
Voted
MASCOTS
2001
15 years 2 months ago
2001
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
148
Voted
ASAP
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract--This paper proposes an FPGA-based applicationspecific elliptic curve processor over a prime field. This research targets applications for which compactness is more import...
106
Voted
TC
2008
15 years 18 days ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
99
Voted
SACRYPT
2001
Springer
15 years 5 months ago
2001
Springer
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...