M. Seysen. A probablistic factorization algorithm with quadratic forms of negative discriminant. Math. Comp., 48:757780, 1987. 14  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Asymptotically Fast Discrete Logarithms in Quadratic Number Fields - Vollmer (2000) (4 citations) (Correct)
....ffl=2, where the error probability for the total algorithm ffl is given in advance. To this end we follow the procedure of [HM89] we compute random form classes, and try to factor their reduced representatives over our factor base F . In order to generate the rst n relations we start as in [Sey87] with large factors f 2nd , where f runs through E , multiply each with random forms from (the image under OE of) a box in ZZ G[ff;gg of radius n 2 d until we nd a multiple 3 Vollmer DL in class groups Algorithm 2: Generation of relations Input: form f , exponent u, set of generators H, ....
M. Seysen. A probablistic factorization algorithm with quadratic forms of negative discriminant. Math. Comp., 48:757780, 1987. 14
Asymptotically Fast Discrete Logarithms in Quadratic Number Fields - Vollmer (2000) (4 citations) (Correct)
No context found.
M. Seysen. A probablistic factorization algorithm with quadratic forms of negative discriminant. Math. Comp., 48:757780, 1987. 14
An accelerated Buchmann algorithm for regulator computation in.. - Vollmer (Correct)
No context found.
Martin Seysen. A probablistic factorization algorithm with quadratic forms of negative discriminant. Mathematics of Computation, 48:757--780, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC