Harald Niederreiter

Orcid: 0000-0001-6224-9969

Affiliations:
  • National University of Singapore


According to our database1, Harald Niederreiter authored at least 115 papers between 1977 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Perfect linear complexity profile and apwenian sequences.
Finite Fields Their Appl., 2020

2018
On the Expansion Complexity of Sequences Over Finite Fields.
IEEE Trans. Inf. Theory, 2018

2017
Recent constructions of low-discrepancy sequences.
Math. Comput. Simul., 2017

Expansion complexity and linear complexity of sequences over finite fields.
Cryptogr. Commun., 2017

2016
Mixed orthogonal arrays, -nets, and -sequences.
Discret. Math., 2016

A survey of some applications of finite fields.
Des. Codes Cryptogr., 2016

Multisequences with high joint nonlinear complexity.
Des. Codes Cryptogr., 2016

2015
Propagation rules for (u,m,e,s)-nets and (u,e,s)-sequences.
J. Complex., 2015

Guest Editors' Preface.
J. Complex., 2015

2014
Sequences With High Nonlinear Complexity.
IEEE Trans. Inf. Theory, 2014

Van der Corput and Golden Ratio Sequences Along the Hilbert Space-Filling Curve.
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

Vandermonde Nets and Vandermonde Sequences.
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

2013
A direct inversion method for non-uniform quasi-random point sequences.
Monte Carlo Methods Appl., 2013

Finite Fields and Quasirandom Points.
Proceedings of the Finite Fields and Their Applications - Character Sums and Polynomials., 2013

Algebraic-geometry codes.
Proceedings of the Handbook of Finite Fields., 2013

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

LFSR sequences and maximal period sequences.
Proceedings of the Handbook of Finite Fields., 2013

2012
The independence of two randomness properties of sequences over finite fields.
J. Complex., 2012

Improved results on the probabilistic theory of the joint linear complexity of multisequences.
Sci. China Inf. Sci., 2012

2010
Improved results on periodic multisequences with large error linear complexity.
Finite Fields Their Appl., 2010

2009
Duality for digital sequences.
J. Complex., 2009

Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences.
Finite Fields Their Appl., 2009

Joint linear complexity of multisequences consisting of linear recurring sequences.
Cryptogr. Commun., 2009

2008
Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences.
J. Complex., 2008

On the exact t-value of Niederreiter and Sobol' sequences.
J. Complex., 2008

Exponential sums for nonlinear recurring sequences.
Finite Fields Their Appl., 2008

Periodic multisequences with large error linear complexity.
Des. Codes Cryptogr., 2008

Function-field codes.
Appl. Algebra Eng. Commun. Comput., 2008

2007
Cyclotomic Linear Codes of Order 3.
IEEE Trans. Inf. Theory, 2007

Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields.
SIAM J. Discret. Math., 2007

Error linear complexity measures for multisequences.
J. Complex., 2007

On the counting function of the lattice profile of periodic sequences.
J. Complex., 2007

Further improvements on asymptotic bounds for codes using distinguished divisors.
Finite Fields Their Appl., 2007

On the Structure of Inversive Pseudorandom Number Generators.
Proceedings of the Applied Algebra, 2007

2006
Probability and computing: randomized algorithms and probabilistic analysis.
Math. Comput., 2006

Enumeration results on the joint linear complexity of multisequences.
Finite Fields Their Appl., 2006

On the Algebraic Structure of Quasi-cyclic Codes IV: Repeated Roots.
Des. Codes Cryptogr., 2006

Authentication Schemes from Highly Nonlinear Functions.
Des. Codes Cryptogr., 2006

The Probabilistic Theory of the Joint Linear Complexity of Multisequences.
Proceedings of the Sequences and Their Applications, 2006

The Characterization of 2<sup><i>n</i></sup>-Periodic Binary Sequences with Fixed 1-Error Linear Complexity.
Proceedings of the Sequences and Their Applications, 2006

2005
The expectation and variance of the joint linear complexity of random periodic multisequences.
J. Complex., 2005

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

Cyclotomic R-orthomorphisms of finite fields.
Discret. Math., 2005

Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences.
Proceedings of the Progress in Cryptology, 2005

2004
Disjoint Linear Codes From Algebraic Function Fields.
IEEE Trans. Inf. Theory, 2004

Systematic authentication codes from highly nonlinear functions.
IEEE Trans. Inf. Theory, 2004

From the Editors.
J. Complex., 2004

Matrix-product constructions of digital nets.
Finite Fields Their Appl., 2004

On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers.
Proceedings of the Sequences and Their Applications, 2004

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

Some current issues in quasi-Monte Carlo methods.
J. Complex., 2003

The expected value of the joint linear complexity of periodic multisequences.
J. Complex., 2003

The existence of good extensible rank-1 lattices.
J. Complex., 2003

Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity.
Appl. Algebra Eng. Commun. Comput., 2003

Linear Complexity and Related Complexity Measures for Sequences.
Proceedings of the Progress in Cryptology, 2003

Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity.
Proceedings of the Cryptography and Coding, 2003

Dynamical Systems Generated by Rational Functions.
Proceedings of the Applied Algebra, 2003

2002
On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences.
IEEE Trans. Inf. Theory, 2002

The minimum distance of the duals of binary irreducible cyclic codes.
IEEE Trans. Inf. Theory, 2002

2001 Best Paper Award.
J. Complex., 2002

