Order computations in generic groups

Order computations in generic groups (2007)

Cached

Download Links

by Andrew V. Sutherland

Venue:	PHD THESIS MIT, SUBMITTED JUNE 2007. RESOURCES
Citations:	6 - 3 self

BibTeX

@TECHREPORT{Sutherland07ordercomputations,
    author = {Andrew V. Sutherland},
    title = {Order computations in generic groups},
    institution = {PHD THESIS MIT, SUBMITTED JUNE 2007. RESOURCES},
    year = {2007}
}

Bookmark

OpenURL

Abstract

Citations

2057	Handbook of Applied Cryptography - Menezes, Oorschot, et al. - 1997
961	A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm - ElGamal - 1985
759	A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics - Cohen - 1993
511	A Handbook of Integer Sequences - Sloane - 1973
462	Cryptographyand Data Security - Denning - 1982
268	Guide to Elliptic Curve Cryptography - Hankerson, Menezes, et al. - 2004
240	Approximate formulas for some functions of prime numbers - Rosser, Schoenfeld - 1962
231	An Introduction to the Theory - Hardy, Wright - 1978
184	Lower bounds for discrete logarithms and related problems - Shoup - 1997
181	Riemann’s hypothesis and tests for primality - Miller - 1976
175	Introduction to analytic and probabilistic number theory. Translated from the 2nd French ed - Tenenbaum - 1995
163	Probabilistic algorithm for testing primality - Rabin - 1980
138	A Survey of Fast Exponentiation Methods - Gordon - 1998
124	Parallel collision search with cryptanalytic applications - Oorschot, Wiener - 1999
76	Local expansion of vertex-transitive graphs and random generation in finite groups - Babai - 1991
61	Fast exponentiation with precomputation - Brickell, Gordon, et al. - 1992
61	Theorems of factorization and primality testing - Pollard - 1974
59	On a problem of Oppenheim concerning “Factorisatio Numerorum - Canfield, Erdős, et al. - 1983
53	A rigorous subexponential algorithm for computation of class groups - Hafner, McCurley - 1989
46	The probability of generating the symmetric group - Dixon - 1969
41	On the frequency of numbers containing prime factors of a certain relative magnitude - Dickman - 1930
40	Detecting perfect powers in essentially linear time - Bernstein - 1998
39	An Improved Monte Carlo Factorization Algorithm - Brent - 1980
37	Binary quadratic forms (Classical theory and modern computations - Buell - 1989
35	A polynomial-time theory of black-box groups - Babai, Beals - 1999
35	The Word problem - Boone - 1959
29	Elementary Methods in Number Theory - Nathanson - 2000
26	Lenstra,“Heuristics on class groups of number fields,” Number Theory - Cohen, W - 1983
23	Discrete logarithms and factoring - Bach - 1984
22	Asymptotic semismoothness probabilities - Bach, Peralta - 1996
22	Diophantische Analysis und Modulfunktionen - Heegner - 1952
22	On integers free of large prime factors - Hildebrand, Tenenbaum - 1986
22	On the evaluation of powers - Yao - 1976
21	On some computational problems in finite abelian groups, Mathematics of Computation 66 - Buchmann, Jacobson, et al. - 1997
20	A complete determination of the complex quadratic fields of class number one - Stark - 1967
18	Fast constructive recognition of a black box group isomorphic to Sn or An using Goldbach’s conjecture - Bratus, Pak
17	The probability of generating a finite simple group, Geom. Dedicata 56 - Liebeck, Shalev - 1995
17	Permutation group algorithms, Cambridge Tracts - Seress - 2003
16	Smooth numbers: computational number theory and beyond - Granville
16	Algorithms for multi-exponentiation - Möller - 2001
15	Calculating the order of an invertible matrix - Celler, Leedham-Green - 1997
15	Einige Resultate über Berechnungskomplexität - Strassen - 1976
14	On the notion of pseudo-free groups - Rivest
14	A Monte Carlo factoring algorithm with linear storage, Mathematics of Computation 43 - Schnorr, Lenstra - 1984
13	On Vectorial Addition Chains - Olivos - 1981
13	Enumerating finite groups of given order - Pyber - 1993
12	Trabb Pardo, Analysis of a simple factorization algorithm - Knuth, L - 1976
12	A space efficient algorithm for group structure computation - Teske - 1998
9	et al., GNU multiple precision arithmetic library - Granlund - 2008
8	Detecting perfect powers by factoring into coprimes - Bernstein, Lenstra, et al.