Computing the Number of Points of Elliptic Curves Over Finite Fields. - Johannes A. Buchmann; Volker Müller 001 (ISSAC, 1991)

Counting the number of points on elliptic curves over finite fields of characteristic greater than three. - Frank Lehmann 003; Markus Maurer; Volker Müller 001; Victor Shoup (ANTS, 1994)

Ein Algorithmus zur Bestimmung der Punktanzahl elliptischer Kurven über endlichen Körpern der Char. - Volker Müller 001 (1995)

A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring. - Bernd Meyer 002; Volker Müller 001 (EUROCRYPT, 1996)

Discrete Logarithm Based Cryptosystems in Quadratic Function Fields of Characteristic 2. - Volker Müller 001; Scott A. Vanstone; Robert J. Zuccherato (Des. Codes Cryptogr., 1998)

Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two. - Volker Müller 001 (J. Cryptol., 1998)

Computing discrete logarithms in real quadratic congruence function fields of large genus. - Volker Müller 001; Andreas Stein; Christoph Thiel (Math. Comput., 1999)

Differential Fault Attacks on Elliptic Curve Cryptosystems. - Ingrid Biehl; Bernd Meyer 002; Volker Müller 001 (CRYPTO, 2000)

Finding the Eigenvalue in Elkies' Algorithm. - Markus Maurer; Volker Müller 001 (Exp. Math., 2001)

A Short Note on Secret Sharing using Elliptic Curves. - Volker Müller 001 (SECRYPT, 2008)

Twisted edwards-form elliptic curve cryptography for 8-bit AVR-based sensor nodes. - Dalin Chu; Johann Großschädl; Zhe Liu 001; Volker Müller 001; Yang Zhang 016 (AsiaPKC@AsiaCCS, 2013)

On the (M)iNTRU Assumption in the Integer Case. - Jim Barthel; Volker Müller 001; Razvan Rosie (ProvSec, 2021)

A Conjecture on Primes in Arithmetic Progressions and Geometric Intervals. - Jim Barthel; Volker Müller 001 (Am. Math. Mon., 2022)