Ulrich Vollmer
 |
Technische Universität Darmstadt Room: S2/02 B206 Tel: 06151/16-3401 Email: uvollmer(at)cdc.informatik.tu-darmstadt.de |
PostDoc
Research
- Number Theoretic Cryptography
- Post-Quantum-Cryptography
- Algorithmic Number Theory
- Quantum Algorithms
Publications
Book
- Johannes Buchmann and Ulrich Vollmer, Binary Quadratic Forms: An Algorithmic Approach. Springer-Verlag, 2007
Articles in journals and refereed conference proceedings
BibTeX records- Johannes Buchmann, Erik Dahmen, Alexander May, and Ulrich Vollmer, Krypto 2020. KES - The Information Security Journal, 2006, no. 5, pp. 74-77.
- Johannes Buchmann, Alexander May, and Ulrich Vollmer, Perspectives for Cryptographic Long-Term Security. Communications of the ACM, 2006, vol. 49, no. 9, pp. 50-56.
- Johannes Buchmann and Ulrich Vollmer, A Terr algorithm for computations in the infrastructure of real-quadratic number fields. Journal de Théorie des Nombres de Bordeaux, 2006, vol. 18, no. 3, pp. 559-572.
- Arthur Schmidt and Ulrich Vollmer, Polynomial Time Quantum Algorithm for the Computation of the Unit Group of a Number Field. Proceedings of the 37th annual ACM Symposium on Theory of Computing (STOC 2005), ACM Press, 2005, pp. 475-480.
- Johannes Buchmann, Tsuyoshi Takagi and Ulrich Vollmer, Number Field Cryptography. In: Alf van der Poorten and Andreas Stein (eds.), High Primes and Misdemeanours: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams, 2004, vol. 41 Fields Institute Communications, Fields Institute, AMS, pp. 111-125
- Ulrich Vollmer, A note on the Hermite Basis Computation of Large Integer Matrices. In: J. Rafael Sendra (ed.), International Symposium on Symbolic and Algebraic Computation, ISSAC '03, 2003, ACM Press, pp. 255-257
- Ulrich Vollmer, An accelerated Buchmann algorithm for regulator computation in real quadratic fields. In: Claus Fieker and David R. Kohel (eds.), Algorithmic Number Theory, 5th International Symposium, ANTS-V, 2002, vol. 2369 Lecture Notes in Computer Science, Springer Verlag, pp. 148-162
- Ulrich Vollmer, Asymptotically Fast Discrete Logarithms in Quadratic Number Fields, In: Wieb Bosma (ed.), Algorithmic Number Theory, 4th International Symposium, ANTS-IV, 2000, vol. 1838 Lecture Notes in Computer Science, Springer Verlag, pp. 581-594
Thesis
- Rigorously Analyzed Algorithms for the Discrete Logarithm Problem in Quadratic Number Fields , TU Darmstadt, 2003
Participation in Research Projects
- Number Field Cryptography, funded by the German Science Foundation (DFG)
- Post Quantum Cryptography, funded by the German Science Foundation (DFG)
- Lattice methods in the analysis of code-based cryptography, funded by the Federal Office for Information Security (BSI), project manager
- Cryptography resistant against analysis with quantum machines, funded by the Federal Office for Information Security (BSI)
Teaching
- Summer semester 2007, TU Darmstadt: Seminar: Advanced Quantum Computing
- Winter semester 2006, TU Darmstadt: Course: Quantum Computing
- Summer semesters 2004, 2005 and 2006, TU Darmstadt: Seminar on Elliptic Curve Cryptography
- Winter semesters 2003 and 2004, TU Darmstadt: Teaching assistance: Introduction to Cryptography
- Winter semester 1994, EPN Quito: Course: Introduction to Cryptography
- Winter semester 2002 - Summer semester 1994, MIT: Teaching assistance: Discrete Mathematics, Linear Algebra, Calculus
