Education
·
2002: Dr.-habil.
in Cryptography and Discrete Mathematics, University of Klagenfurt, Austria
·
1996: Ph.D. in Mathematics, University of Klagenfurt, Austria
·
1994: Master's Degree (Mag. rer. nat),
University of Klagenfurt,
Austria
Certification
·
Dr. Habil. / Venia Docendi in Cryptography
and Discrete Mathematics
Positions
·
2005- present:
Assistant Professor in Mathematics, University of Wyoming
·
2003 - 2005: Research Associate, Centre
for Information Security and Cryptography Research, University
of Calgary
·
2002 - 2003: Postdoctoral Research
Fellow, Centre for Information Security and
Cryptography,
University
of Calgary (Director:
H.C. Williams)
·
1996 - 2002: University Lecturer and
Research Assistant, University of Klagenfurt
·
1995 - 1996: Research and Teaching
Assistant, University of
Klagenfurt, Austria
·
1994 - 1995: University Assistant,, University
of Klagenfurt, Austria
Selected Awards
·
2003-2006: APART (Austrian Program for Advanced
Research and Technology) Research Grant of the Austrian Academy
of Sciences
·
2000-2002: Austrian Science Fund Research Grant
·
1998-2002: Austrian Science Fund Research Grant
·
1997: Dr Manfred-Gehring-Research
Grant
·
1996-1997: Grant by the Research Committee of
the University
of Klagenfurt
·
Travel Grants: University
of Klagenfurt (A), University of
Linz (A), University of Sydney (AUS), University of Waterloo (CA), Stefan Banach International Mathematical Center (PL), University of Calgary -
iCORE, CISaC, PIMS
(CA), American Institute of Mathematics, University of Boulder at Colorado (USA),
University of Bochum (GER), University of Simon Bolivar (VL)
Research Interests
·
Cryptology
- Implementation of Algorithms and Fast Arithmetic
- Sieving Problems and Sieving Machines
- Provable Security
- Cryptology in Algebraic Number Fields
·
Computational Number Theory
- Algorithmic Number Theory
- Algebraic Number Theory
- Primality Testing and Primality
Proving
- Quadratic and Cubic Number Fields
- Cyclotomic Fields and Kummer
Extensions
- Integer Factorization
Theses and Supervision
·
Title of the Master's/Diploma Thesis: ``On the
Continued Fraction Expansion of Quadratic Irrationals and Their
Application to Integer Factorization'' (in
German),
·
Supervisor: Univ. Prof. Dr. W.B. Mueller (University of Klagenfurt)
·
Title of the Doctorate Thesis: Pseudoprimes & Primality
Testing Based on Lucas Functions,
Supervisors: Univ. Prof. Dr. W.B. Mueller (University
of Klagenfurt),
Univ.
Prof. Dr. J. Schoissengeier (University of Vienna)
Publications
(1)
On Strong Lucas Pseudoprimes. Contribution to
General Algebra 10. Johannes Heyn, 1998, pp.
237-249.
(2)
The Security of Public Key Cryptosystems Based on Integer
Factorization. Joint work with W. B.
Mueller.
Information security and privacy. Colin
Boyd, Ed Dawson (eds.), LNCS 1438, Springer, Berlin,
1998, pp. 9-23.
(3) Carmichael Numbers and Lucas
Tests. Finite Fields: theory, applications, and
algorithms. Mullin, R.C., Mullen, G.L.
(eds.), Amer. Math. Soc., Providence,
Rhode Island, 1999, pp.
193-202.
(4)
A Note on Strong Dickson Pseudoprimes. Applicable Algebra in Engineering, Communication and Computing.
Vol. 9,
No. 3, Springer, Berlin,
1998, pp. 247-264.
(5)
On the Rank of Appearance of Lucas Sequences. Applications of
Fibonacci Numbers, 8, Howard, F.
(ed.),, Kluwer Acad. Publ.,
Dordrecht,
1999, pp. 259-276.
(6) On
the Security of an RSA Based Encryption Scheme. Information
Security and Privacy. Pieprzyk, J., Safavi-Naini, R., Seberry, J.
(eds.), LNCS 1587, Springer, Berlin, 1999, pp.
135-148.
(7)
On the Combined Fermat/Lucas Probable Prime Test.
Cryptography and Coding. Walker,
M. (ed.), LNCS 1746, Springer, Berlin, 1999, pp. 222-235.
(8)
On Probable Prime Testing and the Computation of Square Roots mod n.
Algorithmic Number Theory, ANTS-IV. W. Bosma
(ed.), LNCS 1838,
Springer, Berlin,
2000, pp. 423-437.
(9)
On QF-Pseudoprimes and Second-Order Recurrence
Sequences.
Contributions to General Algebra 12.
D. Dorninger, G. Eigenthaler,
M. Goldstern, H.K. Kaiser, W. More, W.B. Mueller
(eds.), Johannes Heyn,
2000, pp. 299-310.
(10)
On the Rank of Appearance and the Number of Zeros of the Lucas Sequences over \F_q.
Finite Fields and Applications. H. Niederreiter, A. Enge (eds.), Springer, Berlin,
2001, pp. 390-408.
(11)
On the Security of a Williams Based Public
Key Encryption Scheme.
Public Key Cryptography, PKC'01. K. Kim (ed.), LNCS
1992, Springer, Berlin,
2001, pp. 1-18.
(12) A
Survey of IND-CCA Secure Public Key Encryption Schemes Relative to Factoring.
Public Key Cryptography and
Computational Number Theory. K. Alster, J. Urbanowicz, H.C. Williams (eds.), DeGruyter,
2001.
(13)
A Probable Prime Test With Very High
Confidence for n \equiv 1 mod 4.
Advances in Cryptology - ASIACRYPT'01, Colin Boyd (ed.), LNCS 2248, Springer, Berlin, 2001, pp. 87-106.
(14)
Some Remarks on Primality Testing Based on
Lucas Functions.
Number Theory for the Millennium. M. Bennett et
al., eds., A K Peters, Boston, 2002.
(15)
A Probable Prime Test With Very High Confidence
for n \equiv 3 mod 4.
J. Cryptology, Vol 16, No. 2, pp. 117-139,
2003.
(16) On
the Computation of Square Roots in Finite Fields.
Designs, Codes, and Cryptography, Vol. 31, No. 3, pp.
301-312, 2004.
(17) On
the Computation of Cube Roots Modulo p.
"High Primes and Misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie
Williams",
Fields Institute Communications Series. Volume 41, 2004.
(18)
Pseudocubes and Primality
Testing. Joint work with P. Berrizbeitia and H. C. Williams.
Proceedings Algorithmic Number Theory Symposium (ANTS 6),
Springer LNCS, 2004.
(19)
Some Remarks on Williams' Public-Key Crypto-Functions. Accepted for
publication in the Fibonacci Quarterly.
Teaching (at UW)
·
MATH 3500 (Applied Algebra)
·
MATH 5900 (Introduction to Cryptography)
|
