Accelerating AES Using Instruction Set Extensions for Elliptic Curve Cryptography

Stefan Tillich; Johann Großschädl

doi:10.1007/11424826_70

Accelerating AES Using Instruction Set Extensions for Elliptic Curve Cryptography

Stefan Tillich, Johann Großschädl

Institut für Angewandte Informationsverarbeitung und Kommunikationstechnologie (7050)

Publikation: Beitrag in Buch/Bericht/Konferenzband › Beitrag in einem Konferenzband › Begutachtung

Abstract

The Advanced Encryption Standard (AES) specifies an algorithm for a symmetric-key cryptosystem that has already found wide adoption in security applications. A substantial part of the AES algorithm are the MixColumns and InvMixColumns operations, which involve multiplications in the binary extension field GF(28). Recently proposed instruction set extensions for elliptic curve cryptography (ECC) include custom instructions for the multiplication of binary polynomials. In the present paper we analyze how well these custom instructions are suited to accelerate a software implementation of the AES. We used the SPARC V8-compatible LEON-2 processor with ECC extensions for verification and to obtain realistic timing results. Taking the fastest implementation for 32-bit processors as reference, we were able to achieve speedups of up to 25% for encryption and nearly 20% for decryption.

Originalsprache	englisch
Titel	Computational Science and Its Applications / Pt. 2
Redakteure/-innen	Osvaldo Gervasi
Erscheinungsort	Berlin
Herausgeber (Verlag)	Spinger
Seiten	665-675
ISBN (Print)	3-540-25861-2
DOIs	https://doi.org/10.1007/11424826_70
Publikationsstatus	Veröffentlicht - 2005
Veranstaltung	International Conference on Computational Science & its Applications - Singapur, Singapur Dauer: 9 Mai 2005 → 12 Mai 2005

Publikationsreihe

Name	Lecture notes in computer science
Herausgeber (Verlag)	Spinger
Band	3481

Konferenz

Konferenz	International Conference on Computational Science & its Applications
Land/Gebiet	Singapur
Ort	Singapur
Zeitraum	9/05/05 → 12/05/05

Treatment code (Nähere Zuordnung)

Application
Experimental

Zugriff auf Dokument

10.1007/11424826_70

Andere Dateien und Links

Instruction Set Extensions and Architectural Enhancements for Public-Key Cryptography on General-Purpose RISC Processors
Tillich, S., Großschädl, J., Szekely, A. & Posch, K.
1/12/03 → 31/10/06
Projekt: Forschungsprojekt

Dieses zitieren

Accelerating AES Using Instruction Set Extensions for Elliptic Curve Cryptography. / Tillich, Stefan; Großschädl, Johann.
Computational Science and Its Applications / Pt. 2. Hrsg. / Osvaldo Gervasi. Berlin: Spinger, 2005. S. 665-675 (Lecture notes in computer science; Band 3481).

Publikation: Beitrag in Buch/Bericht/Konferenzband › Beitrag in einem Konferenzband › Begutachtung

Tillich, S & Großschädl, J 2005, Accelerating AES Using Instruction Set Extensions for Elliptic Curve Cryptography. in O Gervasi (Hrsg.), Computational Science and Its Applications / Pt. 2. Lecture notes in computer science, Bd. 3481, Spinger, Berlin, S. 665-675, International Conference on Computational Science & its Applications, Singapur, Singapur, 9/05/05. https://doi.org/10.1007/11424826_70

@inproceedings{fb82e69ffb1c4279925ce463eb7cbf77,

title = "Accelerating AES Using Instruction Set Extensions for Elliptic Curve Cryptography",

abstract = "The Advanced Encryption Standard (AES) specifies an algorithm for a symmetric-key cryptosystem that has already found wide adoption in security applications. A substantial part of the AES algorithm are the MixColumns and InvMixColumns operations, which involve multiplications in the binary extension field GF(28). Recently proposed instruction set extensions for elliptic curve cryptography (ECC) include custom instructions for the multiplication of binary polynomials. In the present paper we analyze how well these custom instructions are suited to accelerate a software implementation of the AES. We used the SPARC V8-compatible LEON-2 processor with ECC extensions for verification and to obtain realistic timing results. Taking the fastest implementation for 32-bit processors as reference, we were able to achieve speedups of up to 25% for encryption and nearly 20% for decryption.",

author = "Stefan Tillich and Johann Gro{\ss}sch{\"a}dl",

note = "International Workshop on Information Security & Hiding, ISH '05; International Conference on Computational Science & its Applications ; Conference date: 09-05-2005 Through 12-05-2005",

year = "2005",

doi = "10.1007/11424826_70",

language = "English",

isbn = "3-540-25861-2",

series = "Lecture notes in computer science",

publisher = "Spinger",

pages = "665--675",

editor = "Osvaldo Gervasi",

booktitle = "Computational Science and Its Applications / Pt. 2",

}

TY - GEN

T1 - Accelerating AES Using Instruction Set Extensions for Elliptic Curve Cryptography

AU - Tillich, Stefan

AU - Großschädl, Johann

N1 - International Workshop on Information Security & Hiding, ISH '05

PY - 2005

Y1 - 2005

N2 - The Advanced Encryption Standard (AES) specifies an algorithm for a symmetric-key cryptosystem that has already found wide adoption in security applications. A substantial part of the AES algorithm are the MixColumns and InvMixColumns operations, which involve multiplications in the binary extension field GF(28). Recently proposed instruction set extensions for elliptic curve cryptography (ECC) include custom instructions for the multiplication of binary polynomials. In the present paper we analyze how well these custom instructions are suited to accelerate a software implementation of the AES. We used the SPARC V8-compatible LEON-2 processor with ECC extensions for verification and to obtain realistic timing results. Taking the fastest implementation for 32-bit processors as reference, we were able to achieve speedups of up to 25% for encryption and nearly 20% for decryption.

AB - The Advanced Encryption Standard (AES) specifies an algorithm for a symmetric-key cryptosystem that has already found wide adoption in security applications. A substantial part of the AES algorithm are the MixColumns and InvMixColumns operations, which involve multiplications in the binary extension field GF(28). Recently proposed instruction set extensions for elliptic curve cryptography (ECC) include custom instructions for the multiplication of binary polynomials. In the present paper we analyze how well these custom instructions are suited to accelerate a software implementation of the AES. We used the SPARC V8-compatible LEON-2 processor with ECC extensions for verification and to obtain realistic timing results. Taking the fastest implementation for 32-bit processors as reference, we were able to achieve speedups of up to 25% for encryption and nearly 20% for decryption.

UR - http://springerlink.metapress.com/content/ttnnlxyl5e4b/

UR - http://www.springerlink.com/content/uwqduy8b505lxkef/

U2 - 10.1007/11424826_70

DO - 10.1007/11424826_70

M3 - Conference paper

SN - 3-540-25861-2

T3 - Lecture notes in computer science

SP - 665

EP - 675

BT - Computational Science and Its Applications / Pt. 2

A2 - Gervasi, Osvaldo

PB - Spinger

CY - Berlin

T2 - International Conference on Computational Science & its Applications

Y2 - 9 May 2005 through 12 May 2005

ER -

Accelerating AES Using Instruction Set Extensions for Elliptic Curve Cryptography

Abstract

Publikationsreihe

Konferenz

Treatment code (Nähere Zuordnung)

Zugriff auf Dokument

Andere Dateien und Links

Fingerprint

Projekte

Instruction Set Extensions and Architectural Enhancements for Public-Key Cryptography on General-Purpose RISC Processors

Dieses zitieren