A coprocessor for the final exponentiation of the ηT pairing in characteristic three

Jean Luc Beuchat, Nicolas Brisebarre, Masaaki Shirase, Tsuyoshi Takagi, Eiji Okamoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Since the introduction of pairings over (hyper)elliptic curves in constructive cryptographic applications, an ever increasing number of protocols based on pairings have appeared in the literature. Software implementations being rather slow, the study of hardware architectures became an active research area. Beuchat et al. proposed for instance a coprocessor which computes the characteristic three ηT pairing, from which the Tate pairing can easily be derived, in 33μs on a Cyclone II FPGA. However, a final exponentiation is required to ensure a unique output value and the authors proposed to supplement their ηT pairing accelerator with a coprocessor for exponentiation. Thus, the challenge consists in designing the smallest possible piece of hardware able to perform this task in less than 33 /is on a Cyclone II device. In this paper, we propose a novel arithmetic operator implementing addition, cubing, and multiplication over double-struck F sign397 and show that a coprocessor based on a single such operator meets this timing constraint.

Original languageEnglish
Title of host publicationArithmetic of Finite Fields - First International Workshop, WAIFI 2007, Proceedings
Pages25-39
Number of pages15
Publication statusPublished - Dec 1 2007
Event1st International Workshop on Arithmetic of Finite Fields, WAIFI 2007 - Madrid, Spain
Duration: Jun 21 2007Jun 22 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4547 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Workshop on Arithmetic of Finite Fields, WAIFI 2007
CountrySpain
CityMadrid
Period6/21/076/22/07

Fingerprint

Exponentiation
Pairing
Hardware
Tate Pairing
Cube
Particle accelerators
Hyperelliptic Curves
Hardware Architecture
Field programmable gate arrays (FPGA)
Operator
Accelerator
Field Programmable Gate Array
Timing
Multiplication
Software
Coprocessor
Output

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Beuchat, J. L., Brisebarre, N., Shirase, M., Takagi, T., & Okamoto, E. (2007). A coprocessor for the final exponentiation of the ηT pairing in characteristic three. In Arithmetic of Finite Fields - First International Workshop, WAIFI 2007, Proceedings (pp. 25-39). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4547 LNCS).

A coprocessor for the final exponentiation of the ηT pairing in characteristic three. / Beuchat, Jean Luc; Brisebarre, Nicolas; Shirase, Masaaki; Takagi, Tsuyoshi; Okamoto, Eiji.

Arithmetic of Finite Fields - First International Workshop, WAIFI 2007, Proceedings. 2007. p. 25-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4547 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Beuchat, JL, Brisebarre, N, Shirase, M, Takagi, T & Okamoto, E 2007, A coprocessor for the final exponentiation of the ηT pairing in characteristic three. in Arithmetic of Finite Fields - First International Workshop, WAIFI 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4547 LNCS, pp. 25-39, 1st International Workshop on Arithmetic of Finite Fields, WAIFI 2007, Madrid, Spain, 6/21/07.
Beuchat JL, Brisebarre N, Shirase M, Takagi T, Okamoto E. A coprocessor for the final exponentiation of the ηT pairing in characteristic three. In Arithmetic of Finite Fields - First International Workshop, WAIFI 2007, Proceedings. 2007. p. 25-39. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Beuchat, Jean Luc ; Brisebarre, Nicolas ; Shirase, Masaaki ; Takagi, Tsuyoshi ; Okamoto, Eiji. / A coprocessor for the final exponentiation of the ηT pairing in characteristic three. Arithmetic of Finite Fields - First International Workshop, WAIFI 2007, Proceedings. 2007. pp. 25-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{509cbc9a5241488799aaa118ef527475,
title = "A coprocessor for the final exponentiation of the ηT pairing in characteristic three",
abstract = "Since the introduction of pairings over (hyper)elliptic curves in constructive cryptographic applications, an ever increasing number of protocols based on pairings have appeared in the literature. Software implementations being rather slow, the study of hardware architectures became an active research area. Beuchat et al. proposed for instance a coprocessor which computes the characteristic three ηT pairing, from which the Tate pairing can easily be derived, in 33μs on a Cyclone II FPGA. However, a final exponentiation is required to ensure a unique output value and the authors proposed to supplement their ηT pairing accelerator with a coprocessor for exponentiation. Thus, the challenge consists in designing the smallest possible piece of hardware able to perform this task in less than 33 /is on a Cyclone II device. In this paper, we propose a novel arithmetic operator implementing addition, cubing, and multiplication over double-struck F sign397 and show that a coprocessor based on a single such operator meets this timing constraint.",
author = "Beuchat, {Jean Luc} and Nicolas Brisebarre and Masaaki Shirase and Tsuyoshi Takagi and Eiji Okamoto",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540730736",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "25--39",
booktitle = "Arithmetic of Finite Fields - First International Workshop, WAIFI 2007, Proceedings",

}

TY - GEN

T1 - A coprocessor for the final exponentiation of the ηT pairing in characteristic three

AU - Beuchat, Jean Luc

AU - Brisebarre, Nicolas

AU - Shirase, Masaaki

AU - Takagi, Tsuyoshi

AU - Okamoto, Eiji

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Since the introduction of pairings over (hyper)elliptic curves in constructive cryptographic applications, an ever increasing number of protocols based on pairings have appeared in the literature. Software implementations being rather slow, the study of hardware architectures became an active research area. Beuchat et al. proposed for instance a coprocessor which computes the characteristic three ηT pairing, from which the Tate pairing can easily be derived, in 33μs on a Cyclone II FPGA. However, a final exponentiation is required to ensure a unique output value and the authors proposed to supplement their ηT pairing accelerator with a coprocessor for exponentiation. Thus, the challenge consists in designing the smallest possible piece of hardware able to perform this task in less than 33 /is on a Cyclone II device. In this paper, we propose a novel arithmetic operator implementing addition, cubing, and multiplication over double-struck F sign397 and show that a coprocessor based on a single such operator meets this timing constraint.

AB - Since the introduction of pairings over (hyper)elliptic curves in constructive cryptographic applications, an ever increasing number of protocols based on pairings have appeared in the literature. Software implementations being rather slow, the study of hardware architectures became an active research area. Beuchat et al. proposed for instance a coprocessor which computes the characteristic three ηT pairing, from which the Tate pairing can easily be derived, in 33μs on a Cyclone II FPGA. However, a final exponentiation is required to ensure a unique output value and the authors proposed to supplement their ηT pairing accelerator with a coprocessor for exponentiation. Thus, the challenge consists in designing the smallest possible piece of hardware able to perform this task in less than 33 /is on a Cyclone II device. In this paper, we propose a novel arithmetic operator implementing addition, cubing, and multiplication over double-struck F sign397 and show that a coprocessor based on a single such operator meets this timing constraint.

UR - http://www.scopus.com/inward/record.url?scp=38149033707&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149033707&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38149033707

SN - 9783540730736

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 25

EP - 39

BT - Arithmetic of Finite Fields - First International Workshop, WAIFI 2007, Proceedings

ER -