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

Welcome to Scribd!

  • 19 views

    Elliptical Curve

    Uploaded by

    MAHIMA BAID
    Elliptic curve cryptography (ECC) is a public key encryption technique that generates cryptographic keys through properties of elliptic curve equations rather than through large prime numbers. ECC provides equivalent security to other systems but with smaller key sizes, making it more efficient for applications like mobile devices. ECC was first proposed in 1985 and has since been adopted by many technology manufacturers in their security products.

    Copyright:

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

    Elliptical Curve

    Uploaded by

    MAHIMA BAID
    19 views3 pages
    Elliptic curve cryptography (ECC) is a public key encryption technique that generates cryptographic keys through properties of elliptic curve equations rather than through large prime numbers. ECC provides equivalent security to other systems but with smaller key sizes, making it more efficient for applications like mobile devices. ECC was first proposed in 1985 and has since been adopted by many technology manufacturers in their security products.

    Original Title

    Elliptical curve

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, 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 encryption technique that generates cryptographic keys through properties of elliptic curve equations rather than through large prime numbers. ECC provides equivalent security to other systems but with smaller key sizes, making it more efficient for applications like mobile devices. ECC was first proposed in 1985 and has since been adopted by many technology manufacturers in their security products.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    19 views3 pages

    Elliptical Curve

    Uploaded by

    MAHIMA BAID
    Elliptic curve cryptography (ECC) is a public key encryption technique that generates cryptographic keys through properties of elliptic curve equations rather than through large prime numbers. ECC provides equivalent security to other systems but with smaller key sizes, making it more efficient for applications like mobile devices. ECC was first proposed in 1985 and has since been adopted by many technology manufacturers in their security products.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    ELLIPTIC CURVE CRYTOGRAPHY

    1.Elliptical curve cryptography (ECC) is a public key encryption technique based


    on elliptic curve theory that can be used to create faster, smaller, and more efficient
    cryptographic keys.

    2. ECC generates keys through the properties of the elliptic curve equation instead of
    the traditional method of generation as the product of very large prime numbers.

    3.The technology can be used in conjunction with most public key encryption methods,
    such as RSA, and Diffie-Hellman.

    4. According to some researchers, ECC can yield a level of security with a 164-bit key
    that other systems require a 1,024-bit key to achieve. Because ECC helps to establish
    equivalent security with lower computing power and battery resource usage, it is
    becoming widely used for mobile applications. ECC was developed by Certicom, a
    mobile e-business security provider, and was recently licensed by Hifn, a manufacturer
    of integrated circuitry (IC) and network security products. RSA has been developing its
    own version of ECC. Many manufacturers, including 3COM, Cylink, Motorola, Pitney
    Bowes, Siemens, TRW, and VeriFone have included support for ECC in their products.

    5. Their use within cryptography was first proposed in 1985, (separately) by Neal Koblitz
    from the University of Washington, and Victor Miller at IBM. 

    7. ECC is based on properties of a particular type of equation created from the


    mathematical group (a set of values for which operations can be performed on any two
    members of the group to produce a third member) derived from points where the line
    intersects the axes.

    8.  Multiplying a point on the curve by a number will produce another point on the curve,
    but it is very difficult to find what number was used, even if you know the original point
    and the result. Equations based on elliptic curves have a characteristic that is very
    valuable for cryptography purposes: they are relatively easy to perform, and extremely
    difficult to reverse.

    I assume that those who are going through this article will have a basic understanding
    of cryptography ( terms like encryption and decryption ) .
    The equation of an elliptic curve is given as,

    Few terms that will be used,

    E -> Elliptic Curve


    P -> Point on the curve
    n -> Maximum limit ( This should be a prime number )

    Key generation is an important part where we have to generate both public key and
    private key. The sender will be encrypting the message with receiver’s public key and the
    receiver will decrypt its private key.

    Now, we have to select a number ‘d’ within the range of ‘n’.


    Using the following equation we can generate the public key

    Q=d*P
    d = The random number that we have selected within the range of ( 1 to n-1 ). Pis the
    point on the curve.
    ‘Q’ is the public key and ‘d’ is the private key.

    Encryption
    Let ‘m’ be the message that we are sending. We have to represent this message on the
    curve. This have in-depth implementation details. All the advance research on ECC is
    done by a company called certicom.
    Conside ‘m’ has the point ‘M’ on the curve ‘E’. Randomly select ‘k’ from [1 – (n-1)].
    Two cipher texts will be generated let it be C1 and C2.
    C1 = k*P
    C2 = M + k*Q
    C1 and C2 will be send.

    We have to get back the message ‘m’ that was send to us,

    M = C2 – d * C1
    M is the original message that we have send.

    Proof
    How does we get back the message,

    M = C2 – d * C1

    ‘M’ can be represented as ‘C2 – d * C1′

    C2 – d * C1 = (M + k * Q) – d * ( k * P )          ( C2 = M + k * Q and C1 = k * P )

    =  M + k  * d * P – d * k *P          ( canceling out k * d * P )

    = M  ( Original Message )

    You might also like