Weights of Cyclic Codes - Harald Niederreiter (Inf. Control., 1977)

Optimization of functions by quasi-random search methods. - Harald Niederreiter; Kevin S. McCurley (Computing, 1979)

A Public-Key Cryptosystem based on Shift Register Sequences. - Harald Niederreiter (EUROCRYPT, 1985)

Breaking the Cade Cipher. - N. S. James; Rudolf Lidl; Harald Niederreiter (CRYPTO, 1986)

A Cryptanalytic Attack on the CADE Cryptosystem. - N. S. James; Rudolf Lidl; Harald Niederreiter (EUROCRYPT, 1986)

Sequences With Almost Perfect Linear Complexity Profile. - Harald Niederreiter (EUROCRYPT, 1987)

Optimal characteristic polynomials for digital multistep pseudorandom numbers. - Gary L. Mullen; Harald Niederreiter (Computing, 1987)

The Probabilistic Theory of Linear Complexity. - Harald Niederreiter (EUROCRYPT, 1988)

Keysystem Sequences with a Good Linear Complexity Profile for Every STrating Point. - Harald Niederreiter (EUROCRYPT, 1989)

The Linear Complexity Profile and the Jump Complexity of Keystream Sequences. - Harald Niederreiter (EUROCRYPT, 1990)

A Short Proof for Explicit Formulas for Discrete Logarithms in Finite Fields. - Harald Niederreiter (Appl. Algebra Eng. Commun. Comput., 1990)

An Enumeration Formula for Certain Irreducible Polynomials with an Application to the Construction of Irreducible Polynomials over the Binary Field. - Harald Niederreiter (Appl. Algebra Eng. Commun. Comput., 1990)

A Combinatorial Approach to Probabilistic Results on the Linear Complexity Profile of Random Sequences. - Harald Niederreiter (J. Cryptol., 1990)

Recent trends in random number and random vector generation. - Harald Niederreiter (Ann. Oper. Res., 1991)

A combinatorial problem for vector spaces over finite fields. - Harald Niederreiter (Discret. Math., 1991)

Random number generation and Quasi-Monte Carlo methods. - Harald Niederreiter (SIAM, 1992)

Local Randomness in Candidate One-Way Functions. - Harald Niederreiter; Claus-Peter Schnorr (EUROCRYPT, 1992)

New methods for pseudorandom numbers and pseudorandom vector generation. - Harald Niederreiter (WSC, 1992)

Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes. - Harald Niederreiter (Discret. Math., 1992)

Implementation and Tests of Low Discrepancy Sequences. - Paul Bratley; Bennett L. Fox; Harald Niederreiter (ACM Trans. Model. Comput. Simul., 1992)

On the Linear Complexity of Products of Shift-Register Sequences. - Rainer Göttfert; Harald Niederreiter (EUROCRYPT, 1993)

A New Efficient Factorization Algorithm for Polynomial over Small Finite Fields. - Harald Niederreiter (Appl. Algebra Eng. Commun. Comput., 1993)

Proof of Williams' Conjecture on Experimental Designs Balanced for Pairs of Interacting Residual Effects. - Harald Niederreiter (Eur. J. Comb., 1993)

Improved Error Bounds for Lattice Rules. - Harald Niederreiter (J. Complex., 1993)

Factorization of Polynomials over Finite Fields and Characteristic Sequences. - Harald Niederreiter; Rainer Göttfert (J. Symb. Comput., 1993)

Local Randomness in Polynomial Random Number and Random Function Generators. - Harald Niederreiter; Claus-Peter Schnorr (SIAM J. Comput., 1993)

General Lower Bound for the Linear Complexity of the Product of Shift-Register Sequences. - Rainer Göttfert; Harald Niederreiter (EUROCRYPT, 1994)

On the Statistical Independence of Nonlinear Congruential Pseudorandom Numbers. - Jürgen Eichenauer-Herrmann; Harald Niederreiter (ACM Trans. Model. Comput. Simul., 1994)

