1 / 32

Elliptic Curve Cryptography

Elliptic Curve Cryptography. Outline. Introduction to elliptic curves Elliptic curve Diffie-Hellman key agreement Elliptic curve Digital Signature Algorithm. Q=(x,-y). How do elliptic curve cryptosystems compare with other cryptosystems?.

dance
Télécharger la présentation

Elliptic Curve Cryptography

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Elliptic Curve Cryptography

  2. Outline • Introduction to elliptic curves • Elliptic curve Diffie-Hellman key agreement • Elliptic curve Digital Signature Algorithm

  3. Q=(x,-y)

  4. How do elliptic curve cryptosystemscompare with other cryptosystems? • Roughly speaking, elliptic curve cryptosystems with a 160-bit key offer about the same security as RSA and discrete logarithm based systems with a 1024-bit key. As a result, the length of the public key and private key is much shorter in elliptic curve cryptosystems. • Elliptic curve cryptosystems are faster than the RSA system in signing and decryption, but slower in signature verification and encryption. • Reference: http://www.rsa.com/rsalabs/node.asp?id=2245

More Related