14,421,267 members
Rate this:
See more:
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:
M = C^d mod n

Ask: whether for rsa 1024-bit also using algorithm as above ?
Posted
Updated 11-Apr-16 8:25am
v2
phil.o 11-Apr-16 7:53am

There is no question.
Toni Andika 11-Apr-16 8:00am

Ask: whether for rsa 1024-bit also using algorithm as above ?
Patrice T 11-Apr-16 11:36am

Having a good question ?

Rate this:

## Solution 1

RSA[^] is RSA, not matter what bit size you choose...But it is better to use larger, probably the largest available (4096 today with public libraries), and in any case not less than 2048 (1024 bit was proved as breakable in 2003)...