论文信息 - A subexponential algorithm for the determination of class groups and regulators of algebraic number fields

A subexponential algorithm for the determination of class groups and regulators of algebraic number fields

A new probabilistic algorithm for the determination of class groups and regulators of an algebraic number eld F is presented. Heuristic evidence is given which shows that the expected running time of the algorithm is exp(p log D log log D) c+o(1) where D is the absolute discriminant of F, where c 2 R >0 is an absolute constant, and where the o(1)-function depends on the degree of F.

J. Buchmann

[1] D. Shanks. Class number, a theory of factorization, and genera , 1971 .

[2] Helmut Hasse. The Class Number , 1980 .

[3] Leslie E. Trotter,et al. Hermite Normal Form Computation Using Modulo Determinant Arithmetic , 1987, Math. Oper. Res..

[4] J. Buchmann. On the computation of units and class numbers by a generalization of Lagrange's algorithm , 1987 .

[5] Martin Seysen,et al. A probabilistic factorization algorithm with quadratic forms of negative discriminant , 1987 .

[6] Michael E. Pohst,et al. A Modification of the LLL Reduction Algorithm , 1987, J. Symb. Comput..

[7] Michael Pohst,et al. Algorithmic algebraic number theory , 1989, Encyclopedia of mathematics and its applications.

[8] K. McCurley,et al. A rigorous subexponential algorithm for computation of class groups , 1989 .

[9] Johannes A. Buchmann,et al. On the Complexity and Efficiency of a New Key Exchange System , 1989, EUROCRYPT.

[10] Johannes Buchmann,et al. On the computation of the class number of an algebraic number field , 1989 .

[11] Johannes A. Buchmann,et al. A Key Exchange System Based on Real Quadratic Fields , 1989, CRYPTO.

[12] Johannes Buchmann,et al. Computing a reduced lattice basis from a generating system , 1992 .