Group of Square Roots of Unity Modulo n Year: 2009 Volume: 3 Issue: 7 506 - 514 Pages Authors: Rochdi Omami Mohamed Omami Raouf Ouni Abstract: Let n ≥ 3 be an integer and G2(n) be the subgroup of square roots of 1 in (Z/nZ)*. In this paper, we give an algorithm that computes a generating set of this subgroup. Keywords: Group modulo square roots unity.