High-Speed Algorithm for Modular Exponentiation over GF(2m)
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.
Polynomial Basis Binary Fields Square Root Modular Exponentiation
He Debiao Chen Jianhua Hu Zhijin
School of Mathematics and Statistics, Whan University, Wuhan, China
国际会议
2009 International Workshop on Information Security and Application(2009 信息安全与应用国际研讨会)
青岛
英文
248-251
2009-11-21(万方平台首次上网日期,不代表论文的发表时间)