How to solve a 112-bit ECDLP using game consoles
746
35.5
Microsoft Research330 тыс
Следующее
17.08.16 – 35740:27Популярные
12.12.22 – 1 55630:07
27.10.22 – 63351:48Опубликовано 17 августа 2016, 3:37
In this presentation I will outline two projects which I have been working on during my PhD. Both projects are related to the elliptic curve discrete logarithm problem (ECDLP): the theoretical foundation of many modern cryptosystems. First I will outline how we have set a new record by solving the ECDLP over a 112-bit prime field using a cluster of PlayStation 3 game consoles in 2009. Next, the negation map optimization is discussed: this is an technique to speed up the Pollard rho method when solving the ECDLP. It is well known that the random walks used by Pollard rho when combined with the negation map get trapped in fruitless cycles. I will present that previously published approaches to deal with this problem are plagued by recurring cycles: effective alternative countermeasures are proposed.
Свежие видео
5 дней – 3 8611:56
10 дней – 5690:11
12 дней – 1591:48
15 дней – 9053:47
16 дней – 6 1040:41
17 дней – 1 8360:15Случайные видео
21 день – 10 9661:00
21 день – 5 4660:16
114 дней – 3 33031:23
137 дней – 1 1491:32
27.11.22 – 4 163 0070:38
21.08.18 – 340 9352:43
2 дня – 79 36524:01
2 дня – 580:47
3 дня – 4203:31
4 дня – 1370:44
7 дней – 80 95814:12
