| 000 | 01342nam a2200121Ia 4500 | ||
|---|---|---|---|
| 008 | 231221s9999 xx 000 0 und d | ||
| 041 | _aEnglish | ||
| 100 | _aSriraksha, S. | ||
| 245 | 0 |
_aHigh speed implementation of Elliptic Curve Cryptography processor _bPurushotham, U. |
|
| 260 |
_c2018-2019 _bPES University _aBengaluru |
||
| 510 | _aCryptography is a method to render the message in an unintelligible form such that it cannot be broken by a unknown source. With the help of cryptography, the message can be encrypted and transmitted over a wired or wireless network without the threat of being interrupted. Mainlt cryptography is of three types, symmetric key cryptography, asymmetric key cryptography and hash functions. In the proposed work a asymmetric key cryptography is used which uses two keys, private key and public key. Public key is used to encrypt the data and private key is used to decrypt the data that has been transferred. The commonly known asymmetric key cryptography methods are Ron Rivest, Adi Shamir and Leonard Adleman algorithm, elliptic curve cryptography (ECC) and Elgamal cryptosystem. ECC is one of the widely used public key cryptography since it provides higher security per bit. This project focuses on ECC over prime fields (GF(p)). In this project a key size of 192 bits is used. With the | ||
| 942 | _cCD | ||
| 999 |
_c237081 _d237081 |
||