gkweb
December 5th, 2003, 04:41 PM
from RSA official website:
-{ Quote: "
The RSA algorithm works as follows: take two large primes, p and q, and compute their product n = pq; n is called the modulus. Choose a number, e, less than n and relatively prime to (p-1)(q-1), which means e and (p-1)(q-1) have no common factors except 1. Find another number d such that (ed - 1) is divisible by (p-1)(q-1). The values e and d are called the public and private exponents, respectively. The public key is the pair (n, e); the private key is (n, d). The factors p and q may be destroyed or kept with the private key.
" }-
the important point :
-{ Quote: "
It is currently difficult to obtain the private key d from the public key (n, e). However if one could factor n into p and q, then one could obtain the private key d. Thus the security of the RSA system is based on the assumption that factoring is difficult. The discovery of an easy method of factoring would "break" RSA (see Question 3.1.3 and Question 2.3.3).
" }-
the news : RSA 576 has been factored the December 3 2003, so broken.
=> http://mathworld.wolfram.com/news/2003-12-05/rsa/
RSA 2048 used in CS seems to have a gap of security and so is still safe, but i find interresting that supposed unbreakable algorithm in fact are.
So i agree with CS to use in RinjDael & Twofish 256 bits keys instead of 128, in addition the CS protocol increases by far brute force attempt so no need to worry at all :)
-{ Quote: "
The RSA algorithm works as follows: take two large primes, p and q, and compute their product n = pq; n is called the modulus. Choose a number, e, less than n and relatively prime to (p-1)(q-1), which means e and (p-1)(q-1) have no common factors except 1. Find another number d such that (ed - 1) is divisible by (p-1)(q-1). The values e and d are called the public and private exponents, respectively. The public key is the pair (n, e); the private key is (n, d). The factors p and q may be destroyed or kept with the private key.
" }-
the important point :
-{ Quote: "
It is currently difficult to obtain the private key d from the public key (n, e). However if one could factor n into p and q, then one could obtain the private key d. Thus the security of the RSA system is based on the assumption that factoring is difficult. The discovery of an easy method of factoring would "break" RSA (see Question 3.1.3 and Question 2.3.3).
" }-
the news : RSA 576 has been factored the December 3 2003, so broken.
=> http://mathworld.wolfram.com/news/2003-12-05/rsa/
RSA 2048 used in CS seems to have a gap of security and so is still safe, but i find interresting that supposed unbreakable algorithm in fact are.
So i agree with CS to use in RinjDael & Twofish 256 bits keys instead of 128, in addition the CS protocol increases by far brute force attempt so no need to worry at all :)