Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

A Complete Generalization of Atkin's Square Root Algorithm

Author:
Rotaru, Armand Stefan  Iftene, Sorin  


Journal:
FUNDAMENTA INFORMATICAE


Issue Date:
2013


Abstract(summary):

Atkin's algorithm [2] for computing square roots in Z(p)*, where p is a prime such that p equivalent to 5 mod 8, has been extended by Muller [15] for the case p equivalent to 9 mod 16. In this paper we extend Atkin's algorithm to the general case p equivalent to 2(s) + 1 mod 2(s+1), for any s >= 2, thus providing a complete solution for the case p equivalent to 1 mod 4. Complexity analysis and comparisons with other methods are also provided.


Page:
71---94


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads