14,421,267 members

See more:

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.

M is plain text data.

C = m^e mod n

C is received chiper text.

M = C^d mod n

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

Comments

There is no question.

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

Having a good question ?

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CodeProject,
503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada
+1 416-849-8900 x 100