Digital Inversive Pseudorandom Numbers. - Jürgen Eichenauer-Herrmann; Harald Niederreiter (ACM Trans. Model. Comput. Simul., 1994)

Pseudorandom Vector Generation by the Inverse Method. - Harald Niederreiter (ACM Trans. Model. Comput. Simul., 1994)

Programs to generate Niederreiter's low-discrepancy sequences. - Paul Bratley; Bennett L. Fox; Harald Niederreiter (ACM Trans. Math. Softw., 1994)

Some Linear and Nonlinear Methods for Pseudorandom Number Generation. - Harald Niederreiter (WSC, 1995)

Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences. - Harald Niederreiter; Michael Vielhaber 001 (J. Complex., 1996)

Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles. - Harald Niederreiter; Michael Vielhaber 001 (J. Complex., 1997)

Inversive congruential pseudorandom numbers: distribution of triples. - Jürgen Eichenauer-Herrmann; Harald Niederreiter (Math. Comput., 1997)

A General Method of Constructing Global Function Fields. - Harald Niederreiter; Chaoping Xing (ANTS, 1998)

Some Computable Complexity Measures for Binary Sequences. - Harald Niederreiter (SETA, 1998)

Counting Functions and Expected Values in the Stability Theory of Stream Ciphers. - Harald Niederreiter; Heike Paschinger (SETA, 1998)

Simultaneous Shifted Continued Fraction Expansions in Quadratic Time. - Harald Niederreiter; Michael Vielhaber 001 (Appl. Algebra Eng. Commun. Comput., 1998)

The Weighted Spectral Test: Diaphony. - Peter Hellekalek; Harald Niederreiter (ACM Trans. Model. Comput. Simul., 1998)

On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders. - Frances Griffin; Harald Niederreiter; Igor E. Shparlinski (AAECC, 1999)

A New Construction of Algebraic Geometry Codes. - Harald Niederreiter; Chaoping Xing; Kwok-Yan Lam (Appl. Algebra Eng. Commun. Comput., 1999)

An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time. - Harald Niederreiter; Michael Vielhaber 001 (Theor. Comput. Sci., 1999)

Constructions of Algebraic-Geometry Codes. - Chaoping Xing; Harald Niederreiter; Kwok-Yan Lam (IEEE Trans. Inf. Theory, 1999)

A generalization of algebraic-geometry codes. - Chaoping Xing; Harald Niederreiter; Kwok-Yan Lam (IEEE Trans. Inf. Theory, 1999)

On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods. - Harald Niederreiter; Igor E. Shparlinski (Appl. Algebra Eng. Commun. Comput., 2000)

A Propagation Rule for Linear Codes. - Harald Niederreiter; Chaoping Xing (Appl. Algebra Eng. Commun. Comput., 2000)

Some new codes from algebraic curves. - Cunsheng Ding; Harald Niederreiter; Chaoping Xing (IEEE Trans. Inf. Theory, 2000)

On the Lattice Structure of Pseudorandom Numbers Generated over Arbitrary Finite Fields. - Harald Niederreiter; Arne Winterhof (Appl. Algebra Eng. Commun. Comput., 2001)

The Microstructure of (t, m, s)-Nets. - Harald Niederreiter; Gottlieb Pirsic (J. Complex., 2001)

ANNOUNCEMENT: 2000 Best Paper Award. - Harald Niederreiter; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2001)

On the distribution of inversive congruential pseudorandom numbers in parts of the period. - Harald Niederreiter; Igor E. Shparlinski (Math. Comput., 2001)

On a new class of inversive pseudorandom numbers for parallelized simulation methods. - Harald Niederreiter; Arne Winterhof (Period. Math. Hung., 2001)

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers. - Harald Niederreiter; Arne Winterhof (Appl. Algebra Eng. Commun. Comput., 2002)

Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform. - Wilfried Meidl; Harald Niederreiter (J. Complex., 2002)

2001 Best Paper Award. - Harald Niederreiter; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2002)

The minimum distance of the duals of binary irreducible cyclic codes. - Cunsheng Ding; Tor Helleseth; Harald Niederreiter; Chaoping Xing (IEEE Trans. Inf. Theory, 2002)

