Instruction set extensions for fast arithmetic in finite fields GF(p) and GF(2(m))

Großschädl, Johann and Savaş, Erkay (2004) Instruction set extensions for fast arithmetic in finite fields GF(p) and GF(2(m)). Lecture Notes in Computer Science (Cryptographic Hardware and Embedded Systems - CHES 2004, Proceedings), 3156 (LNCS 3156). pp. 133-147. ISSN 0302-9743 (Print) 1611-3349 (Online)

[img]PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://www.ruhr-uni-bochum.de/itsc/tanja/vampire/slides/JohannGroszschaedl.pdf


Instruction set extensions are a small number of custom instructions specifically designed to accelerate the processing of a given kind of workload such as multimedia or cryptography. Enhancing a general-purpose RISC processor with a few application-specific instructions to facilitate the inner loop operations of public-key cryptosystems can result in a significant performance gain. In this paper we introduce a set of five custom instructions to accelerate arithmetic operations in finite fields GF(p) and GF(2m). The custom instructions can be easily integrated into a standard RISC architecture like MIPS32 and require only little extra hardware. Our experimental results show that an extended MIPS32 core is able to perform an elliptic curve scalar multiplication over a 192-bit prime field in 36 msec, assuming a clock speed of 33 MHz. An elliptic curve scalar multiplication over the binary field GF(2191) takes only 21 msec, which is approximately six times faster than a software implementation on a standard MIPS32 processor.

Item Type:Article
Subjects:Q Science > QA Mathematics > QA075 Electronic computers. Computer science
ID Code:443
Deposited By:Erkay Savaş
Deposited On:19 Feb 2007 02:00
Last Modified:15 Feb 2010 16:17

Repository Staff Only: item control page