Linear Complexity, <i>k</i>-Error Linear Complexity, and the Discrete Fourier Transform.
J. Complex., 2002

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers.
Appl. Algebra Eng. Commun. Comput., 2002

2001
On a new class of inversive pseudorandom numbers for parallelized simulation methods.
Period. Math. Hung., 2001

On the distribution of inversive congruential pseudorandom numbers in parts of the period.
Math. Comput., 2001

ANNOUNCEMENT: 2000 Best Paper Award.
J. Complex., 2001

The Microstructure of (<i>t, m, s</i>)-Nets.
J. Complex., 2001

On the Lattice Structure of Pseudorandom Numbers Generated over Arbitrary Finite Fields.
Appl. Algebra Eng. Commun. Comput., 2001

2000
Some new codes from algebraic curves.
IEEE Trans. Inf. Theory, 2000

A Propagation Rule for Linear Codes.
Appl. Algebra Eng. Commun. Comput., 2000

On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods.
Appl. Algebra Eng. Commun. Comput., 2000

1999
A generalization of algebraic-geometry codes.
IEEE Trans. Inf. Theory, 1999

Constructions of Algebraic-Geometry Codes.
IEEE Trans. Inf. Theory, 1999

An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time.
Theor. Comput. Sci., 1999

A New Construction of Algebraic Geometry Codes.
Appl. Algebra Eng. Commun. Comput., 1999

On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders.
Proceedings of the Applied Algebra, 1999

1998
The Weighted Spectral Test: Diaphony.
ACM Trans. Model. Comput. Simul., 1998

Simultaneous Shifted Continued Fraction Expansions in Quadratic Time.
Appl. Algebra Eng. Commun. Comput., 1998

Counting Functions and Expected Values in the Stability Theory of Stream Ciphers.
Proceedings of the Sequences and their Applications, 1998

Some Computable Complexity Measures for Binary Sequences.
Proceedings of the Sequences and their Applications, 1998

A General Method of Constructing Global Function Fields.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997
Inversive congruential pseudorandom numbers: distribution of triples.
Math. Comput., 1997

Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles.
J. Complex., 1997

1996
Tree Complexity and a Doubly Exponential Gap between Structured and Random Sequences.
J. Complex., 1996

1995
Some Linear and Nonlinear Methods for Pseudorandom Number Generation.
Proceedings of the 27th conference on Winter simulation, 1995

1994
Programs to generate Niederreiter's low-discrepancy sequences.
ACM Trans. Math. Softw., 1994

Pseudorandom Vector Generation by the Inverse Method.
ACM Trans. Model. Comput. Simul., 1994

Digital Inversive Pseudorandom Numbers.
ACM Trans. Model. Comput. Simul., 1994

On the Statistical Independence of Nonlinear Congruential Pseudorandom Numbers.
ACM Trans. Model. Comput. Simul., 1994

General Lower Bound for the Linear Complexity of the Product of Shift-Register Sequences.
Proceedings of the Advances in Cryptology, 1994

1993
Local Randomness in Polynomial Random Number and Random Function Generators.
SIAM J. Comput., 1993

Factorization of Polynomials over Finite Fields and Characteristic Sequences.
J. Symb. Comput., 1993

Improved Error Bounds for Lattice Rules.
J. Complex., 1993

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

A New Efficient Factorization Algorithm for Polynomial over Small Finite Fields.
Appl. Algebra Eng. Commun. Comput., 1993

On the Linear Complexity of Products of Shift-Register Sequences.
Proceedings of the Advances in Cryptology, 1993

1992
Implementation and Tests of Low Discrepancy Sequences.
ACM Trans. Model. Comput. Simul., 1992

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

New methods for pseudorandom numbers and pseudorandom vector generation.
Proceedings of the 24th Winter Simulation Conference, 1992

Local Randomness in Candidate One-Way Functions.
Proceedings of the Advances in Cryptology, 1992

Random number generation and Quasi-Monte Carlo methods.
CBMS-NSF regional conference series in applied mathematics 63, SIAM, ISBN: 978-0-89871-295-7, 1992

1991
A combinatorial problem for vector spaces over finite fields.
Discret. Math., 1991

Recent trends in random number and random vector generation.
Ann. Oper. Res., 1991

1990
A Combinatorial Approach to Probabilistic Results on the Linear Complexity Profile of Random Sequences.
J. Cryptol., 1990

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., 1990

A Short Proof for Explicit Formulas for Discrete Logarithms in Finite Fields.
Appl. Algebra Eng. Commun. Comput., 1990

The Linear Complexity Profile and the Jump Complexity of Keystream Sequences.
Proceedings of the Advances in Cryptology, 1990

1989
Keysystem Sequences with a Good Linear Complexity Profile for Every STrating Point.
Proceedings of the Advances in Cryptology, 1989

1988
The Probabilistic Theory of Linear Complexity.
Proceedings of the Advances in Cryptology, 1988

1987
Optimal characteristic polynomials for digital multistep pseudorandom numbers.
Computing, 1987

Sequences With Almost Perfect Linear Complexity Profile.
Proceedings of the Advances in Cryptology, 1987

1986
A Cryptanalytic Attack on the CADE Cryptosystem.
EUROCRYPT, 1986

Breaking the Cade Cipher.
Proceedings of the Advances in Cryptology, 1986

1985
A Public-Key Cryptosystem based on Shift Register Sequences.
Proceedings of the Advances in Cryptology, 1985

1979
Optimization of functions by quasi-random search methods.
Computing, 1979

1977
Weights of Cyclic Codes
Inf. Control., June, 1977


  Loading...