Combining algorithm exploration with instruction set design: a case study in elliptic curve cryptography

Authors:
Johann Großschädl;Paolo Ienne;Laura Pozzi;Stefan Tillich;Ajay K. Verma
Affiliations:
Graz University of Technology, Graz, Austria;Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland;Graz University of Technology, Graz, Austria;Ecole Polytechnique Fédérale de Lausanne, Lausanne, Switzerland
Venue:
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Year:
2006

Citing 10
Cited 2

Introduction to finite fields and their applications

Introduction to finite fields and their applications
Exponentiation cryptosystems on the IBM PC

IBM Systems Journal
Montgomery Multiplication in GF(2^k

Designs, Codes and Cryptography
Lx: a technology platform for customizable VLIW embedded processing

Proceedings of the 27th annual international symposium on Computer architecture
Elliptic curves in cryptography

Elliptic curves in cryptography
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Automatic application-specific instruction-set extensions under microarchitectural constraints

Proceedings of the 40th annual Design Automation Conference
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
Processor Acceleration Through Automated Instruction Set Customization

Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
Exact and approximate algorithms for the extension of embedded processor instruction sets

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

CReconfigurable finite field instruction set architecture

Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays
Real-time computation of local neighborhood functions in application-specific instruction-set processors

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, processor customization has matured to become a trusted way of achieving high performance with limited cost/energy in embedded applications. In particular, Instruction Set Extensions (ISEs) have been proven very effective in many cases. A large body of work exists today on creating tools that can select efficient ISEs given an application source code: ISE automation is crucial for increasing the productivity of design teams. In this paper we show that an additional motivation for automating the ISE process is to facilitate algorithm exploration: the availability of ISE can have a dramatic impact on the performance of different algorithmic choices to implement identical or equivalent functionality. System designers need fast feedbacks on the ISE-ability of various algorithmic flavors. We use a case study in elliptic curve (EC) cryptography to exemplify the following contributions: (1) ISE can reverse the relative performance of different algorithms for one and the same operation, and (2) automatic ISE, even without predicting speed-ups as precisely as detailed simulation can, is able to show exactly the trends that the designer should follow.