Scribd
Upload
23 views12 pages

Elliptic Curve Chryptography

The document discusses Elliptic Curve Cryptography (ECC). ECC uses elliptic curves and two main mathematical operations, point addition and scalar multiplication, to generate private and public keys. ECC provides the same security as RSA but requires smaller key sizes, resulting in lower memory usage and faster computations.

Uploaded by

Abir Abir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
23 views12 pages

Elliptic Curve Chryptography

The document discusses Elliptic Curve Cryptography (ECC). ECC uses elliptic curves and two main mathematical operations, point addition and scalar multiplication, to generate private and public keys. ECC provides the same security as RSA but requires smaller key sizes, resulting in lower memory usage and faster computations.

Uploaded by

Abir Abir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Elliptic Curve

Chryptography
(ECC)
What is ECC:

Elliptic curves are mathematical structures


defined by equations of the form y2=x3+ax+b,
where a and b are constants
Quick comparation

Cryptographic Methods ECC RSA

256 3027
Memory
Usage 384 7680
Mathematical Operations:

ECC relies on two main mathematical operations: point addition and scalar
multiplication.
Point Addition: This operation involes adding two points on the elliptic curve to get a
third point
Point Addition: P+Q = -(P+Q)
scalar multiplication: multiplying a point on the elliptic curve by an integer (scalar) to obtain
another point on the curve 2P= P+P, 3P=P+2P ……….. nP+mP=(n+m)P
How do we do that?: we use a tangent, which is a Straight line that just touches the
curve at that point P reflect it and get 2P
Private and Public KEY:
Lets say that we gonna a point to itself until we get a huge number nP that has a certain coordinate its our public key and n
is our private key ; its impossible to recover a private key from a public key
0<n<=256
Private and Public KEY:
The more we add a point to itself on the eliptic curve the longer it gets and more complex it
becomes

You might also like