[obm-l] [RSA Security cryptographic challenge resolved -04/28/04]

["Paulo Santa Rita" <p_ssr@xxxxxxxxxxx>]

Ola Pessoal,

Um colega me enviou a mensagem abaixo. Pode ser do interesse de algum de
voces.



Madrid, April 28 2004 - In just over three months, a team of mathematicians
has managed to solve the latest cryptographic challenge -the RSA 576-
promoted by RSA Security.

On this occasion, the challenge involved determining the two prime numbers
used to generate the eight 'challenge' numbers, based on RSA 576-bit keys
(174 decimal digits). In solving the challenge, the team has demonstrated
that 576-bit keys are insufficient to withstand an attack launched with
sufficient resources, and longer keys are recommended. Typical keys in use
now are 1024-bit (310 decimal digits).

The international team that resolved the challenge was made up of
mathematicians and computer experts from Germany and the Netherlands and was
supported by other mathematical experts from Canada the UK and the USA. The
winners receive a prize of $10,000.

More information from RSA Security:
(http://www.rsasecurity.com/company/news/releases/pr.asp?doc_id=3520)

_________________________________________________________________
MSN Messenger: converse com os seus amigos online.  
http://messenger.msn.com.br

=========================================================================
Instruções para entrar na lista, sair da lista e usar a lista em
http://www.mat.puc-rio.br/~nicolau/olimp/obm-l.html
=========================================================================