1024-bit RSA cryptography

See more:

C#

cryptography

RSA

RSA algorithm:
1. Select two different prime numbers p and q. For security aim, the integer's p and q must be large.
2. Calculate n = p * q
n will be used as the module for public key and private key and n is also known as key_component.
3. Calculate f(n) = (q-1)(p-1), where f is a function of Euler's
4. Select an integer e such that 1<e><f(n)>e and f(n) are co prime.
5. Determine d:
d is multiplicative inverse of e mod (f(n)) (e * d) mod f(n) = 1, d is a private key.

Encryption:
M is plain text data.
C = m^e mod n

Decryption:
C is received chiper text.
M = C^d mod n

Ask: whether for rsa 1024-bit also using algorithm as above ?