Привіт Гість ( Вхід | Реєстрація )

 
Reply to this topicStart new topic
> Hashclash, Исследование уязвимостей MD5 шифрования.
nikelong
Aug 9 2007, 21:49
Пост #1


Тера ранчер
**********

Група: Trusted Members
Повідомлень: 11 909
З нами з: 19-March 05
Користувач №: 92
Стать: Чол





Проект "Hashclash"

--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
ТОП-20 участников:

----------------------------------------------------------------------------------------------------------
Дата основания команды - 17.05.2006 Капитан - Analitik
----------------------------------------------------------------------------------------------------------


О проекте:
Исследование уязвимостей MD5 шифрования.

Ссылки по теме:

Проект завершен. Украина заняла 219-е место. Единственный учасник, капитан, Analitik занял 1027-е место в общем зачете.

Результаты:
Смутные. Погууглил, пояндексил - чего то путего найти не смог.

Здесь опубликованы найденные коллизии:
http://www.win.tue.nl/hashclash/TargetCollidingCertificates/

http://www.boinc-af.org/content/view/133/278/

http://www.dp.by/wiki/Projects/Hashclash

http://wiki.bc-team.org/index.php?title=HashClash/en


HashClash used "techniques from the attack from Wang et al., ... to find [MD5 hash] collisions which are more flexible:" these collisions will help "clarify the nature of the vulnerabilities in applications of MD5 that have been opened up by the collision finding methods of Wang et al." The MD5 encryption algorithm was first broken in August, 2004, by a Chinese research team. This project attempted to improve on their work by allowing the first blocks of two messages to be chosen at will instead of being equal. The first phase of the project, "called 'MD5 Birthdaying,' consists of finding a block with very specific properties, that will help us in later phases. Finding that block on a single Pentium4 3Ghz would take approx. 800days of 24/7 continous running." In the future the project planned to work on collision-finding for SHA-1. The project website was taken down after the project ended, but a summary of the project is available. The project generated 5,845,364 BOINC credits, found 120 collisions (including 80 useful collisions) and eliminated 8 (of 8) bitdifferences.

The project found its first collision on March 10, 2006. On July 1, 2006, the project stopped its birthday search to continue with stage 2: completing a partial collision to a full MD5 collision. On September 12, 2006, the project started using its new application for stage 2 work. It eliminated all 8 bitdifferences for stage 2 as of October 12, 2006.

The project published its MD5 collision results on October 24, 2006: Colliding X.509 Certificates for Different Identities. The project owner published his Master's Thesis, "On Collisions for MD5," based on results from the project, in July, 2008.

Це повідомлення відредагував nikelong: Aug 30 2010, 00:15
User is offlineProfile CardPM
Go to the top of the page
+Quote Post

Reply to this topicStart new topic
2 Користувачів переглядають дану тему (2 Гостей і 0 Прихованих Користувачів)
0 Користувачів:

 



- Lo-Fi Версія Поточний час: 9th June 2024 - 12:29