Title :
Note on taking square-roots modulo N
Author :
Bach, Eric ; Huber, Klaus
Author_Institution :
Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
fDate :
3/1/1999 12:00:00 AM
Abstract :
In this article it is shown how Gauss´ (1981) famous cyclotomic sum formula can be used for extracting square-roots modulo N
Keywords :
cryptography; digital arithmetic; Gauss cyclotomic sum formula; cryptography; square-roots modulo N; Cryptography; Equations; Gaussian processes; Jacobian matrices; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
