Key Generation Using RSA

Key Generation Algorithm:

  • Generate two large random primes, p and q, such that their product is of the order 768 bits for personal use and 1024 bits for corporate use.
  • Compute n = pq where n is called as the modulus for encryption and decryption. (Modulus is the integer used to divide out by, in modular arithmetic.)
  • Compute Euler Quotient of n= (φ) phi = (p-1) (q-1).
  • Choose an integer e (this value is used for encryption), such that 1 < e < phi, which means e and (p-1)*(q-1) have only 1 as a common factor.
  • Compute the secret exponent d (this value is used for decryption), 1 < d < phi, the decryption exponent d can also be computed by solving, e.d=1 mod (φ) (n).
  • In the above calculation e, d are known as the public and private exponents.

The public key is (n, e) and the private key is (n, d). the other values used for generation of these keys (p, q, d) are kept along with private key or destroyed.

This Project Paper is written & submitted by Deepak V.

Leave a Reply

Your email address will not be published. Required fields are marked *