| publication name | Network Security Using The Elliptic Curve Cryptography |
|---|---|
| Authors | Raafat A. El-Kammar, Hala H. Zayed, Ayman El-Ahwal |
| year | 2003 |
| keywords | |
| journal | The 2nd International Conference on Information and Communication Technology, ICI-2, October 7-9, 2003, Delta Academy for Science, Egypt. |
| volume | Not Available |
| issue | Not Available |
| pages | Not Available |
| publisher | Not Available |
| Local/International | International |
| Paper Link | Not Available |
| Full paper | download |
| Supplementary materials | Not Available |
Abstract
Public key cryptography is a relatively new field for engineers, and the elliptic curve is the basis for a relative new generation of public key cryptosystem, which is proposed in 1985 by Neal Koblitz and Victor Miller independently. It is predicted that elliptic curves will replace many existing public key cryptosystem in the near future, the security of the elliptic curve cryptosystem (ECC) based on the difficulty of compute the elliptic curve discrete logarithm problem, which have no the sub-exponential time algorithms for solving it, and there is a lack of specialized attacks, so that shorter key sizes for elliptic curve cryptosystem gives the same security as larger keys in other cryptosystems. Hybrid the ECC with the advanced encryption standard (AES), and the message authentication code (MAC) that produces a hybrid cryptosystem which produces messages in an authenticated. This cryptosystem produces a performance that is more efficient in time and in the memory space.