Cryptography: Baby Step Giant Step Algorithm

preview_player
Показать описание
A quick BSGS example
Рекомендации по теме
Комментарии
Автор

This vid was good, until you started not showing the calc's and then presenting the tables in a different way than you showed prior to pausing. Just made it that much harder to follow what you were doing.

PMe-mytd
Автор

cool, but how are you calculating the negative exponent of the number. like 2^-4 mod53 = 10?

Kaptonii
Автор

why is it called baby step, giant step algorithm? What is baby about the steps in L1 and giant about the steps in L2?

mariafrancis
Автор

Would you mind making a video explaining why it always works?

tododiaissobicho
Автор

Too the point...explained well..Thanks

vipinsingh
Автор

What if a, m weren't coprimes like was in the example?

peterraafat
Автор

Ms, I am having different answers in step3, can you please clearfiy

MalekAlthubiany
Автор

it was great until step 3, then it became useless and left me trying to figure out what you were doing for an afternoon

Killernochance