Prof. Dr. Volker Müller
|
|
||||||
| Fakultät oder Zentrum | Fakultät für Naturwissenschaften, Technologie und Medizin | ||||||
| Department | Fachbereich Informatik | ||||||
| Postadresse |
Université du Luxembourg Maison du Nombre 6, Avenue de la Fonte L-4364 Esch-sur-Alzette |
||||||
| Büroadresse | MNO, E03 0335-080 | ||||||
|
|||||||
| Telefon | (+352) 46 66 44 6751 | ||||||
I am Associate Professor in the LACS research group of the Department of Computer Science at the University of Luxembourg. My main research interests are about computational number theoretic problems as the simultaneous Chinese remainder problem and the integer factorization problem, both from a theoretical and practical perspective.
In addition, I am the programme director of the "Bachelor in Applied Information Technology" and its sister programme "Bachelor in Applied Information Technology - Continuous education Programme".
I started my academic career as a student of Mathematics and Computer Science at the University of Saarland (Saarbrücken, Germany) and received a Doctorate in Computer Science from the University of Saarland in 1995. Then I became a Postdoctoral Research Fellow for Computational Number Theory and Cryptography at the Department of Combinatorics & Optimization, University of Waterloo, Canada (1995 - 1996), and a Postdoctoral Lecturer in the Computer Science Department at the University of Technology, Darmstadt, Germany (1996 - 1998). From 1998 to 2005, I worked as a Lecturer in the Bachelor Program in Computer Science Department at Duta Wacana Christian University and in the Master Program of the Department of Electrical Engineering, Gadjah Mada State University, Jogjakarta, Indonesia. I also supported a development project sponsored by the Protestant Church of Germany as Consultant for Sustainable University Development for these two Indonesian institutions. In 2004, I was chosen as scientific advisor for a "Proposal for an Indonesian Law on Electronic Signatures" in Indonesia. After moving to the University of Luxembourg in 2005, I worked, in addition to giving lectures in different bachelor programs, as responsible manager of the Service Informatique de l'Université (SIU). In this position, I was involved together with a team in the preparation and organization of the IT infrastructure of the Belval campus. After almost 12 years in this management position, I fully returned to the academic environment as associate professor in DCS in 2017.
Last updated on: Mittwoch, den 04. November 2020
2022
A Conjecture on Primes in Arithmetic Progressions and Geometric Intervals;
in American Mathematical Monthly (2022), 129(10), 979-983
2021
On the (M)iNTRU assumption in the integer case; ;
in Qiong, Huang; Yu, Yu (Eds.) Provable and Practical Security, 15th International Conference, ProvSec 2021, Guangzhou, November 5 – November 8, 2021, Proceedings (2021, November 02)
2013
Twisted Edwards-Form Elliptic Curve Cryptography for 8-bit AVR-based Sensor Nodes; ; ; ;
in Chen, Kefei; Xie, Qi; Qiu, Weidong; Xu, Shouhuai; Zhao, Yunlei (Eds.) Proceedings of the first ACM Workshop on Asia Public-Key Cryptography (ASIAPKC 2013) (2013, May)
2008
2001
Sekilas tentang Keamanan di Jaringan Komputerin Sintesis - Makalah Universitas Kristen Indonesia (2001)
2000
Efficient Point Multiplication for Elliptic Curves over Special Optimal Extension Fieldsin Proceedings of Public-Key Cryptography and Computational Number Theory Conference (2000)
1999
A Few Remarks on the Security of Internet Applicationsin Proceedings of he First International Workshop on Information Integration and Web-based Applications & Services (1999)
Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus; ;
in Mathematics of Computation (1999), 68(226), 807-822
1998
Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Twoin Journal of Cryptology (1998), 11(4), 219-234
Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2; ;
in Designs, Codes and Cryptography (1998), 14(2), 159-178
1996
A Public Key Cryptosystem based on Elliptic Curves over Z/nZ Equivalent to Factoring; ;
in Advances in Cryptology - Eurocrypt '96 (1996)
On the Reduction of Composed Relations from the Number Field Sieve;
in Proceedings of the 2nd Algorithmic Number Theory Symposium (ANTS II) (1996)
Undated
ON THE (NON-)EQUIVALENCE OF INTEGRAL BINARY QUADRATIC FORMS AND THEIR NEGATIVE FORMS;
E-print/Working paper (n.d.)
A conjecture on primes in arithmetic progressions and geometric intervals;
E-print/Working paper (n.d.)
