Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions

  • Robert Granger
  • Michael Scott
Conference paper

DOI: 10.1007/978-3-642-13013-7_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6056)
Cite this paper as:
Granger R., Scott M. (2010) Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. In: Nguyen P.Q., Pointcheval D. (eds) Public Key Cryptography – PKC 2010. PKC 2010. Lecture Notes in Computer Science, vol 6056. Springer, Berlin, Heidelberg

Abstract

This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of \(\mathbb{F}_{q^6}^{\times}\), for \(q \equiv 1 \bmod{6}\). Our result arises from considering the Weil restriction of scalars of this group from \(\mathbb{F}_{q^6}\) to \(\mathbb{F}_{q^2}\), and provides efficiency improvements for both pairing-based and torus-based cryptographic protocols. In particular we argue that such fields are ideally suited for the latter when the field characteristic satisfies \(p \equiv 1 \pmod{6}\), and since torus-based techniques can be applied to the former, we present a compelling argument for the adoption of a single approach to efficient field arithmetic for pairing-based cryptography.

Keywords

Pairing-based cryptography torus-based cryptography finite field arithmetic 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Robert Granger
    • 1
  • Michael Scott
    • 1
  1. 1.Claude Shannon Institute School of ComputingDublin City UniversityGlasnevin, Dublin 9Ireland

Personalised recommendations