Attacking RSA with lattice reduction techniques (LLL)

  Рет қаралды 17,835

David Wong

David Wong

9 жыл бұрын

This video is an explanation of Coppersmith's attack on RSA, which was later simplified by Howgrave-Graham, and the later attack by Boneh and Durfee, simplified as well by Herrmann and May. Both use LLL, the lattice reduction algorithm of Lenstra Lenstra Lovasz.
You can find the code on github here: github.com/mimoo/RSA-and-LLL-...
You can find a survey here: github.com/mimoo/RSA-and-LLL-...
You can find my blog here: www.cryptologie.net

Пікірлер: 17
@zeroknowledge163
@zeroknowledge163 9 жыл бұрын
If you have some cryptography/number theory background, IMO really good presentations that are very clear are the best way to get an introduction to applications like this. This presentation was really good and was very clear!
@MaxJusticz
@MaxJusticz 8 жыл бұрын
Really exceptionally good video!
@KemonoFren
@KemonoFren 3 жыл бұрын
Great video!
@siddhantsaurabh6098
@siddhantsaurabh6098 8 жыл бұрын
Why isn't boneh_durfee working for N = 187 i.e. 11*17, e = 107, delta = 0.26, m = 4. d should be 3 which is less than 187*0.26. Can you tell me what's wrong. What parameters i need to tweak to get the correct d?
@hellmanh80
@hellmanh80 8 жыл бұрын
Nice video! At 4:09, why the contiguous are does not cover the full plane, since the vectors are not colinear?
@DavidWongTianyu
@DavidWongTianyu 8 жыл бұрын
yep, that's a mistake of mine! It should fill the whole plane.
@safaeel6231
@safaeel6231 8 жыл бұрын
hello i try to execut implementations of attacks on RSA through LLL reductions but i found this problem python coppersmith.py File "coppersmith.py", line 164 P. = PolynomialRing(ZmodN)#, implementation='NTL') ^ SyntaxError: invalid syntax can you help me
@DavidWongTianyu
@DavidWongTianyu 8 жыл бұрын
+Safae El Atla you need Sage to execute it! Not python
@SayoojSamuel
@SayoojSamuel 5 жыл бұрын
This code is for Sage Script. Try running coppersmith.sage after installing Sage first
@ziadchaoui5965
@ziadchaoui5965 8 жыл бұрын
Is it possible that there is small mistake in the definition of the polynomials gi,j (around minute 12). Shouldn't the index i range from 1 to m instead of 0 to m-1 ?
@DavidWongTianyu
@DavidWongTianyu 8 жыл бұрын
+Ziad Chaoui if you go til' m, you lose f(x) => you lose x_0 as a root of your polynomial
@ziadchaoui5965
@ziadchaoui5965 8 жыл бұрын
+David Wong but then how do you get the terms with N^m ? in the matrix ? ( great video btw )
@DavidWongTianyu
@DavidWongTianyu 8 жыл бұрын
+Ziad Chaoui you do not want the term N^m in your polynomials! because it is equal to 0 modulo N^m. Where did you get the impression that you needed it inside your lattice?
@ziadchaoui5965
@ziadchaoui5965 8 жыл бұрын
+David Wong Aren't the entries of the matrix on the next slide the factors of the different monomials that make up the polynomial? Or did I misunderstand something? For example where does the first entry in the matrix, "N^m" come from?
@DavidWongTianyu
@DavidWongTianyu 8 жыл бұрын
+Ziad Chaoui uggg you're right, this has been a long time. Does the missing power comes from the function f?
34C3 -  LatticeHacks
1:05:56
media.ccc.de
Рет қаралды 6 М.
LLL Algorithm
30:44
Steven Schaefer
Рет қаралды 6 М.
Always be more smart #shorts
00:32
Jin and Hattie
Рет қаралды 38 МЛН
когда повзрослела // EVA mash
00:40
EVA mash
Рет қаралды 2,8 МЛН
Lattices and Kyber PQC Presentation
1:50:25
Mojtaba Bisheh Niasar
Рет қаралды 9 М.
ACM CCS 2017 - The Return of Coppersmith's Attack: Practical Factorization [..] - Matus Nemec
28:22
Association of Computing Machinery 2017
Рет қаралды 1,5 М.
RSA-129 - Numberphile
9:40
Numberphile
Рет қаралды 513 М.
Post-Quantum Cryptography - Chris Peikert - 3/6/2022
3:05:02
caltech
Рет қаралды 11 М.
LogJam Attack - Computerphile
18:47
Computerphile
Рет қаралды 179 М.
Breaking RSA - Computerphile
14:50
Computerphile
Рет қаралды 354 М.
How Quantum Computers Break The Internet... Starting Now
24:29
Veritasium
Рет қаралды 9 МЛН
Mathematical Ideas in Lattice Based Cryptography - Jill Pipher
53:28
Institute for Advanced Study
Рет қаралды 10 М.
Always be more smart #shorts
00:32
Jin and Hattie
Рет қаралды 38 МЛН