Class 9: Efficient Probabilistic Primality Testing for Large Primes
In this class, we discuss the Solovay-Strassen Primality Testing Algorithm, a method for obtaining very large prime numbers. We explain the rationale behind this algorithm and its effectiveness in probabilistic primality testing.
Avishek's Talk
263 views • Jun 3, 2021
About this video
In this class we talk about the a Probabilistic Primality Testing Algorithm, namely Solovay-Strassen Primality Testing Algorithm. We explain why this algorithm is polynomial time. We demonstrate the algorithm using SageMath Code.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
263
Likes
9
Duration
01:11:34
Published
Jun 3, 2021
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.