학술저널
AN ALGORITHM FOR MULTIPLICATIONS IN F2m
- 충청수학회
- Journal of the Chungcheong Mathematical Society
- Volume 15, No. 2
-
2002.0585 - 96 (12 pages)
- 2
An efficient algorithm for the multiplication in a binary finite filed using a normal basis representation of F2m is discussed and proposed for software implementation of elliptic curve cryptography. The algorithm is developed by using the storage scheme of sparse matrices.
1. Introduction
2. Mathematical Backgrounds
3. Multiplication over normal basis of F2m
(0)
(0)