Paper 2010/542

Squaring in cyclotomic subgroups

Koray Karabina

Abstract

We propose new squaring formulae for cyclotomic subgroups of certain finite fields. Our formulae use a compressed representation of elements having the property that decompression can be performed at a very low cost. The squaring formulae lead to new exponentiation algorithms in cyclotomic subgroups which outperform the fastest previously-known exponentiation algorithms when the exponent has low Hamming weight. Our algorithms can be adapted to accelerate the final exponentiation step of pairing computations.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Cyclotomic subgroupssquaringpairing-based cryptography
Contact author(s)
kkarabin @ uwaterloo ca
History
2010-10-25: received
Short URL
https://ia.cr/2010/542
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2010/542,
      author = {Koray Karabina},
      title = {Squaring in cyclotomic subgroups},
      howpublished = {Cryptology ePrint Archive, Paper 2010/542},
      year = {2010},
      note = {\url{https://eprint.iacr.org/2010/542}},
      url = {https://eprint.iacr.org/2010/542}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.