Group of Square Roots of Unity Modulo n
作者： Rochdi Omami , Mohamed Omami , Raouf Ouni
DOI:
关键词:
摘要: Let n ≥ 3 be an integer and G2(n) the subgroup of square roots 1 in (Z/nZ)∗. In this paper, we give algorithm that computes a generating set subgroup. Keywords—Group, modulo, roots, unity.
参考文章(7)
Victor Shoup, A Computational Introduction to Number Theory and Algebra ,(2005)
Henri Cohen, A Course in Computational Algebraic Number Theory ,(1993)
Jean Pierre Serre, A Course in Arithmetic ,(1973)
E. Bach, K. Huber, Note on taking square-roots modulo N IEEE Transactions on Information Theory. ,vol. 45, pp. 807- 809 ,(1999) , 10.1109/18.749034
David M. Bressoud, Factorization and Primality Testing ,(1989)
E. Bach, A note on square roots in finite fields IEEE Transactions on Information Theory. ,vol. 36, pp. 1494- 1498 ,(1990) , 10.1109/18.59955
L. J. Mordell, G. H. Hardy, E. M. Wright, An Introduction to the Theory of Numbers The Mathematical Gazette. ,vol. 23, pp. 174- ,(1939) , 10.2307/3607021