Scribd Logo
Upload

Welcome to Scribd!

  • 60 views

    Experiment No. 10: Write A Program To Implement RSA With Introduction by Example

    Uploaded by

    A7
    RSA (Rivest–Shamir–Adleman) is an asymmetric cryptography algorithm that uses a public key and private key. The public key is given to everyone and the private key is kept private. RSA is based on the fact that factorizing a large integer is difficult. An example is given where a client sends its public key to a server, the server encrypts data using the public key and sends it to the client, who decrypts it with the private key. The C program implements RSA by generating random prime numbers p and q to calculate the public and private keys, encrypting a sample message, and decrypting it.

    Copyright:

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

    Experiment No. 10: Write A Program To Implement RSA With Introduction by Example

    Uploaded by

    A7
    60 views4 pages
    RSA (Rivest–Shamir–Adleman) is an asymmetric cryptography algorithm that uses a public key and private key. The public key is given to everyone and the private key is kept private. RSA is based on the fact that factorizing a large integer is difficult. An example is given where a client sends its public key to a server, the server encrypts data using the public key and sends it to the client, who decrypts it with the private key. The C program implements RSA by generating random prime numbers p and q to calculate the public and private keys, encrypting a sample message, and decrypting it.

    Original Description:

    rsa algorithm

    Original Title

    Q10

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    RSA (Rivest–Shamir–Adleman) is an asymmetric cryptography algorithm that uses a public key and private key. The public key is given to everyone and the private key is kept private. RSA is based on the fact that factorizing a large integer is difficult. An example is given where a client sends its public key to a server, the server encrypts data using the public key and sends it to the client, who decrypts it with the private key. The C program implements RSA by generating random prime numbers p and q to calculate the public and private keys, encrypting a sample message, and decrypting it.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    60 views4 pages

    Experiment No. 10: Write A Program To Implement RSA With Introduction by Example

    Uploaded by

    A7
    RSA (Rivest–Shamir–Adleman) is an asymmetric cryptography algorithm that uses a public key and private key. The public key is given to everyone and the private key is kept private. RSA is based on the fact that factorizing a large integer is difficult. An example is given where a client sends its public key to a server, the server encrypts data using the public key and sends it to the client, who decrypts it with the private key. The C program implements RSA by generating random prime numbers p and q to calculate the public and private keys, encrypting a sample message, and decrypting it.

    Copyright:

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

    EXPERIMENT NO.

    10

    Write a Program to implement RSA with introduction by example.

    RSA (Rivest–Shamir–Adleman) is an algorithm used by modern computers to encrypt


    and decrypt messages.​RSA algorithm is asymmetric cryptography algorithm.
    Asymmetric actually means that it works on two different keys i.e. Public Key and
    Private Key. As the name describes that the Public Key is given to everyone and Private
    key is kept private.RSA is based on the fact that it is difficult to factorize a large integer.
    The public key consists of two numbers where one number is multiplication of two large
    prime numbers. And private key is also derived from the same two prime numbers. So if
    somebody can factorize the large number, the private key is compromised. Therefore
    encryption strength totally lies on the key size and if we double or triple the key size, the
    strength of encryption increases exponentially. RSA keys can be typically 1024 or 2048
    bits long, but experts believe that 1024 bit keys could be broken in the near future. But
    till now it seems to be an infeasible task.

    An example of asymmetric cryptography : 

    A client (for example browser) sends its public key to the server and requests for some 
    data.The server encrypts the data using client’s public key and sends the encrypted 
    data.Client receives this data and decrypts it. 

    ABHISHEK GUPTA [0802IT151004]


    // C program for RSA Algorithm  
     
    #include<stdio.h>  
    #include<math.h>  
     
    int gcd(int a, int h)  
    {  
    int temp;  
    while (1)  
    {  
    temp = a%h;  
    if (temp == 0)  
    return h;  
    a = h;  
    h = temp;  
    }  
    }  
     
    // Code to demonstrate RSA algorithm  
    int main()  
    {  
    // Two random prime numbers  
    double p = 3;  
    double q = 7;  
     
    // First part of public key:  
    double n = p*q;  
     

    ABHISHEK GUPTA [0802IT151004]


    // Finding other part of public key.  
    // e stands for encrypt  
    double e = 2;  
    double phi = (p-1)*(q-1);  
    while (e < phi)  
    {  
    // e must be co-prime to phi and  
    // smaller than phi.  
    if (gcd(e, phi)==1)  
    break;  
    else 
    e++;  
    }  
     
    // Private key (d stands for decrypt)  
    // choosing d such that it satisfies  
    // d*e = 1 + k * totient  
    int k = 2; // A constant value  
    double d = (1 + (k*phi))/e;  
     
    // Message to be encrypted  
    double msg = 20;  
     
    printf("Message data = %lf", msg);  
     
    // Encryption c = (msg ^ e) % n  
    double c = pow(msg, e);  
    c = fmod(c, n);  

    ABHISHEK GUPTA [0802IT151004]


    printf("\nEncrypted data = %lf", c);  
     
    // Decryption m = (c ^ d) % n  
    double m = pow(c, d);  
    m = fmod(m, n);  
    printf("\nOriginal Message Sent = %lf", m);  
     
    return 0;  
    }  
     
    OUTPUT :- 

    ABHISHEK GUPTA [0802IT151004]

    You might also like