Back to search

University of the Aegean

Constructing suitable parameters for pairing-based cryptography

Abstract

dc:description

Pairings were introduced by André Weil back in 1940 and they were initially viewed as a tool for attacking the elliptic curve discrete logarithm problem. After almost 60 years from their discovery, pairings became one of the major research subjects in cryptography. One of the most important problems in applications that use pairings is the construction of suitable g-dimensional abelian vari- eties defined over a finite field. In order for these abelian varieties to be suitable for implementations, it is required that they have a small embedding degree and a large prime order subgroup. Such abelian varieties are called “pairing-friendly”.This dissertation is dedicated to the problem of constructing pairing-friendly g-dimensional abelian varieties over finite fields. We start with an overview of the theory surrounding pairings and abelian varieties over finite fields. We specialize our study on elliptic curves, which are basically one- dimensional abelian varieties. We describe the pairing-friendly properties and present a survey of the known methods for their construction. In addition we present an analytic study of our methods and results on constructing pairing-friendly elliptic curves and highlight their importance. One of the most important contribution is that in our examples we consider for the first time the recent improvements on reducing the complexity of the discrete logarithm problem in finite field extensions of composite embedding degree. These improvements are obtained by variants of the number field sieve methods and have a major impact on the choice of pairing-friendly curves. As a countermeasure we revise the criteria for selecting elliptic curve parameters for pairing-based applications.Higher-dimensional abelian varieties can be an alternative to elliptic curves and in some cases can be advantageous. Motivated by this we extend our study from elliptic curves to higher-dimensional abelian varieties. We give a short description of the most important methods and results in the literature. We emphasize on our work on absolutely simple and non-absolutely simple, ordinary, pairing-friendly abelian varieties. In both cases our work is specialized on two-dimensional abelian varieties. These are realized as Jacobians of genus 2 hyperelliptic curves and they are likely to offer secure and efficient applications. In addition, we also introduce various examples of non-absolutely simple abelian varieties for dimensions 3 and 4. Throughout the dissertation we provide an extensive analysis of our algorithmic procedures and the examples obtained by our algorithms.Finally we also try to highlight the open problems that exist today in this area, which determine the future of pairing-based cryptography.

Degree

thesis:*
Grantor dc:publisher
University of the Aegean
Year dc:date
2017

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Fotiadis, Georgios
  • Φωτιάδης, Γεώργιος

Subjects

dc:subject × 14

Rights

Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/41018

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Fotiadis, Georgios; Φωτιάδης, Γεώργιος. Constructing suitable parameters for pairing-based cryptography. University of the Aegean, 2017. http://hdl.handle.net/10442/hedi/41018