An architecture for elliptic curve cryptograph computation

Authors:
Masaaki Shirase;Yasushi Hibino
Affiliations:
School of Information Science;School of Information Science
Venue:
ACM SIGARCH Computer Architecture News - Special issue: Workshop on architectural support for security and anti-virus (WASSA)
Year:
2005

Citing 4
Cited 0

A course in number theory and cryptography

A course in number theory and cryptography
Computer arithmetic systems: algorithms, architecture and implementation

Computer arithmetic systems: algorithms, architecture and implementation
Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that several public key cryptosystems such as RSAs, ElGamals and elliptic curve cryptosystems [1], and also elliptic curve cryptosystems require smaller keys and more efficient operation than RSAs and ElGamals for same security. For example, elliptic curve cryptosystems with 160 bits key have same security as RSAs and ElGamals with 1024 bits key have. We focus elliptic curve cryptosystems and propose an architecture of computation unit for an elliptic curve cryptosystem with small hardware.