Fast bit-level, word-level and parallel arithmetic in finite fields for elliptic curve cryptosystems
Computer and network security has recently become a popular subject due to the explosive growth of the Internet and the migration of commerce practices to the electronic medium. Thus the authenticity and privacy of the information transmitted and the data stored on networked computers is of utmost i...
Main Author: | Halbuto��ullar��, Alper |
---|---|
Other Authors: | Koc, Cetin K. |
Language: | en_US |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/1957/33546 |
Similar Items
-
A fast addition algorithm for elliptic curve arithmetic in GF(2n) using projective coordinates
by: Higuchi, Akira, et al.
Published: (2000) -
Efficient Elliptic Curve Processor Architectures for Field Programmable Logic
by: Orlando, Gerardo
Published: (2002) -
SYSTEMATIZATION AND ANALYSIS OF PARTIALLY AND FULLY HOMOMORPHIC CRYPTOSYSTEM
by: A. V. Epishkina, et al.
Published: (2016-12-01) -
High-speed algorithms & architectures for number-theoretic cryptosystems
by: Acar, Tolga
Published: (2012) -
Efficient Algorithms for Elliptic Curve Cryptosystems on Embedded Systems
by: Woodbury, Adam D
Published: (2001)