Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 52 views

    Ellipitic Curve Cryptography

    Uploaded by

    Anonymous DpgOYVxbd
    Elliptic curve cryptography (ECC) is a public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC requires smaller keys compared to non-ECC cryptography while providing equivalent security. It uses elliptic curves and the abelian group and field algebraic structures. ECC allows implementing existing public key algorithms like Diffie-Hellman and ElGamal using elliptic curves.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Ellipitic Curve Cryptography

    Uploaded by

    Anonymous DpgOYVxbd
    52 views21 pages
    Elliptic curve cryptography (ECC) is a public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC requires smaller keys compared to non-ECC cryptography while providing equivalent security. It uses elliptic curves and the abelian group and field algebraic structures. ECC allows implementing existing public key algorithms like Diffie-Hellman and ElGamal using elliptic curves.

    Original Description:

    Powerpoint presentation on Elliptic curve cryptography

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Elliptic curve cryptography (ECC) is a public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC requires smaller keys compared to non-ECC cryptography while providing equivalent security. It uses elliptic curves and the abelian group and field algebraic structures. ECC allows implementing existing public key algorithms like Diffie-Hellman and ElGamal using elliptic curves.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    52 views21 pages

    Ellipitic Curve Cryptography

    Uploaded by

    Anonymous DpgOYVxbd
    Elliptic curve cryptography (ECC) is a public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC requires smaller keys compared to non-ECC cryptography while providing equivalent security. It uses elliptic curves and the abelian group and field algebraic structures. ECC allows implementing existing public key algorithms like Diffie-Hellman and ElGamal using elliptic curves.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 21

    ELLIPTIC CURVE

    CRYPTOGRAPHY (ECC)
    INTRODUCTION
    • In 1985, cryptography based on elliptic curves was
    proposed independently by Neal Koblitz and Victor Miller.
    • public-key cryptography.
    • Based on the algebraic structure of elliptic curves over
    finite fields.
    • ECC requires a smaller key as compared to non-ECC
    cryptography to provide equivalent security.
    • ECC is based on the theory of elliptic curves
    BASICS OF ELLIPTIC
    CURVE
    • An elliptic curve is a planar algebraic curve defined by an
    equation of the form

    ‘a’ is the co-efficient of x & ‘b’ is the constant of the equation


    Elliptic curve cryptography
    (ECC) uses 2 algebraic
    structures :
    •Abelian group
    •Field
    ABELIAN GROUP
    A group (G) is a set of elements with a binary
    operation “●” that satisfies 4 properties.
    • Closure

    • Associativity

    • Existence of identity

    • Existence of inverse

    A commutative group also called an abelian group is a group in


    which operator satisfies the four properties of group plus an extra
    property , Commutativity
    ELLIPTIC CURVE ADDITION CASES

    Point addition:
    • R based on line
    formed by P and Q.
    ELLIPTIC CURVE ADDITION CASES

    Point doubling:
    • P=Q,R based on
    tangent to curve
    ELLIPTIC CURVE ADDITION CASES

    Vertical point
    addition :
    • P=-Q, line does not
    intercept curve
    (Xp=XQ,Yp ≠ YQ)
    ELLIPTIC CURVES OVER GF(2N)

    Elements of the set in this field are n-bit words that can be
    interpreted as polynomials with coefficient in GF(2)
    Equation used is :
    ELLIPTIC CURVES OVER GF(2N)
    ADVANTAGES

    • Fast and Compact implementation in hardware.

    • Shorter keys than RSA, this short key is faster


    and requires less computing power than other
    first-generation encryption public key
    algorithms.
    DISADVANTAGES

    • One of the main disadvantages of ECC is that it


    increases the size of the encrypted message
    significantly more than RSA encryption.

    • ECC algorithm is more complex and more


    difficult to implement.
    ELLIPTIC CURVE
    CRYPTOGRAPHY
    • Elliptic curves are used as an extension
    to other current cryptosystem.
    • Generally based on using elliptic curves
    in place of exponentiation in existing
    public key algorithm.
    Example :
    • Elliptic Diffie-Helman
    • Elliptic ElGamal
    ELLIPTIC CURVE CRYPTOGRAPHY
    SIMULATING ELGAMAL
    ELLIPTIC CURVE CRYPTOGRAPHY
    SIMULATING ELGAMAL
    ELLIPTIC CURVE CRYPTOGRAPHY
    SIMULATING ELGAMAL
    ELLIPTIC CURVE CRYPTOGRAPHY
    SIMULATING ELGAMAL
    EXAMPLE
    ELLIPTIC CURVE
    DIFFIE HELLMAN
    REAL WORLD EXAMPLE

    A Microsoft Digital Rights Management Curve

    You might also like