Ph.D. in Mathematics, Munich University, 1996
Finite fields: Efficient arithmetic, compact representations, Groebner basis computations.
Curve based cryptography: Elliptic and hyperelliptic curves, efficient arithmetic, pairings, discrete logarithm problem.
Cryptographic protocols: Side channel analysis, private biometrics, secure multi-party computation.
M. Kaniecki, J. Kosakowska and M. Schmidmeier, Operations on arc diagrams and degenerations for invariant subspaces of linear operators. Part II, manuscript (2016), 29pp, arXiv.
J. Kosakowska and M. Schmidmeier Finite direct sums of cyclic embeddings and an application to invariant subspace varieties, manuscript, 26pp (2016), arXiv.
J. Kosakowska, M. Schmidmeier, and H. R. Thomas, Two Partial Orders for Littlewood-Richardson Tableaux, manuscript, 18pp (2015), arXiv.
A. Moore and M. Schmidmeier, The Swiss Cheese Theorem for Linear Operators with Two Invariant Subspaces, Proc. Amer. Math. Soc. 143, 5097-5111, (2015), arXiv.
J. Kosakowska and M. Schmidmeier, The Boundary of the Irreducible Components for Invariant Subspace Varieties, manuscript, 35 pp (2014), arXiv.
Guest Professor at Nicolaus Copernicus University, Toruń: May 2015
Visiting the Collaborative Research Center, Bielefeld: May-June 2016
Symposion on Enumerative Combinatorics, Boca Raton, April 4, 2014
Full list of publications: http://brain.math.fau.edu/Schmidme/publications.html
Full website: http://brain.math.fau.edu/Schmidme/index.html