Abstract

Assuming the extended Riemann hypothesis (ERH), G. Miller produced in a very interesting paper [1], an algorithm which tests primality and runs in O((log n) 4+ε ) steps. We provide a short proof of this result.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call