On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences. - Wilfried Meidl; Harald Niederreiter (IEEE Trans. Inf. Theory, 2002)

Dynamical Systems Generated by Rational Functions. - Harald Niederreiter; Igor E. Shparlinski (AAECC, 2003)

Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity. - Harald Niederreiter; Igor E. Shparlinski (IMACC, 2003)

Linear Complexity and Related Complexity Measures for Sequences. - Harald Niederreiter (INDOCRYPT, 2003)

Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity. - Wilfried Meidl; Harald Niederreiter (Appl. Algebra Eng. Commun. Comput., 2003)

The existence of good extensible rank-1 lattices. - Fred J. Hickernell; Harald Niederreiter (J. Complex., 2003)

The expected value of the joint linear complexity of periodic multisequences. - Wilfried Meidl; Harald Niederreiter (J. Complex., 2003)

Some current issues in quasi-Monte Carlo methods. - Harald Niederreiter (J. Complex., 2003)

Periodic sequences with large k-error linear complexity. - Harald Niederreiter (IEEE Trans. Inf. Theory, 2003)

On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers. - Harald Niederreiter; Arne Winterhof (SETA, 2004)

Matrix-product constructions of digital nets. - Harald Niederreiter; Ferruh Özbudak (Finite Fields Their Appl., 2004)

From the Editors. - Harald Niederreiter; Joseph F. Traub; Henryk Wozniakowski (J. Complex., 2004)

Systematic authentication codes from highly nonlinear functions. - Cunsheng Ding; Harald Niederreiter (IEEE Trans. Inf. Theory, 2004)

Disjoint Linear Codes From Algebraic Function Fields. - Harald Niederreiter; Chaoping Xing (IEEE Trans. Inf. Theory, 2004)

Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences. - Harald Niederreiter; Li-Ping Wang 001 (INDOCRYPT, 2005)

Cyclotomic R-orthomorphisms of finite fields. - Harald Niederreiter; Arne Winterhof (Discret. Math., 2005)

Constructions of (t, m, s)-nets and (t, s)-sequences. - Harald Niederreiter (Finite Fields Their Appl., 2005)

The expectation and variance of the joint linear complexity of random periodic multisequences. - Fang-Wei Fu 001; Harald Niederreiter; Ming Su (J. Complex., 2005)

The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity. - Fang-Wei Fu 001; Harald Niederreiter; Ming Su (SETA, 2006)

The Probabilistic Theory of the Joint Linear Complexity of Multisequences. - Harald Niederreiter (SETA, 2006)

Authentication Schemes from Highly Nonlinear Functions. - Claude Carlet; Cunsheng Ding; Harald Niederreiter (Des. Codes Cryptogr., 2006)

On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots. - San Ling; Harald Niederreiter; Patrick Solé (Des. Codes Cryptogr., 2006)

Enumeration results on the joint linear complexity of multisequences. - Li-Ping Wang 001; Harald Niederreiter (Finite Fields Their Appl., 2006)

Probability and computing: randomized algorithms and probabilistic analysis. - Harald Niederreiter (Math. Comput., 2006)

On the Structure of Inversive Pseudorandom Number Generators. - Harald Niederreiter; Arne Winterhof (AAECC, 2007)

Further improvements on asymptotic bounds for codes using distinguished divisors. - Harald Niederreiter; Ferruh Özbudak (Finite Fields Their Appl., 2007)

On the counting function of the lattice profile of periodic sequences. - Fang-Wei Fu 001; Harald Niederreiter (J. Complex., 2007)

Error linear complexity measures for multisequences. - Wilfried Meidl; Harald Niederreiter; Ayineedi Venkateswarlu (J. Complex., 2007)

Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields. - Harald Niederreiter; Ferruh Özbudak (SIAM J. Discret. Math., 2007)

Cyclotomic Linear Codes of Order 3. - Cunsheng Ding; Harald Niederreiter (IEEE Trans. Inf. Theory, 2007)

