𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Primality testing with fewer random bits

✍ Scribed by René Peralta; Victor Shoup

Book ID
105142004
Publisher
Springer
Year
1993
Tongue
English
Weight
574 KB
Volume
3
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Factoring polynomials using fewer random
Factoring polynomials using fewer random bits
✍ Eric Bach; Victor Shoup 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 629 KB

Let F be a field of q = p" elements, where p is prime. We present two new probabilistic algorithms for factoring polynomials in FIX] that make particularly efficient use of random bits. They are easy to implement, and require no randomness beyond an initial seed whose length is proportional to the i

A universal statistical test for random
A universal statistical test for random bit generators
✍ Ueli M. Maurer 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 884 KB

A new statistical test for random bit generators is presented which, in contrast to presently used statistical tests, is universal in the sense that it can detect any significant deviation of a device's output statistics from the statistics of a truly random bit source when the device can be modeled

Primality Testing in Polynomial Time: Fr
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P"
✍ Martin Dietzfelbinger (auth.) 📂 Library 📅 2004 🏛 Springer 🌐 English ⚖ 2 MB

On August 6, 2002,a paper with the title “PRIMES is in P”, by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the “primality problem”hasa“deterministic algorithm” that runs in “polynomial time”. Find

Primality Testing in Polynomial Time: Fr
Primality Testing in Polynomial Time: From Randomized Algorithms to "PRIMES Is in P"
✍ Martin Dietzfelbinger (auth.) 📂 Library 📅 2004 🏛 Springer 🌐 English ⚖ 976 KB

On August 6, 2002,a paper with the title “PRIMES is in P”, by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the “primality problem”hasa“deterministic algorithm” that runs in “polynomial time”. Find