У нас вы можете посмотреть бесплатно Cryptopals Guided Tour - 06 - Break repeating-key XOR или скачать в максимальном доступном качестве, видео которое было загружено на ютуб. Для загрузки выберите вариант из формы ниже:
Если кнопки скачивания не
загрузились
НАЖМИТЕ ЗДЕСЬ или обновите страницу
Если возникают проблемы со скачиванием видео, пожалуйста напишите в поддержку по адресу внизу
страницы.
Спасибо за использование сервиса ClipSaver.ru
This video is a re-upload of • Cryptopals Guided Tour - 06 - Break repeat... 00:00 - Intro 00:45 - High-level overview of solution algorithm 01:30 - Talking about Hamming distance and Hamming weight 03:10 - Implementing Hamming weight (first method: converting to string, counting "1"s) 03:57 - Implementing Hamming weight (second method: checking lowest bit and shifting) 05:38 - Implementing Hamming weight (third method: fancy in-place digit sum) 12:10 - Implementing Hamming weight (fourth method: using subtraction to zero each 1 bit) 15:17 - Implementing Hamming weight (fifth method: lookup table) 16:02 - Implementing Hamming distance in terms of XOR and Hamming weight 16:38 - Benchmarking Hamming weight functions 18:40 - Starting the solution script, copying in Hamming distance and weight functions 20:30 - Moving on to guessing key size 21:10 - Explaining why this method for guessing key size works (Kasiski examination) 22:35 - "That's enough talking, let's get to actually writing this thing" 24:35 - Cutting a corner by generating transpositions of blocks using slice syntax 26:00 - Cracking each transposed cipher and combining the results 27:00 - Writing the main block 29:30 - Testing the solution Further reading: https://en.wikipedia.org/wiki/Hamming_weight https://en.wikipedia.org/wiki/Hamming_dist... https://en.wikipedia.org/wiki/Hacker%27s_D... https://en.wikipedia.org/wiki/Vigen%C3%A8r... https://en.wikipedia.org/wiki/Vigen%C3%A8r... https://docs.python.org/3/reference/lexica... This video, and the rest of the Cryptopals Guided Tour, is licensed under the Creative Commons license CC BY 4.0, and may be shared with attribution to the author.