Attacking RSA with lattice reduction techniques (LLL)

  Рет қаралды 18,630

David Wong

David Wong

Күн бұрын

Пікірлер: 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!
@hellmanh80
@hellmanh80 8 жыл бұрын
Nice video! At 4:09, why the contiguous are does not cover the full plane, since the vectors are not colinear?
@cryptodavidw
@cryptodavidw 8 жыл бұрын
yep, that's a mistake of mine! It should fill the whole plane.
@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?
@KemonoFren
@KemonoFren 3 жыл бұрын
Great video!
@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
@cryptodavidw
@cryptodavidw 8 жыл бұрын
+Safae El Atla you need Sage to execute it! Not python
@SayoojSamuel
@SayoojSamuel 6 жыл бұрын
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 ?
@cryptodavidw
@cryptodavidw 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 )
@cryptodavidw
@cryptodavidw 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?
@cryptodavidw
@cryptodavidw 8 жыл бұрын
+Ziad Chaoui uggg you're right, this has been a long time. Does the missing power comes from the function f?
LLL Algorithm
30:44
Steven Schaefer
Рет қаралды 7 М.
Миллионер | 2 - серия
16:04
Million Show
Рет қаралды 1,9 МЛН
Will A Basketball Boat Hold My Weight?
00:30
MrBeast
Рет қаралды 141 МЛН
黑的奸计得逞 #古风
00:24
Black and white double fury
Рет қаралды 30 МЛН
Smart Sigma Kid #funny #sigma
00:14
CRAZY GREAPA
Рет қаралды 97 МЛН
Breaking RSA - Computerphile
14:50
Computerphile
Рет қаралды 364 М.
Bleichenbacher Attack on RSA PKCS #1 v1.5 For Encryption
36:50
David Wong
Рет қаралды 11 М.
Terence Tao at IMO 2024: AI and Mathematics
57:24
AIMO Prize
Рет қаралды 577 М.
Cracking Enigma in 2021 - Computerphile
21:20
Computerphile
Рет қаралды 2,5 МЛН
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 М.
Public Key Cryptography: RSA Encryption Algorithm
16:31
Art of the Problem
Рет қаралды 937 М.
LogJam Attack - Computerphile
18:47
Computerphile
Рет қаралды 182 М.
Short vector problems and simultaneous approximation
15:38
Миллионер | 2 - серия
16:04
Million Show
Рет қаралды 1,9 МЛН