Asymptotically Fast Discrete Logarithms in Quadratic Number Fields
暂无分享,去创建一个
[1] Richard Mollin,et al. Number theory and applications , 1989 .
[2] C. Pomerance. Fast, Rigorous Factorization and Discrete Logarithm Algorithms , 1987 .
[3] B. David Saunders,et al. Certifying inconsistency of sparse linear systems , 1998, ISSAC '98.
[4] Martin Seysen,et al. A probabilistic factorization algorithm with quadratic forms of negative discriminant , 1987 .
[5] Christine Abel,et al. Ein Algorithmus zur Berechnung der Klassenzahl und des Regulators reellquadratischer Ordnungen , 1994 .
[6] M. Maurer,et al. Regulator approximation and fundamental unit computation for real-quadratic orders , 2000 .
[7] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[8] Henri Cohen,et al. A course in computational algebraic number theory , 1993, Graduate texts in mathematics.
[9] Johannes A. Buchmann,et al. On the Computation of Discrete Logarithms in Class Groups , 1990, CRYPTO.
[10] Arne Storjohann,et al. Diophantine linear system solving , 1999, ISSAC '99.
[11] H. Lenstra,et al. A rigorous time bound for factoring integers , 1992 .
[12] Johannes Buchmann,et al. Computing a reduced lattice basis from a generating system , 1992 .
[13] K. McCurley,et al. A rigorous subexponential algorithm for computation of class groups , 1989 .
[14] J. Buchmann. A subexponential algorithm for the determination of class groups and regulators of algebraic number fields , 1990 .
[15] E. Bach. Explicit bounds for primality testing and related problems , 1990 .