| 2008 |
|---|
| 80 | EE | Dirk Hachenberger,
Harald Niederreiter,
Chaoping Xing:
Function-field codes.
Appl. Algebra Eng. Commun. Comput. 19(3): 201-211 (2008) |
| 79 | EE | Harald Niederreiter,
Ayineedi Venkateswarlu:
Periodic multisequences with large error linear complexity.
Des. Codes Cryptography 49(1-3): 33-45 (2008) |
| 78 | EE | Li-Ping Wang,
Harald Niederreiter:
Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences.
J. Complexity 24(2): 144-153 (2008) |
| 77 | EE | Josef Dick,
Harald Niederreiter:
On the exact t-value of Niederreiter and Sobol' sequences.
J. Complexity 24(5-6): 572-581 (2008) |
| 2007 |
|---|
| 76 | EE | Harald Niederreiter,
Arne Winterhof:
On the Structure of Inversive Pseudorandom Number Generators.
AAECC 2007: 208-216 |
| 75 | EE | Cunsheng Ding,
Harald Niederreiter:
Cyclotomic Linear Codes of Order 3.
IEEE Transactions on Information Theory 53(6): 2274-2277 (2007) |
| 74 | EE | Harald Niederreiter,
Joseph F. Traub,
Henryk Wozniakowski:
From the Editors.
J. Complexity 23(1): 1 (2007) |
| 73 | EE | Wilfried Meidl,
Harald Niederreiter,
Ayineedi Venkateswarlu:
Error linear complexity measures for multisequences.
J. Complexity 23(2): 169-192 (2007) |
| 72 | EE | Fang-Wei Fu,
Harald Niederreiter:
On the counting function of the lattice profile of periodic sequences.
J. Complexity 23(4-6): 423-435 (2007) |
| 71 | EE | Harald Niederreiter,
Ferruh Özbudak:
Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields.
SIAM J. Discrete Math. 21(4): 865-899 (2007) |
| 2006 |
|---|
| 70 | EE | Harald Niederreiter:
The Probabilistic Theory of the Joint Linear Complexity of Multisequences.
SETA 2006: 5-16 |
| 69 | EE | Fang-Wei Fu,
Harald Niederreiter,
Ming Su:
The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity.
SETA 2006: 88-103 |
| 68 | EE | San Ling,
Harald Niederreiter,
Patrick Solé:
On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots.
Des. Codes Cryptography 38(3): 337-361 (2006) |
| 67 | EE | Claude Carlet,
Cunsheng Ding,
Harald Niederreiter:
Authentication Schemes from Highly Nonlinear Functions.
Des. Codes Cryptography 40(1): 71-79 (2006) |
| 2005 |
|---|
| 66 | EE | Harald Niederreiter,
Li-Ping Wang:
Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences.
INDOCRYPT 2005: 13-22 |
| 65 | EE | Harald Niederreiter,
Arne Winterhof:
Cyclotomic R-orthomorphisms of finite fields.
Discrete Mathematics 295(1-3): 161-171 (2005) |
| 64 | EE | Fang-Wei Fu,
Harald Niederreiter,
Ming Su:
The expectation and variance of the joint linear complexity of random periodic multisequences.
J. Complexity 21(6): 804-822 (2005) |
| 2004 |
|---|
| 63 | EE | Harald Niederreiter,
Arne Winterhof:
On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers.
SETA 2004: 266-274 |
| 62 | | Cunsheng Ding,
Harald Niederreiter:
Systematic authentication codes from highly nonlinear functions.
IEEE Transactions on Information Theory 50(10): 2421-2428 (2004) |
| 61 | | Harald Niederreiter,
Chaoping Xing:
Disjoint Linear Codes From Algebraic Function Fields.
IEEE Transactions on Information Theory 50(9): 2174-2177 (2004) |
| 60 | EE | Harald Niederreiter,
Joseph F. Traub,
Henryk Wozniakowski:
From the Editors.
J. Complexity 20(1): 1-2 (2004) |
| 2003 |
|---|
| 59 | EE | Harald Niederreiter,
Igor Shparlinski:
Dynamical Systems Generated by Rational Functions.
AAECC 2003: 6-17 |
| 58 | EE | Harald Niederreiter,
Igor Shparlinski:
Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity.
IMA Int. Conf. 2003: 183-189 |
| 57 | EE | Harald Niederreiter:
Linear Complexity and Related Complexity Measures for Sequences.
INDOCRYPT 2003: 1-17 |
| 56 | EE | Wilfried Meidl,
Harald Niederreiter:
Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity.
Appl. Algebra Eng. Commun. Comput. 14(4): 273-286 (2003) |
| 55 | | Harald Niederreiter:
Periodic sequences with large k-error linear complexity.
IEEE Transactions on Information Theory 49(2): 501-505 (2003) |
| 54 | EE | Wilfried Meidl,
Harald Niederreiter:
The expected value of the joint linear complexity of periodic multisequences.
J. Complexity 19(1): 61-72 (2003) |
| 53 | EE | Fred J. Hickernell,
Harald Niederreiter:
The existence of good extensible rank-1 lattices.
J. Complexity 19(3): 286-300 (2003) |
| 52 | EE | Harald Niederreiter:
Some current issues in quasi-Monte Carlo methods.
J. Complexity 19(3): 428-433 (2003) |
| 2002 |
|---|
| 51 | EE | Harald Niederreiter,
Arne Winterhof:
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers.
Appl. Algebra Eng. Commun. Comput. 13(4): 319-326 (2002) |
| 50 | | Cunsheng Ding,
Tor Helleseth,
Harald Niederreiter,
Chaoping Xing:
The minimum distance of the duals of binary irreducible cyclic codes.
IEEE Transactions on Information Theory 48(10): 2679-2689 (2002) |
| 49 | | Wilfried Meidl,
Harald Niederreiter:
On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences.
IEEE Transactions on Information Theory 48(11): 2817-2825 (2002) |
| 48 | EE | Wilfried Meidl,
Harald Niederreiter:
Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform.
J. Complexity 18(1): 87-103 (2002) |
| 47 | EE | Harald Niederreiter,
Joseph F. Traub,
Henryk Wozniakowski:
2001 Best Paper Award.
J. Complexity 18(3): 680- (2002) |
| 2001 |
|---|
| 46 | 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) |
| 45 | EE | Harald Niederreiter,
Joseph F. Traub,
Henryk Wozniakowski:
ANNOUNCEMENT: 2000 Best Paper Award.
J. Complexity 17(3): 494- (2001) |
| 44 | EE | Harald Niederreiter,
Gottlieb Pirsic:
The Microstructure of (t, m, s)-Nets.
J. Complexity 17(4): 683-696 (2001) |
| 43 | | Harald Niederreiter,
Igor Shparlinski:
On the distribution of inversive congruential pseudorandom numbers in parts of the period.
Math. Comput. 70(236): 1569-1574 (2001) |
| 2000 |
|---|
| 42 | EE | Harald Niederreiter,
Igor Shparlinski:
On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods.
Appl. Algebra Eng. Commun. Comput. 10(3): 189-202 (2000) |
| 41 | EE | Harald Niederreiter,
Chaoping Xing:
A Propagation Rule for Linear Codes.
Appl. Algebra Eng. Commun. Comput. 10(6): 425-432 (2000) |
| 40 | | Cunsheng Ding,
Harald Niederreiter,
Chaoping Xing:
Some new codes from algebraic curves.
IEEE Transactions on Information Theory 46(7): 2638-2642 (2000) |
| 1999 |
|---|
| 39 | | Frances Griffin,
Harald Niederreiter,
Igor Shparlinski:
On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders.
AAECC 1999: 87-93 |
| 38 | EE | Harald Niederreiter,
Chaoping Xing,
Kwok-Yan Lam:
A New Construction of Algebraic Geometry Codes.
Appl. Algebra Eng. Commun. Comput. 9(5): 373-381 (1999) |
| 37 | | Chaoping Xing,
Harald Niederreiter,
Kwok-Yan Lam:
Constructions of Algebraic-Geometry Codes.
IEEE Transactions on Information Theory 45(4): 1186-1193 (1999) |
| 36 | | Chaoping Xing,
Harald Niederreiter,
Kwok-Yan Lam:
A generalization of algebraic-geometry codes.
IEEE Transactions on Information Theory 45(7): 2498-2501 (1999) |
| 35 | EE | Harald Niederreiter,
Michael Vielhaber:
An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time.
Theor. Comput. Sci. 226(1-2): 93-104 (1999) |
| 1998 |
|---|
| 34 | EE | Harald Niederreiter,
Chaoping Xing:
A General Method of Constructing Global Function Fields.
ANTS 1998: 555-566 |
| 33 | EE | Peter Hellekalek,
Harald Niederreiter:
The Weighted Spectral Test: Diaphony.
ACM Trans. Model. Comput. Simul. 8(1): 43-60 (1998) |
| 32 | EE | Harald Niederreiter,
Michael Vielhaber:
Simultaneous Shifted Continued Fraction Expansions in Quadratic Time.
Appl. Algebra Eng. Commun. Comput. 9(2): 125-138 (1998) |
| 1997 |
|---|
| 31 | EE | Harald Niederreiter,
Michael Vielhaber:
Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles.
J. Complexity 13(3): 353-383 (1997) |
| 30 | | Jürgen Eichenauer-Herrmann,
Harald Niederreiter:
Inversive congruential pseudorandom numbers: distribution of triples.
Math. Comput. 66(220): 1629-1644 (1997) |
| 1996 |
|---|
| 29 | EE | Harald Niederreiter,
Michael Vielhaber:
Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences.
J. Complexity 12(3): 187-198 (1996) |
| 1995 |
|---|
| 28 | EE | Harald Niederreiter:
Some Linear and Nonlinear Methods for Pseudorandom Number Generation.
Winter Simulation Conference 1995: 250-254 |
| 1994 |
|---|
| 27 | EE | Rainer Göttfert,
Harald Niederreiter:
General Lower Bound for the Linear Complexity of the Product of Shift-Register Sequences.
EUROCRYPT 1994: 223-229 |
| 26 | EE | Paul Bratley,
Bennett L. Fox,
Harald Niederreiter:
Programs to generate Niederreiter's low-discrepancy sequences.
ACM Trans. Math. Softw. 20(4): 494-495 (1994) |
| 25 | EE | Jürgen Eichenauer-Herrmann,
Harald Niederreiter:
On the Statistical Independence of Nonlinear Congruential Pseudorandom Numbers.
ACM Trans. Model. Comput. Simul. 4(1): 89-95 (1994) |
| 24 | EE | Harald Niederreiter:
Pseudorandom Vector Generation by the Inverse Method.
ACM Trans. Model. Comput. Simul. 4(2): 191-212 (1994) |
| 23 | EE | Jürgen Eichenauer-Herrmann,
Harald Niederreiter:
Digital Inversive Pseudorandom Numbers.
ACM Trans. Model. Comput. Simul. 4(4): 339-349 (1994) |
| 1993 |
|---|
| 22 | EE | Rainer Göttfert,
Harald Niederreiter:
On the Linear Complexity of Products of Shift-Register Sequences.
EUROCRYPT 1993: 151-158 |
| 21 | | Harald Niederreiter:
A New Efficient Factorization Algorithm for Polynomial over Small Finite Fields.
Appl. Algebra Eng. Commun. Comput. 4: 81-87 (1993) |
| 20 | EE | Harald Niederreiter:
Proof of Williams' Conjecture on Experimental Designs Balanced for Pairs of Interacting Residual Effects.
Eur. J. Comb. 14(1): 55-58 (1993) |
| 19 | EE | Harald Niederreiter:
Improved Error Bounds for Lattice Rules.
J. Complexity 9(1): 60-75 (1993) |
| 18 | | Harald Niederreiter,
Rainer Göttfert:
Factorization of Polynomials over Finite Fields and Characteristic Sequences.
J. Symb. Comput. 16(5): 401-412 (1993) |
| 17 | | Harald Niederreiter,
Claus-Peter Schnorr:
Local Randomness in Polynomial Random Number and Random Function Generators.
SIAM J. Comput. 22(4): 684-694 (1993) |
| 1992 |
|---|
| 16 | EE | Harald Niederreiter,
Claus-Peter Schnorr:
Local Randomness in Candidate One-Way Functions.
EUROCRYPT 1992: 408-419 |
| 15 | EE | Harald Niederreiter:
New methods for pseudorandom numbers and pseudorandom vector generation.
Winter Simulation Conference 1992: 264-269 |
| 14 | EE | Paul Bratley,
Bennett L. Fox,
Harald Niederreiter:
Implementation and Tests of Low Discrepancy Sequences.
ACM Trans. Model. Comput. Simul. 2(3): 195-213 (1992) |
| 13 | EE | Harald Niederreiter:
Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes.
Discrete Mathematics 106-107: 361-367 (1992) |
| 1991 |
|---|
| 12 | EE | Harald Niederreiter:
A combinatorial problem for vector spaces over finite fields.
Discrete Mathematics 96(3): 221-228 (1991) |
| 1990 |
|---|
| 11 | EE | Harald Niederreiter:
The Linear Complexity Profile and the Jump Complexity of Keystream Sequences.
EUROCRYPT 1990: 174-188 |
| 10 | | Harald Niederreiter:
An Enumeration Formula for Certain Irreducible Polynomials with an Application to the Construction of Irreducible Polynomials over the Binary Field.
Appl. Algebra Eng. Commun. Comput. 1: 119-124 (1990) |
| 9 | | Harald Niederreiter:
A Short Proof for Explicit Formulas for Discrete Logarithms in Finite Fields.
Appl. Algebra Eng. Commun. Comput. 1: 55-57 (1990) |
| 8 | | Harald Niederreiter:
A Combinatorial Approach to Probabilistic Results on the Linear Complexity Profile of Random Sequences.
J. Cryptology 2(2): 105-112 (1990) |
| 1989 |
|---|
| 7 | EE | Harald Niederreiter:
Keysystem Sequences with a Good Linear Complexity Profile for Every STrating Point.
EUROCRYPT 1989: 523-532 |
| 1988 |
|---|
| 6 | EE | Harald Niederreiter:
The Probabilistic Theory of Linear Complexity.
EUROCRYPT 1988: 191-209 |
| 1987 |
|---|
| 5 | EE | Harald Niederreiter:
Sequences With Almost Perfect Linear Complexity Profile.
EUROCRYPT 1987: 37-51 |
| 1986 |
|---|
| 4 | EE | N. S. James,
Rudolf Lidl,
Harald Niederreiter:
Breaking the Cade Cipher.
CRYPTO 1986: 60-63 |
| 3 | | N. S. James,
Rudolf Lidl,
Harald Niederreiter:
A Cryptanalytic Attack on the CADE Cryptosystem.
EUROCRYPT 1986: 27 |
| 1985 |
|---|
| 2 | EE | Harald Niederreiter:
A Public-Key Cryptosystem based on Shift Register Sequences.
EUROCRYPT 1985: 35-39 |
| 1977 |
|---|
| 1 | | Harald Niederreiter:
Weights of Cyclic Codes
Information and Control 34(2): 130-140 (1977) |
