2008 |
24 | EE | Michael J. Jacobson Jr.,
Renate Scheidler,
Daniel Weimer:
An Adaptation of the NICE Cryptosystem to Real Quadratic Orders.
AFRICACRYPT 2008: 191-208 |
23 | | Andreas Hirt,
Michael J. Jacobson Jr.,
Carey L. Williamson:
Taxis: Scalable Strong Anonymous Communication.
MASCOTS 2008: 269-278 |
2007 |
22 | EE | Ryan Vogt,
John Aycock,
Michael J. Jacobson Jr.:
Army of Botnets.
NDSS 2007 |
21 | EE | Stefan Erickson,
Michael J. Jacobson Jr.,
Ning Shang,
Shuo Shen,
Andreas Stein:
Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation.
WAIFI 2007: 202-218 |
2006 |
20 | EE | Michael J. Jacobson Jr.,
Shantha Ramachandran,
Hugh C. Williams:
Numerical Results on Class Groups of Imaginary Quadratic Fields.
ANTS 2006: 87-101 |
19 | EE | Michael J. Jacobson Jr.,
Renate Scheidler,
Hugh C. Williams:
An Improved Real-Quadratic-Field-Based Key Exchange Procedure.
J. Cryptology 19(2): 211-239 (2006) |
18 | EE | John Aycock,
Rennie deGraaf,
Michael J. Jacobson Jr.:
Anti-disassembly using Cryptographic Hash Functions.
Journal in Computer Virology 2(1): 79-85 (2006) |
2005 |
17 | EE | Rennie deGraaf,
John Aycock,
Michael J. Jacobson Jr.:
Improved Port Knocking with Strong Authentication.
ACSAC 2005: 451-462 |
16 | EE | Andreas Hirt,
Michael J. Jacobson Jr.,
Carey L. Williamson:
A Practical Buses Protocol for Anonymous Internet Communication.
PST 2005 |
2004 |
15 | EE | Michael J. Jacobson Jr.:
The Security of Cryptosystems Based on Class Semigroups of Imaginary Quadratic Non-maximal Orders.
ACISP 2004: 149-156 |
14 | EE | Michael J. Jacobson Jr.,
Hugh C. Williams,
Kjell Wooding:
Imaginary Cyclic Quartic Fields with Large Minus Class Numbers.
ANTS 2004: 280-292 |
2003 |
13 | EE | Detlef Hühnlein,
Michael J. Jacobson Jr.,
Damian Weber:
Towards Practical Non-Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders.
Des. Codes Cryptography 30(3): 281-299 (2003) |
12 | | Michael J. Jacobson Jr.,
Hugh C. Williams:
New quadratic polynomials with high densities of prime values.
Math. Comput. 72(241): 499-519 (2003) |
11 | | Michael J. Jacobson Jr.,
Á. Pintér,
P. G. Walsh:
A computational approach for solving y2 =1k + 2k + ... + xk.
Math. Comput. 72(244): 2099-2110 (2003) |
2002 |
10 | EE | Michael J. Jacobson Jr.,
Alfred J. van der Poorten:
Computational Aspects of NUCOMP.
ANTS 2002: 120-133 |
9 | | Michael J. Jacobson Jr.,
Hugh C. Williams:
Modular Arithmetic on Elements of Small Norm in Quadratic Fields.
Des. Codes Cryptography 27(1-2): 111-117 (2002) |
2001 |
8 | EE | Mark Giesbrecht,
Michael J. Jacobson Jr.,
Arne Storjohann:
Algorithms for Large Integer Matrix Problems.
AAECC 2001: 297-307 |
2000 |
7 | EE | Detlef Hühnlein,
Michael J. Jacobson Jr.,
Damian Weber:
Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders.
Selected Areas in Cryptography 2000: 275-287 |
6 | | Michael J. Jacobson Jr.,
Neal Koblitz,
Joseph H. Silverman,
Andreas Stein,
Edlyn Teske:
Analysis of the Xedni Calculus Attack.
Des. Codes Cryptography 20(1): 1-64 (2000) |
5 | EE | Michael J. Jacobson Jr.:
Computing Discrete Logarithms in Quadratic Orders.
J. Cryptology 13(4): 473-492 (2000) |
1999 |
4 | | Michael J. Jacobson Jr.:
Applying sieving to the computation of quadratic class groups.
Math. Comput. 68(226): 859-867 (1999) |
1998 |
3 | EE | Michael J. Jacobson Jr.:
Experimental Results on Class Groups of Real Quadratic Fields.
ANTS 1998: 463-474 |
2 | EE | Detlef Hühnlein,
Michael J. Jacobson Jr.,
Sachar Paulus,
Tsuyoshi Takagi:
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption.
EUROCRYPT 1998: 294-307 |
1997 |
1 | | Johannes Buchmann,
Michael J. Jacobson Jr.,
Edlyn Teske:
On some computational problems in finite abelian groups.
Math. Comput. 66(220): 1663-1687 (1997) |