Exploring Timing Attacks with Python

preview_player
Показать описание
Music:
🔻
🔺


(3) 📞 Contact links:

Uniq

BreakingCopyright

We're creating an awesome community ❤
Thanks for your daily support!
BKC
Рекомендации по теме
Комментарии
Автор

Usually passwords are stored hashed and the hashes are compared. Hashes change completely even if only one character is changed anywere. Another solution might be to use a counter variable, go through every letter and increment the counter variable by +1 if the current character matches and -1 or +2 or something if it doesn't, so every line is always executed without if-conditions and needs the same amount of time to be executed, no matter which character matches. In the end, simply compare the length of the stored password with the counter variable.

howtocookazombie
Автор

In your result the a character is the one that took many time it took 71xxxx but the p character took about 67xxxx can u explain it to me please i think that there is something wrong .

abdelkadergnichi
Автор

Great explanation! Keep up the good work👏

KAIx
Автор

Great script! How can I apply this to encryption techniques like Diffie-Hellman? Would I just change the library to incorporate Hex characters?

jonny-mp
Автор

How can it be approached in a practical scenario? Like a login page

aleb
Автор

how is 'p' the first letter if 'e' had the highest number?

VictorMartins