Order computations in generic groups (2007)

by Andrew V. Sutherland
Venue:PHD THESIS MIT, SUBMITTED JUNE 2007. RESOURCES
Citations:9 - 3 self

Documents Related by Co-Citation

918 A Course in Computational Algebraic Number Theory, Graduate Texts – H Cohen - 1993
16 A space efficient algorithm for group structure computation – Edlyn Teske - 1998
62 A rigorous subexponential algorithm for computation of class groups – J L Hafner, K S McCurley - 1989
66 Explicit bounds for primality testing and related problems – E Bach - 1990
11 Computing the structure of a finite abelian group – Johannes Buchmann, Arthur Schmidt
2453 Handbook of Applied Cryptography – Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest - 1997
230 Monte Carlo Methods for Index Computation (mod p – J M Pollard - 1978
301 An improved algorithm for computing logarithms over GF (p) and its cryptographic significance – G C Pohlig, M E Hellman - 1978
18 An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields – K Matsuo, J Chao, S Tsuji - 2002
158 Computing in the Jacobian of an hyperelliptic curve – D G Cantor - 1987
2 e Art of Computer Programming, Volume IV, Fascicle 2: Generating all Tuples and Permutations – Donald E Knuth - 2005
4 a theory of factorization and genera, Analytic Number Theory – D Shanks, Class number - 1971
23 On some computational problems in finite abelian groups – Johannes Buchmann, Michael J. Jacobson, Edlyn Teske - 1997
18 Calculating the Order of an Invertible Matrix – Frank Celler, C. R. Leedham-Green - 1997
16 Binary Quadratic Forms: An Algorithmic Approach – J Buchmann, U Vollmer - 2007
15 Computing the endomorphism ring of an ordinary elliptic curve over a finite field – Gaetan Bisson, Andrew, V. Sutherland
11 et al. GNU Multiple Precision Arithmetic Library. URL: http: //gmplib.org – T Granlund
233 Factoring integers with elliptic curves – H W Lenstra - 1987
107 Handbook of elliptic and hyperelliptic curve cryptography – H Cohen, G Frey - 2005