Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
18 - On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
Published online by Cambridge University Press: 18 December 2014
Book contents
- Frontmatter
- Contents
- Preface
- 1 Some highlights of Harald Niederreiter's work
- 2 Partially bent functions and their properties
- 3 Applications of geometric discrepancy in numerical analysis and statistics
- 4 Discrepancy bounds for low-dimensional point sets
- 5 On the linear complexity and lattice test of nonlinear pseudorandom number generators
- 6 A heuristic formula estimating the keystream length for the general combination generator with respect to a correlation attack
- 7 Point sets of minimal energy
- 8 The cross-correlation measure for families of binary sequences
- 9 On an important family of inequalities of Niederreiter involving exponential sums
- 10 Controlling the shape of generating matrices in global function field constructions of digital sequences
- 11 Periodic structure of the exponential pseudorandom number generator
- 12 Construction of a rank-1 lattice sequence based on primitive polynomials
- 13 A quasi-Monte Carlo method for the coagulation equation
- 14 Asymptotic formulas for partitions with bounded multiplicity
- 15 A trigonometric approach for Chebyshev polynomials over finite fields
- 16 Index bounds for value sets of polynomials over finite fields
- 17 Rational points of the curve over
- 18 On the linear complexity of multisequences, bijections between ℤahlen and ℕumber tuples, and partitions
- Plate section
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Applied Algebra and Number Theory , pp. 307 - 335Publisher: Cambridge University PressPrint publication year: 2014
References
[1] and , Structural and computational complexity of isometries and their shift commutators. Electronic Colloq. on Computational Complexity, ECCC, TR04–057, 2004.Google Scholar
[2] , and , Multi-continued fraction algorithm and generalized B–M algorithm over F2. In: , and (eds.), Proc. SETA 2004, Int. Conf. on Sequences and their Applications, October 24–28, 2004, Seoul, Korea. Lecture Notes in Computer Science, volume 3486. Springer, Berlin, 2005.
[3] , On the equivalence of Berlekamp's and Euclid's algorithms. IEEE Trans. Inf. Theory 33(3), 428–431, 1987.Google Scholar
[4] and , On the length of the longest head-run. Colloq. Math. Soc. J. Bolyai, Keszthely, 1975. Top. Inf. Theory 16, 219–228, 1975.Google Scholar
[5] and , Expected value of the linear complexity of two-dimensional binary sequences. In: , and (eds.), SETA 2004, Int. Conf. on Sequences and their Applications, October 24–28, 2004, Seoul, South Korea. Lecture Notes in Computer Science, volume 3486, pp. 113–128. Springer, Berlin, 2005.
[6] and , A generalized Euclidean algorithm for multisequence shift-register synthesis. IEEE Trans. Inf. Theory 35, 584–594, 1989.Google Scholar
[7] , Analysis of the Berlekamp–Massey linear feedback shift-register synthesis algorithm. IBM J. Res. Develop. 20, 204–212, 1976.Google Scholar
[8] and , On an improvement of a result by Niederreiter and Wang concerning the expected linear complexity of multi-sequences, arXiv:math/0703655v2, 2007.
[9] , Sequences with almost perfect linear complexity profile. Proc. EUROCRYPT 1987. Lecture Notes in Computer Science, volume 304, pp. 37–51. Springer, Berlin, 1988.
[10] , The probabilistic theory of linear complexity. Proc. EUROCRYPT 1988. Lecture Notes in Computer Science, volume 330, pp. 191–209. Springer, Berlin, 1988.
[11] , Keystream sequences with a good linear complexity profile for every starting point. Proc. EUROCRYPT 1989. Lecture Notes in Computer Science, volume 434, pp. 523–532. Springer, Berlin, 1990.
[12] , A combinatorial approach to probabilistic results on the linear-complexity profile of random sequences. J. Cryptol. 2, 105–112, 1990.Google Scholar
[13] , The linear complexity profile and the jump complexity of keystream sequences. Proc. EUROCRYPT 1990, Lecture Notes in Computer Science, volume 473, pp. 174–188. Springer, Berlin, 1991.
[14] , Linear complexity and related complexity measures for sequences. INDOCRYPT 2003. Lecture Notes in Computer Science, volume 2904, pp. 1–17. Springer, Berlin, 2003.
[15] and , Linear complexity profiles: hausdorff dimensions for almost perfect profiles and measures for general profiles. J. Complexity 13(3), 353–383, 1997.Google Scholar
[16] and , Simultaneous shifted linear complexity profiles in quadratic time. Appl. Algebra Eng. Commun. Comput. 9(2), 125–138, 1998.Google Scholar
[17] and , An algorithm for shifted continued fraction expansions in parallel linear time. Theor. Comput. Sci. 226, 93–114, 1999.Google Scholar
[18] and , Proof of a conjecture on the joint linear complexity profile of multisequences. INDOCRYPT 2005. Lecture Notes in Computer Science, volume 3797, pp. 13–22. Springer, Berlin, 2005.
[19] and , The asymptotic behavior of the joint linear complexity profile of multisequences. Monatsh. Math. 150, 141–155, 2007.Google Scholar
[20] , and , Improved results on the probabilistic theory of joint linear complexity of multisequences. Sci. China Inf. Sci. 55(1), 165–170, 2012.Google Scholar
[22] , Strong theorems on coin tossing. Proceedings of the International Congress Mathematicians, Helsinki, pp. 749–754, 1978.Google Scholar
[23] , Random Walk in Random and Non-Random Environment. World Scientific, Singapore, 1990.
[24] , Analysis and Design of Stream Ciphers. Springer, Berlin, 1986.
[25] , Kettenbrüche, Komplexitätsmaße und die Zufälligkeit von Symbolfolgen. Dissertation, University of Vienna, 1997 (PhD Advisor Harald Niederreiter).
[26] , A unified view on sequence complexity measures as isome-tries. In: , and (eds.), SETA 2004, Proc. Int. Conf. on Sequences and their Applications, October 24–28, 2004, Seoul, Korea. Lecture Notes in Computer Science, volume 3488. Springer, Berlin, 2005.
[27] , Continued fraction expansion as isometry – the law of the iterated logarithm for linear, jump, and 2-adic complexity. IEEE Trans. Inf. Theory 53(11), 4383–4391, 2007.Google Scholar
[28] and , The Hausdorff dimension of the set of d-perfect M-multisequences. SETA 2006, pp. 259–270. Springer, Berlin, 2006.
[29] and , Towards a general theory of simultaneous Diophantine approximation of formal power series: linear complexity of multisequences, arXiv.org/abs/cs.IT/0607030, 2006.
[30] and , On a class of bijective binary transducers with finitary description despite infinite state set. CIAA 2005. Lecture Notes Computer Science, volume 3854, pp. 356–357. Springer, Berlin, 2006.
[31] and , Simultaneous Diophantine approximation of formal power series: the asymptotic distribution of the linear complexity of multisequences. Project FONDECYT, 1040975 manuscript 8, 2006.Google Scholar
[32] and , The asymptotic normalized linear complexity of multisequences. J. Complexity 24(3), 410–422, 2008.Google Scholar
[33] and , The linear complexity deviation of multisequences: formulae for finite lengths and asymptotic distributions. SETA 2012, Int. Conf. on Sequences and their Applications. Lecture Notes in Computer Science, volume 7280, pp. 168–180. Springer, Berlin, 2012.
[34] and , The characterization of all binary sequences with perfect linear complexity profile. Presented at EUROCRYPT'86, Linköping, 1986. www.isiweb.ee.ethz.ch/archive/massey_pub/pdf/BI959.pdf.
[35] and , Enumeration results on the joint linear complexity of multisequences. Finite Fields Appl. 12, 613–637, 2006.Google Scholar
[36] , and , On the lattice basis reduction multisequence synthesis algorithm. IEEE Trans. Inf. Theory 50, 2905–2910, 2004.Google Scholar