Published in

Springer, Lecture Notes in Computer Science, p. 208-224, 2007

DOI: 10.1007/978-3-540-73489-5_11

Links

Tools

Export citation

Search in Google Scholar

Instruction Set Extensions for Pairing-Based Cryptography

Proceedings article published in 2007 by Tobias Vejda, Dan Page, Johann Großschädl
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

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 p, 2n and 3n. 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 2n and 3n, which sheds new light on the relative performance of p, 2n and 3n in the context of pairing-based cryptography.