Miller-Rabin primality test
Автор: dionyziz
Загружено: 2016-08-18
Просмотров: 5586
The Miller-Rabin primality test: https://en.wikipedia.org/wiki/Miller%...
A python implementation of the probabilistic Miller-Rabin primality test. This test runs in polynomial time O(k polylog(p)) and has a negligible probability of failure 4^(-k), making it suitable for cryptographic applications.
This video builds up from Fermat's primality test. Watch my previous video where I explain it: • Fermat's primality test
Euclid's lemma: https://en.wikipedia.org/wiki/Euclid%...
Fermat's little theorem: https://en.wikipedia.org/wiki/Fermat%...
Soup's number theory book: http://www.shoup.net/ntb/ntb-v2.pdf
If you enjoyed this video, please 👍 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
-
Информация по загрузке:
![Проблема числа 10958 [Numberphile]](https://ricktube.ru/thumbnail/T9TqbJNkcP0/mqdefault.jpg)
