Home > Table of Contents


Proceedings of 2009 International Workshop on Information Security and Application (IWISA 2009)

Qingdao, China, November 21-22, 2009

Editors: Feng Gao and Xijun Zhu

AP Catalog Number: AP-PROC-CS-09CN004

ISBN: 978-952-5726-06-0

Page(s): 248-251

High-Speed Algorithm for Modular Exponentiation over GF(2m)

Debiao He, Jianhua Chen, and Zhijin Hu

Full text: PDF


Modular exponentiation over GF(2m) has many applications in cryptography, coding theory, random numbers generation. A new algorithm for modular exponentiation over GF(2m) and its implementation is proposed. Compared with the classical square-and-multiply algorithm, the proposed algorithm is shown to calculate exponentiation in most cases with fewer modular multiplications over GF(2m) but a little pre-computation.

Index Terms

Polynomial Basis, Binary Fields, Square Root, Modular Exponentiation

Copyright @ 2009 ACADEMY PUBLISHER All rights reserved