Computing Roots in Finite Fields and groups, with a . . .

Computing Roots in Finite Fields and groups, with a . . . (1997)

Cached

Download Links

[cr.yp.to]

by Charles Lindhurst

BibTeX

@MISC{Lindhurst97computingroots,
    author = {Charles Lindhurst},
    title = {Computing Roots in Finite Fields and groups, with a . . . },
    year = {1997}
}

Bookmark

OpenURL

Abstract

Citations

2057	Handbook of Applied Cryptography - Menezes, Oorschot, et al.
1051	and complex analysis - Rudin, Real - 1966
759	A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics - Cohen - 1993
265	The Art of Computer Programming; vol. 2, Seminumerical Algorithms - Knuth - 1969
240	A Course in Probability Theory - Chung - 2001
140	An Introduction to the Theory of Numbers - Niven, Zuckerman - 1960
47	Introductory Combinatorics - Brualdi - 2010
37	Group Theory - Scott - 1987
30	On taking Roots in Finite Field - Adleman, Manders, et al.
27	Five number theoretic algorithms - Shanks - 1972
26	Algorithmic number theory. Vol. 1: efficient algorithms. Foundations of Computing Series - Bach, Shallit - 1996
22	A simple and fast probabilistic algorithm for computing square roots modulo a prime number - Peralta - 1986
18	a theory of factorization and genera - number - 1971
16	A summation formula related to the binary digits - Coquet - 1983
16	On the number of binary digits in a multiple of three - Newman
14	The Theory of Groups, An Introduction - Rotman
13	les nombres qui ont des propriétés additives et multiplicatives données - Gelfond, Sur - 1968
13	Bemerkung über die Auflösung quadratischer Congruenzen. Nachrichten der Akademie der - Tonelli
12	Public key cryptosystem using a reciprocal number with the same intractability as factoring a large number. Cryptologia - Kurosawa, Ito, et al. - 1988
12	and exponential sums of digital sums related to binomial coefficient parity - Power - 1977
8	Exponentiation using canonical recoding - Egecioglu, C, et al. - 1994
4	Discrépance des progressions arithmétiques dans la suite de Morse - Dumont - 1983
4	Low-computation blind signature schemes based on quadratic residues - Fan, Lei - 1996
4	The distribution of the sum of digits .mod p - FINE - 1965
4	Exponential sums of sum-of-digit functions - Stein - 1986
4	Square roots mod p - Turner - 1994
3	The number of 1’s in binary integers: bounds and extremal properties - McIlroy - 1974
2	High-radix and bit recoding techniques for modular exponentiation - C, c - 1991
1	On the distribution of digits in arithmetic sequences - Dekking - 1983
1	745 (group theory) class at the University of Wisconsin--Madison, Fall - Math - 1993
1	A theorem on representations of integers in the scale of r - Mirsky - 1949
1	Handbook of Estimates in the Theory of Numbers - Spearman, Williams - 1975
1	Exponential sums related to binary coefficient parity - Stein - 1980