Squaring Algorithm Efficient for Cubic Extension Field Derived with Pseudo Gauss Period Normal Basis

Access this Article

Search this Article

Author(s)

Abstract

Recently, pairing–based cryptographies have attracted much attention. For fast pairing calculation, not only pairing algorithms but also arithmetic operations in extension field should be efficient. Especially for final exponentiation included in pairing calculation, squaring is more important than multiplication. This paper considers squaring algorithms efficient for cubic extension field which is often used for pairing implementaions.

Journal

  • Memoirs of the Faculty of Engineering, Okayama University

    Memoirs of the Faculty of Engineering, Okayama University (45), 54-59, 2011-01

    Faculty of Engineering, Okayama University

Codes

  • NII Article ID (NAID)
    80021759252
  • NII NACSIS-CAT ID (NCID)
    AA12014085
  • Text Lang
    ENG
  • Article Type
    departmental bulletin paper
  • ISSN
    1349-6115
  • Data Source
    IR 
Page Top