Abstract:
Network security is a general idea to ensure
information transmission over PC and portable systems. Elliptic
curve cryptosystems are nowadays widely used in public
communication channels for network security. Their security
relies upon the complexity of clarifying the elliptic curve discrete
alogarithm issue. But, there are several general attacks in them.
Elliptic bend number juggling is actualized over complex fields to
enhance the security of elliptic curve cryptosystems. This paper
starts with the qualities of elliptic curve cryptosystems and their
security administrations. At that point we talk about limited field
number-crunching and its properties, prime field numbercrunching, twofold field math and complex number-crunching,
and elliptic bend number-crunching over prime field and parallel
field. This paper proposes how to execute the unpredictable
number of math under prime field and double field utilizing java
BigInteger class. also, we actualize elliptic bend math and elliptic
bend cryptosystems utilizing complex numbers over prime field
and double field and talk about our trials that got from the usage.
