Implementation of Finite Field Arithmetic Operations for Large Prime and Binary Fields Using java BigInteger class

Abstract

Many cryptographic protocols are based on the difficulty of factoring large composite integers or a related problem. Therefore, we implement the finite field arithmetic operations for large prime and binary fields by using java BigInteger class to study our research under large integers for public key cryptosystems and elliptic curve.