A Complete Generalization of Atkin's Square Root Algorithm
نویسندگان
چکیده
Atkin’s algorithm [2] for computing square roots in Z∗ p , where p is a prime such that p ≡ 5mod 8, has been extended by Müller [15] for the case p ≡ 9mod 16. In this paper we extend Atkin’s algorithm to the general case p ≡ 2+1mod 2, for any s ≥ 2, thus providing a complete solution for the case p ≡ 1 mod 4. Complexity analysis and comparisons with other methods are also provided.
منابع مشابه
Square-Root Finding Problem In Graphs, A Complete Dichotomy Theorem
Graph G is the square of graph H if two vertices x, y have an edge in G if and only if x, y are of distance at most two in H. Given H it is easy to compute its square H. Determining if a given graph G is the square of some graph is not easy in general. Motwani and Sudan [11] proved that it is NP-complete to determine if a given graph G is the square of some graph. The graph introduced in their ...
متن کاملNew Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field
We present a new cube root algorithm in finite field Fq with q a power of prime, which extends Cipolla-Lehmer type algorithms and has lower complexity than Tonelli-Shanks type algorithms. Efficient computation of r-th root in Fq has many applications in computational number theory and many other related areas. There are two standard algorithms for computing rth root in finite field. One is Adle...
متن کاملModeling of measurement error in refractive index determination of fuel cell using neural network and genetic algorithm
Abstract: In this paper, a method for determination of refractive index in membrane of fuel cell on basis of three-longitudinal-mode laser heterodyne interferometer is presented. The optical path difference between the target and reference paths is fixed and phase shift is then calculated in terms of refractive index shift. The measurement accuracy of this system is limited by nonlinearity erro...
متن کاملOn the Generalization of the Floor of the Square Root Sequence
The floor of the square root sequence is the natural sequence, where each number is repeated 2n+1 times. In this paper, we use analytic method to study the mean value properties of its generalization, and give an interesting asymptotic formula.
متن کاملEfficient Substructure RMSD Query Algorithms
Protein structure analysis is a very important research topic in the molecular biology of the post-genomic era. The root mean square deviation (RMSD) is the most frequently used measure for comparing two protein three-dimensional (3-D) structures. In this paper, we deal with two fundamental problems related to the RMSD. We first deal with a problem called the "range RMSD query" problem. Given a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 125 شماره
صفحات -
تاریخ انتشار 2013