Finite Field Arithmetic Comparison over GF (p) and GF (2m)
Citation: Avitha.M.V, Vinitha.V. Article: Finite Field Arithmetic Comparison over GF (p) and GF (2m). Indian Journal of Emerging Electronics in Computer Communications 4(2):723-727, September 2017. |
Full Text Download |
Abstract:
Due to the increase in the use of internet over the shared system, cryptography plays an important role in securing the information. Secure data transfer over the internet requires public key cryptosystem where it uses a secret key during the encryption of data. The two mostly secured public key cryptosystems are RSA and ECC. The advantage which is offered by Elliptic curve cryptosystem (ECC) is more security per key bit. The finite field arithmetic over the Galois field includes modular addition, subtraction multiplication, inversion and division. This paper compares the finite arithmetic architecture (modular inversion) of GF(p) and GF(2m) and focus at the FPGA implementation.
Keywords:GF(p) and GF(2m) Arithmetic Operations, Elliptic Curve Cryptography.
References:
- B. Schneier, Applied Cryptography, second ed., Wiley, New York, 1996.
- V. S. Miller, Use of elliptic curves in cryptography, Adv. Cryptogr. Crypto’85, 1985, pages 417–426.
- N. Koblitz, Elliptic curve cryptosystems, Math. Comp. Vol. 48, 1987 pages 203–209.
- S. B. Ors, ¨ L. Batina, B. Preneel, J. Vandewalle, Hardware implementation of elliptic curve processor over GF(p), Proceedings of the Application-Specific Systems, Architectures, and Processors ASAP, 2003, pages 433-443.
- G. R. Blakley, A computer algorithm for the product AB modulo M, IEEE Transactions on Computers, Vol. 32, No. 5, pages 497–500, May 1983.
- J. López and R. Dahab, “Fast multiplication on elliptic curves over GF(2m) without precomputation,” in Proc. 1st Int. Workshop Cryptogr. Hardw.Embedded Syst., 1999, pp. 316–327.
- T. Itoh and S. Tsujii, “A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases,” Inf. Comput., vol. 78, no. 3, pp. 171–177, Sep. 1988.