Gerhard Dorfer, Arne Winterhof Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number Generators. [Citation Graph (0, 0)][DBLP] Appl. Algebra Eng. Commun. Comput., 2003, v:13, n:6, pp:499-508 [Journal]
Alev Topuzoglu, Arne Winterhof On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders. [Citation Graph (0, 0)][DBLP] Appl. Algebra Eng. Commun. Comput., 2005, v:16, n:4, pp:219-228 [Journal]
Arne Winterhof On the Non-Existence of (g, g\lambda-1;lambda)-Difference matrices. [Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:64, n:, pp:265-0 [Journal]
Eike Kiltz, Arne Winterhof Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:2, pp:326-336 [Journal]
Tanja Lange, Arne Winterhof Interpolation of the Discrete Logarithm in Fq by Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of Q-1. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:128, n:1, pp:193-206 [Journal]
Hassan Aly, Arne Winterhof On the k-error linear complexity over \mathbbFp of Legendre and Sidelnikov sequences. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2006, v:40, n:3, pp:369-374 [Journal]
Arne Winterhof Some Estimates for Character Sums and Applications. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2001, v:22, n:2, pp:123-131 [Journal]
Arne Winterhof Polynomial Interpolation of the Discrete Logarithm. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2002, v:25, n:1, pp:63-72 [Journal]
Hassan Aly, Arne Winterhof On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2006, v:39, n:2, pp:155-162 [Journal]
Wilfried Meidl, Arne Winterhof Lower bounds on the linear complexity of the discrete logarithm in finite fields. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2001, v:47, n:7, pp:2807-2811 [Journal]