Abstract
In this paper, we propose an efficient inversion algorithm for optimal normal bases type II. The efficiency of the arithmetic algorithms depends on the basis and many foregoing papers use either polynomial or optimal normal basis. An inversion algorithm based on reduced multiplication for optimal normal basis is studied. The combination of optimal normal basis and shifted form of the canonical basis is also employed. It is shown that the suggested inversion algorithm reduces the computation time to 45 ∼ 60 % of the simple algorithm. The algorithm is very effective in composite numbers in which have optimal normal basis type II.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Lidl and H. Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, Cambridge, 1986
R. C. Mullin, I. M. Onyszchuk and S. A. Vanstone, “Optimal normal bases in GF (pn)*,” Discrete Applied Mathematics, 22, 149–161, 1988
T. Itoh and S. Tsujii, “A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases,” 78, 171–177, 1988
J. Juajardo and C. Paar, “Itoh-Tsujii inversion in standard basis and its application in cryptography and codes,” 25, 207–216, 2002
R. Schroeppel, H. Orman, S. O. Malley and O. Spatscheck, “Fast key exchange with elliptic curve systems,” CRYPTO’ 95, LNCS 963, 43–56, 1995
E. De Win, A. Bosselaers, S. Vandenberghe, P. D. Gersem and J. Vanderwalle, “A fast software implementation for arithmetic operations in GF(2k),” ASIACRYPT’ 96, LNCS 1233, 65–76, 1996
C. K. Koç and T. Acar, “Montgomery multiplication in GF(2k),” Design, Codes and Cryptography, 14,1, 57–69, 1998
B. Sunar and C. K. Koç, “An efficient optimal normal basis type II multiplier,” IEEE Trans. on Computers, 50,1, 83–87, 2001
D. V. Bailey and C. Paar, “Optimal extension fields for fast arithmetic in public-key algorithms,” CRYPTO’ 98, LNCS 1462, 472–485, 1998
M. Rosing, Implementing elliptic curve cryptography, Manning Publ. Co., Greenwich, CT, 1999
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoo, H.S., Kim, E.S. (2003). Efficient Inversion Algorithm for Optimal Normal Bases Type II. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44839-X_36
Download citation
DOI: https://doi.org/10.1007/3-540-44839-X_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40155-1
Online ISBN: 978-3-540-44839-6
eBook Packages: Springer Book Archive