Number Theory

    

Algorithm for Finding the Nth Root of Modulo P

Authors: Takamasa Noguchi

For { p-1 = q^L*m ( ∤ q^x ∨ | q^x (x larger than L))}, it is the deterministic algorithm. The previously created calculation method was for a single prime number, but a method to calculate multiple primes has been added. The original calculation method has also been partially modified. To find the nth root, we need to factoer n into prime factors. In some case, primitive roots are needed. If you don't know these, use the Tonelli-Shanks algorithm.

Comments: 10 Pages.

Download: PDF

Submission history

[v1] 2022-05-31 20:35:31

Unique-IP document downloads: 1140 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus