Grim Fandango RSA Сорри, но без перевода.
Grim Fandango RSA Сорри, но без перевода.
Mathematicians From Around the World Collaborate to Solve Latest RSA Factoring Challenge
Contest provides practical gauge of current cryptographic research and encourages development of higher standards of security for organizations
Bedford, Mass, Tuesday, April 27, 2004 — RSA Laboratories, the research center of RSA Security Inc. (NASDAQ: RSAS) today announced that a team from the Scientific Computing Institute and the Pure Mathematics Institute in Germany, along with the National Research Institute for Mathematics and Computer Science in the Netherlands and several other organizations, has solved the RSA576 Factoring Challenge. The worldwide team of eight solved the challenge using approximately 100 workstations in a little more than three months, and earned a cash prize of $10,000 from RSA Security for their efforts.
Originally started in 1991 and relaunched with its current set of challenge numbers in 2001, RSA Laboratories’ Factoring Challenge was established to encourage research into computational number theory and the practical difficulty of factoring large integers. “The information received during these challenges is a valuable resource to the cryptographic community and can be helpful for organizations in choosing appropriate cryptographic measures for a desired level of security,” said Burt Kaliski, chief scientist and director at RSA Laboratories.
To solve the factoring challenge, the consortium leveraged resources from around the world, including hardware from the Experimental Mathematics Institute in Essen, Germany, from the Bundesamt fch252;r Sicherheit in der Informationstechnologie (BSI), and experts from the Number Field Sieve network of mathematicians throughout Canada, the United States and the United Kingdom. The factoring of RSA576 was completed using the general number field sieve factoring algorithm (GNFS) to gather data, find dependencies among the data and ultimately leverage those dependencies to factor the number.
“I’m very proud of all these individuals from around the world and their efforts to solve this first factoring challenge,” said Jens Franke of the Pure Mathematics Institute at Bonn University. “The collaborative efforts of everyone involved in this accomplishment are indicative of the achievements in mathematics, and cryptography on a greater scale, that can be realized and applied to protect the data of businesses around the world. We are excited to continue working on such projects that will assist in cryptographic research to build stronger algorithms in an effort to ensure the integrity of sensitive corporate information.”
RSA Laboratories sponsors a series of cryptographic challenges that allow individuals or groups to attempt to solve various encryption “puzzles” for cash prizes. The RSA576 Factoring Challenge is one of a series of factoring challenges set forth by the research arm of RSA Security to determine the difficulty of customizing algorithms for factoring and assessing the strength of larger key sizes.
RSA576 is a smallerscale example of the types of cryptographic keys that are recommended to secure Internet and wireless transactions. Typical keys are at least 1024 bits (310 decimal digits); RSA576 is 576 bits (174 decimal digits). Larger numbers are considered to provide significantly greater security. The next challenge number in the series is RSA640.
“RSA Security extends our congratulations to the team for their efforts,” said Kaliski. “This challenge demonstrates how the work of a few can have a broad impact on the development of the critical nature of cryptography. Their work reflects the kind of expertise and resources needed to factor large numbers. Such challenges are designed to track the evolution of cryptographic research and ensure businesses are protecting their intellectual property and critical data with the right levels of security.”
интересно... мож и мне податься со своими знаниями математики, глядишь помогу чем. =)))
Grim Fandango :: линк
http://www.rsasecurity.co...leases/pr.asp?doc_id=3520
