Instruction set extensions for pairing-based cryptography

Tobias Vejda, Daniel Page, Johann Groszschaedl

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

11 Citations (Scopus)

Abstract

A series of recent algorithmic advances has delivered highly effective methods for pairing evaluation and parameter generation. However, the resulting multitude of options means many different variations of base field must ideally be supported on the target platform. Typical hardware accelerators in the form of co-processors possess neither the flexibility nor the scalability to support fields of different characteristic and order. On the other hand, extending the instruction set of a general-purpose processor by custom instructions for field arithmetic allows to combine the performance of hardware with the flexibility of software. To this end, we investigate the integration of a tri-field multiply-accumulate (MAC) unit into a SPARC V8 processor core to support arithmetic in GF($p$), GF($2^n$) and GF($3^n$). Besides integer multiplication, the MAC unit can also execute dedicated multiply and MAC instructions for binary and ternary polynomials. Our results show that the tri-field MAC unit adds only a small size overhead while significantly accelerating arithmetic in GF($2^n$) and GF($3^n$), which sheds new light on the relative performance of GF($p$), GF($2^n$) and GF($3^n$) in the context of pairing-based cryptography.
Translated title of the contributionInstruction Set Extensions for Pairing-Based Cryptography
Original languageEnglish
Title of host publicationPairing-Based Cryptography --- PAIRING 2007
PublisherSpringer Berlin Heidelberg
Pages208-224
Volume4575
Publication statusPublished - 2007

Fingerprint

Dive into the research topics of 'Instruction set extensions for pairing-based cryptography'. Together they form a unique fingerprint.

Cite this