Exponentiation by squaring
Автор: dionyziz
Загружено: 2016-08-14
Просмотров: 5437
In this video, I implement the classical number theory algorithm exponentiation by squaring, which quickly calculates the quantity (b^e) mod m, the e-th power of a base b modulo some number m (also known as powmod). This algorithm is polynomial in the size of the input and has complexity O(log(e) polylog(b)).
Exponentiation by squaring has many applications. For example, it is extensively used in cryptographic algorithms such as RSA and elliptic curve cryptography.
Read more about this algorithm: https://en.wikipedia.org/wiki/Exponen...
Victor Shoup's free number theory book: http://www.shoup.net/ntb/ntb-v2.pdf
If you liked this video, please thumbs up and subscribe. This is one of my first videos. Please leave feedback about what you think I can improve and what other topics you would like to see.
I've just created a Patreon where you can buy me a cup of coffee. Thanks so much for supporting me! / dionyziz
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
![Визуализация всех возможных пифагоровых троек [3Blue1Brown]](https://ricktube.ru/thumbnail/T0GOz-Eqxl4/mqdefault.jpg)
