The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harald Niederreiter: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  74. On the Structure of Inversive Pseudorandom Number Generators. [Citation Graph (, )][DBLP]


  75. Function-field codes. [Citation Graph (, )][DBLP]


  76. Periodic multisequences with large error linear complexity. [Citation Graph (, )][DBLP]


Search in 0.085secs, Finished in 0.089secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002