-
Improving Network Security Using Elliptic Curve Cryptosystem
-
-
-
6. Alice and Bob now share a secret (the number 2).
Both Alice and Bob have arrived at the same value s, because, under mod p,
Diffie–Hellman key agreement is not limited to negotiating a key shared by only two participants. Any number of users can take part in an agreement by performing iterations of the agreement protocol and exchanging intermediate data (which does not itself need to be kept secret). For example, Alice, Bob, and Carol could participate in a Diffie–Hellman agreement as follows, with all operations taken to be modulo p:
-
-
-
ABSRACT - [ Total Page(s): 1 ]ABSTRACTSecuring a network wired or wireless for network administrator has been a big challenges for network administrators in the present day of Internet usage. This project presents ECDSA Cryptosystem as a solution to the problem been faced by network administrators and Engineers. The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA) with the attractiveness that there is no sub exponential algorithm known to solve the ell ... Continue reading---
-
ABSRACT - [ Total Page(s): 1 ]ABSTRACTSecuring a network wired or wireless for network administrator has been a big challenges for network administrators in the present day of Internet usage. This project presents ECDSA Cryptosystem as a solution to the problem been faced by network administrators and Engineers. The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA) with the attractiveness that there is no sub exponential algorithm known to solve the ell ... Continue reading---