| 2007 |
|---|
| 38 | EE | Harald Niederreiter,
Arne Winterhof:
On the Structure of Inversive Pseudorandom Number Generators.
AAECC 2007: 208-216 |
| 37 | EE | Igor Shparlinski,
Arne Winterhof:
Quantum period reconstruction of approximate sequences.
Inf. Process. Lett. 103(6): 211-215 (2007) |
| 2006 |
|---|
| 36 | EE | Florina Piroi,
Arne Winterhof:
Quantum Period Reconstruction of Binary Sequences.
AAECC 2006: 60-67 |
| 35 | EE | Igor Shparlinski,
Arne Winterhof:
Constructions of Approximately Mutually Unbiased Bases.
LATIN 2006: 793-799 |
| 34 | EE | Igor Shparlinski,
Arne Winterhof:
On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences.
SETA 2006: 295-303 |
| 33 | EE | Igor Shparlinski,
Arne Winterhof:
On the nonlinearity of linear recurrence sequences.
Appl. Math. Lett. 19(4): 340-344 (2006) |
| 32 | EE | Wilfried Meidl,
Arne Winterhof:
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences.
Des. Codes Cryptography 38(2): 159-178 (2006) |
| 31 | EE | Hassan Aly,
Arne Winterhof:
On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials.
Des. Codes Cryptography 39(2): 155-162 (2006) |
| 30 | EE | Hassan Aly,
Arne Winterhof:
On the k-error linear complexity over \mathbbFp of Legendre and Sidelnikov sequences.
Des. Codes Cryptography 40(3): 369-374 (2006) |
| 29 | EE | Eike Kiltz,
Arne Winterhof:
Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem.
Discrete Applied Mathematics 154(2): 326-336 (2006) |
| 28 | EE | Moubariz Z. Garaev,
Florian Luca,
Igor Shparlinski,
Arne Winterhof:
On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences.
IEEE Transactions on Information Theory 52(7): 3299-3304 (2006) |
| 2005 |
|---|
| 27 | EE | Nina Brandstätter,
Tanja Lange,
Arne Winterhof:
On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two.
WCC 2005: 135-143 |
| 26 | EE | Clemens Adelmann,
Arne Winterhof:
Interpolation of Functions Related to the Integer Factoring Problem.
WCC 2005: 144-154 |
| 25 | EE | Alev Topuzoglu,
Arne Winterhof:
On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders.
Appl. Algebra Eng. Commun. Comput. 16(4): 219-228 (2005) |
| 24 | EE | Igor Shparlinski,
Arne Winterhof:
Noisy interpolation of sparse polynomials in finite fields.
Appl. Algebra Eng. Commun. Comput. 16(5): 307-317 (2005) |
| 23 | EE | Harald Niederreiter,
Arne Winterhof:
Cyclotomic R-orthomorphisms of finite fields.
Discrete Mathematics 295(1-3): 161-171 (2005) |
| 22 | EE | N. Brandstatter,
Arne Winterhof:
Some notes on the two-prime generator of order 2.
IEEE Transactions on Information Theory 51(10): 3654-3657 (2005) |
| 21 | EE | Igor Shparlinski,
Arne Winterhof:
On the linear complexity of bounded integer sequences over different moduli.
Inf. Process. Lett. 96(5): 175-177 (2005) |
| 20 | EE | Wilfried Meidl,
Arne Winterhof:
On the joint linear complexity profile of explicit inversive multisequences.
J. Complexity 21(3): 324-336 (2005) |
| 2004 |
|---|
| 19 | EE | Igor Shparlinski,
Arne Winterhof:
A Nonuniform Algorithm for the Hidden Number Problem in Subgroups.
Public Key Cryptography 2004: 416-424 |
| 18 | EE | Harald Niederreiter,
Arne Winterhof:
On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers.
SETA 2004: 266-274 |
| 17 | EE | Wilfried Meidl,
Arne Winterhof:
On the linear complexity profile of some new explicit inversive pseudorandom numbers.
J. Complexity 20(2-3): 350-355 (2004) |
| 2003 |
|---|
| 16 | EE | Tanja Lange,
Arne Winterhof:
Interpolation of the Elliptic Curve Diffie-Hellman Mapping.
AAECC 2003: 51-60 |
| 15 | EE | Wilfried Meidl,
Arne Winterhof:
On the Autocorrelation of Cyclotomic Generators.
International Conference on Finite Fields and Applications 2003: 1-11 |
| 14 | EE | Gerhard Dorfer,
Arne Winterhof:
Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number Generators.
Appl. Algebra Eng. Commun. Comput. 13(6): 499-508 (2003) |
| 13 | EE | 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.
Discrete Applied Mathematics 128(1): 193-206 (2003) |
| 12 | | Jaime Gutierrez,
Igor Shparlinski,
Arne Winterhof:
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators.
IEEE Transactions on Information Theory 49(1): 60-64 (2003) |
| 11 | EE | Wilfried Meidl,
Arne Winterhof:
On the linear complexity profile of explicit nonlinear pseudorandom numbers.
Inf. Process. Lett. 85(1): 13-18 (2003) |
| 2002 |
|---|
| 10 | EE | Tanja Lange,
Arne Winterhof:
Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm.
COCOON 2002: 137-143 |
| 9 | EE | Wilfried Meidl,
Arne Winterhof:
A Polynomial Representation of the Diffie-Hellman Mapping.
Appl. Algebra Eng. Commun. Comput. 13(4): 313-318 (2002) |
| 8 | EE | Harald Niederreiter,
Arne Winterhof:
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers.
Appl. Algebra Eng. Commun. Comput. 13(4): 319-326 (2002) |
| 7 | | Arne Winterhof:
On the Non-Existence of (g, g\lambda-1;lambda)-Difference matrices.
Ars Comb. 64: 265- (2002) |
| 6 | EE | Bruno Codenotti,
Igor Shparlinski,
Arne Winterhof:
On the hardness of approximating the permanent of structured matrices.
Computational Complexity 11(3-4): 158-170 (2002) |
| 5 | | Arne Winterhof:
Polynomial Interpolation of the Discrete Logarithm.
Des. Codes Cryptography 25(1): 63-72 (2002) |
| 2001 |
|---|
| 4 | EE | Harald Niederreiter,
Arne Winterhof:
On the Lattice Structure of Pseudorandom Numbers Generated over Arbitrary Finite Fields.
Appl. Algebra Eng. Commun. Comput. 12(3): 265-272 (2001) |
| 3 | | Arne Winterhof:
Some Estimates for Character Sums and Applications.
Des. Codes Cryptography 22(2): 123-131 (2001) |
| 2 | | Wilfried Meidl,
Arne Winterhof:
Lower bounds on the linear complexity of the discrete logarithm in finite fields.
IEEE Transactions on Information Theory 47(7): 2807-2811 (2001) |
| 2000 |
|---|
| 1 | EE | Tanja Lange,
Arne Winterhof:
Factoring polynomials over arbitrary finite fields.
Theor. Comput. Sci. 234(1-2): 301-308 (2000) |
