Tonelli–Shanks algorithm
Results: 3
# | Item |
---|---|
1 | The Tonelli-Shanks algorithm Ren´e Schoof, Roma 20 dicembre 2008 let p > 2 be prime. We describe an algorithm (due to A. Tonelli (Atti Accad. Linceiand D. Shanks (1970ies)) to compute a square root of a given sqAdd to Reading ListSource URL: www.mat.uniroma2.itLanguage: English - Date: 2009-01-31 17:59:10 |
2 | 1 Square root computation over even extension fields Gora Adj 1Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2013-07-18 17:22:53 |
3 | ON SHANKS’ ALGORITHM FOR COMPUTING THE CONTINUED FRACTION OF logb a. TERENCE JACKSON AND KEITH MATTHEWS Abstract. We give a more practical variant of Shanks’ 1954 algorithm for computing the continued fraction of logAdd to Reading ListSource URL: www.numbertheory.orgLanguage: English - Date: 2002-12-04 15:22:13 |