Jacobson, Michael J. (1999):
Subexponential class group computation in quadratic orders.
Aachen: Shaker, 1999. XVIII, 179 S, Aachen, Shaker, TU Darmstadt,
[Ph.D. Thesis]

Jacobson, Michael J. (1999):
Applying sieving to the computation of quadratic class groups.
In: >Mathematics of Computation, 68 (226), pp. 859-867. [Article]

Hühnlein, Detlef and Jacobson, Michael J. and Paulus, Sachar and Takagi, Tsuyoshi (1998):
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption.
In: LNCS, In: EUROCRYPT '98 - International Conference on the Theory and Application of Cryptographic Techniques, pp. 294-307,
Springer, Espoo, Finland, ISBN 3-540-64518-7,
[Conference or Workshop Item]

Buchmann, Johannes and Jacobson, Michael J. and Neis, Stefan and Theobald, Patrick and Weber, Damian (1998):
Sieving Methods for Class Group Computation.
(TI-8/98), [Report]

Jacobson, Michael J. (1997):
Applying sieving to the computation of quadratic class groups.
Darmstadt: Techn. Hochschule, FB 20, Inst. für Theoretische Informatik, 1997. 9 S, Darmstadt, Techn. Hochschule, [Book]

Jacobson, Michael J. (1997):
Applying Sieving to the Computation of Quadratic Class Groups.
(TI-19/97), [Report]

Buchmann, Johannes and Jacobson, Michael J. and Teske, Edlyn (1997):
On some computational problems in finite abelian groups.
In: >Mathematics in Computation, 66 (220), pp. 1663-1687. [Article]

Hühnlein, Detlef and Jacobson, Michael J. and Paulus, Sachar (1997):
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption.
(TI-24/97), [Report]

Buchmann, Johannes and Jacobson, Michael J. and Teske, Edlyn (1996):
On some computational problems in finite abelian groups.
(TI-2/96), [Report]