Function-field codes. - Dirk Hachenberger; Harald Niederreiter; Chaoping Xing (Appl. Algebra Eng. Commun. Comput., 2008)

Periodic multisequences with large error linear complexity. - Harald Niederreiter; Ayineedi Venkateswarlu (Des. Codes Cryptogr., 2008)

Exponential sums for nonlinear recurring sequences. - Harald Niederreiter; Arne Winterhof (Finite Fields Their Appl., 2008)

On the exact t-value of Niederreiter and Sobol' sequences. - Josef Dick; Harald Niederreiter (J. Complex., 2008)

Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences. - Li-Ping Wang 001; Harald Niederreiter (J. Complex., 2008)

Joint linear complexity of multisequences consisting of linear recurring sequences. - Fang-Wei Fu 001; Harald Niederreiter; Ferruh Özbudak (Cryptogr. Commun., 2009)

Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences. - Fang-Wei Fu 001; Harald Niederreiter; Ferruh Özbudak (Finite Fields Their Appl., 2009)

Duality for digital sequences. - Josef Dick; Harald Niederreiter (J. Complex., 2009)

Improved results on periodic multisequences with large error linear complexity. - Ayineedi Venkateswarlu; Harald Niederreiter (Finite Fields Their Appl., 2010)

Improved results on the probabilistic theory of the joint linear complexity of multisequences. - Harald Niederreiter; Michael Vielhaber 001; Li-Ping Wang 001 (Sci. China Inf. Sci., 2012)

The independence of two randomness properties of sequences over finite fields. - Harald Niederreiter (J. Complex., 2012)

LFSR sequences and maximal period sequences. - Harald Niederreiter (Handbook of Finite Fields, 2013)

(t, m, s)-nets and (t, s)-sequences. - Harald Niederreiter (Handbook of Finite Fields, 2013)

Algebraic-geometry codes. - Harald Niederreiter (Handbook of Finite Fields, 2013)

Finite Fields and Quasirandom Points. - Harald Niederreiter (Finite Fields and Their Applications, 2013)

A direct inversion method for non-uniform quasi-random point sequences. - Colas Schretter; Harald Niederreiter (Monte Carlo Methods Appl., 2013)

Vandermonde Nets and Vandermonde Sequences. - Roswitha Hofer; Harald Niederreiter (MCQMC, 2014)

Van der Corput and Golden Ratio Sequences Along the Hilbert Space-Filling Curve. - Colas Schretter; Zhijian He; Mathieu Gerber; Nicolas Chopin; Harald Niederreiter (MCQMC, 2014)

Sequences With High Nonlinear Complexity. - Harald Niederreiter; Chaoping Xing (IEEE Trans. Inf. Theory, 2014)

Guest Editors' Preface. - Michael Gnewuch; Frances Y. Kuo; Harald Niederreiter; Henryk Wozniakowski (J. Complex., 2015)

Propagation rules for (u,m,e,s)-nets and (u,e,s)-sequences. - Peter Kritzer; Harald Niederreiter (J. Complex., 2015)

Multisequences with high joint nonlinear complexity. - Wilfried Meidl; Harald Niederreiter (Des. Codes Cryptogr., 2016)

A survey of some applications of finite fields. - Harald Niederreiter (Des. Codes Cryptogr., 2016)

Mixed orthogonal arrays, -nets, and -sequences. - Peter Kritzer; Harald Niederreiter (Discret. Math., 2016)

Expansion complexity and linear complexity of sequences over finite fields. - László Mérai; Harald Niederreiter; Arne Winterhof (Cryptogr. Commun., 2017)

Recent constructions of low-discrepancy sequences. - Harald Niederreiter (Math. Comput. Simul., 2017)

On the Expansion Complexity of Sequences Over Finite Fields. - Domingo Gómez-Pérez; László Mérai; Harald Niederreiter (IEEE Trans. Inf. Theory, 2018)

Perfect linear complexity profile and apwenian sequences. - Jean-Paul Allouche; Guo-Niu Han; Harald Niederreiter (Finite Fields Their Appl., 2020)