Efficient Unified Arithmetic for Hardware Cryptography

Savaş, Erkay and Koç, Çetin Kaya (2008) Efficient Unified Arithmetic for Hardware Cryptography. In: Koç, Çetin Kaya, (ed.) Cryptographic Engineering. Circuits and Systems. Springer, Berlin Heidelberg. ISBN 978-0-387-71816-3 (Accepted/In Press)

WarningThere is a more recent version of this item available.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://www.springer.com/engineering/circuits+%26+systems/book/978-0-387-71816-3


The basic arithmetic operations (i.e. addition, multiplication, and inversion) in finite fields, GF(q), where q = pk and p is a prime integer, have several applications in cryptography, such as RSA algorithm, Diffie-Hellman key exchange algorithm [1], the US federal Digital Signature Standard [2], elliptic curve cryptography [3, 4], and also recently identity based cryptography [5, 6]. Most popular finite fields that are heavily used in cryptographic applications due to elliptic curve based schemes are prime fields GF(p) and binary extension fields GF(2n). Recently, identity based cryptography based on pairing operations defined over elliptic curve points has stimulated a significant level of interest in the arithmetic of ternary extension fields, GF(3^n).

Item Type:Book Section / Chapter
Subjects:T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK7800-8360 Electronics > TK7885-7895 Computer engineering. Computer hardware
Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:10197
Deposited By:Erkay Savaş
Deposited On:07 Nov 2008 16:02
Last Modified:19 Jul 2019 16:15

Available Versions of this Item

Repository Staff Only: item control page