International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Standard Basis

Authors:
Omran Ahmadi
Francisco Rodríguez-Henríquez
Download:
URL: http://eprint.iacr.org/2009/070
Search ePrint
Search Google
Abstract: We present low complexity formulae for the computation of cubing and cube root over $\F_{3^m}$ constructed using special classes of trinomials, tetranomials and pentanomials. We show that for all those special classes of polynomials, cube root operation has the same area and time complexity as field cubing when implemented in hardware or software platforms.
BibTeX
@misc{eprint-2009-18268,
  title={Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Standard Basis},
  booktitle={IACR Eprint archive},
  keywords={foundations / Finite field arithmetic; cubing; cube root; cryptography},
  url={http://eprint.iacr.org/2009/070},
  note={ francisco@cs.cinvestav.mx 14286 received 10 Feb 2009},
  author={Omran Ahmadi and Francisco Rodríguez-Henríquez},
  year=2009
}