메뉴 건너뛰기




Volumn 24, Issue 2, 2008, Pages 144-153

Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences

Author keywords

Joint linear complexity profile; Marsaglia's lattice test; Multisequences; Successive minima

Indexed keywords

LINEAR ALGEBRA; MATHEMATICAL MODELS; PROBLEM SOLVING;

EID: 40749091255     PISSN: 0885064X     EISSN: 10902708     Source Type: Journal    
DOI: 10.1016/j.jco.2007.07.001     Document Type: Article
Times cited : (5)

References (22)
  • 1
    • 84968491617 scopus 로고
    • On the distribution of k-dimensional vectors for simple and combined Tausworthe sequences
    • S11-S16
    • Couture R., L'Ecuyer P., and Tezuka S. On the distribution of k-dimensional vectors for simple and combined Tausworthe sequences. Math. Comp. 60 (1993) 749-761 S11-S16
    • (1993) Math. Comp. , vol.60 , pp. 749-761
    • Couture, R.1    L'Ecuyer, P.2    Tezuka, S.3
  • 2
    • 33646822759 scopus 로고    scopus 로고
    • Analysis and design issues for synchronous stream ciphers
    • Niederreiter H. (Ed), World Scientific, Singapore
    • Dawson E., and Simpson L. Analysis and design issues for synchronous stream ciphers. In: Niederreiter H. (Ed). Coding Theory and Cryptology (2002), World Scientific, Singapore 49-90
    • (2002) Coding Theory and Cryptology , pp. 49-90
    • Dawson, E.1    Simpson, L.2
  • 3
    • 35048852988 scopus 로고    scopus 로고
    • Lattice profile and linear complexity profile of pseudorandom number sequences
    • Mullen G.L., Poli A., and Stichtenoth H. (Eds), Springer, Berlin
    • Dorfer G. Lattice profile and linear complexity profile of pseudorandom number sequences. In: Mullen G.L., Poli A., and Stichtenoth H. (Eds). Finite Fields and Applications, Lecture Notes in Computer Science vol. 2948 (2004), Springer, Berlin 69-78
    • (2004) Finite Fields and Applications, Lecture Notes in Computer Science , vol.2948 , pp. 69-78
    • Dorfer, G.1
  • 4
    • 13844269177 scopus 로고    scopus 로고
    • Counting functions and expected values for the lattice profile at n
    • Dorfer G., Meidl W., and Winterhof A. Counting functions and expected values for the lattice profile at n. Finite Fields Appl. 10 (2004) 636-652
    • (2004) Finite Fields Appl. , vol.10 , pp. 636-652
    • Dorfer, G.1    Meidl, W.2    Winterhof, A.3
  • 5
    • 0038680378 scopus 로고    scopus 로고
    • Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
    • Dorfer G., and Winterhof A. Lattice structure and linear complexity profile of nonlinear pseudorandom number generators. Appl. Algebra Engrg. Comm. Comput. 13 (2003) 499-508
    • (2003) Appl. Algebra Engrg. Comm. Comput. , vol.13 , pp. 499-508
    • Dorfer, G.1    Winterhof, A.2
  • 6
    • 13844298613 scopus 로고    scopus 로고
    • Lattice structure of nonlinear pseudorandom number generators in parts of the period
    • Niederreiter H. (Ed), Springer, Berlin
    • Dorfer G., and Winterhof A. Lattice structure of nonlinear pseudorandom number generators in parts of the period. In: Niederreiter H. (Ed). Monte Carlo and Quasi-Monte Carlo Methods 2002 (2004), Springer, Berlin 199-211
    • (2004) Monte Carlo and Quasi-Monte Carlo Methods 2002 , pp. 199-211
    • Dorfer, G.1    Winterhof, A.2
  • 7
    • 40749161560 scopus 로고    scopus 로고
    • ECRYPT stream cipher project; available at: 〈http://www.ecrypt.eu.org/stream〉.
    • ECRYPT stream cipher project; available at: 〈http://www.ecrypt.eu.org/stream〉.
  • 8
    • 40749139958 scopus 로고    scopus 로고
    • F.-W. Fu, H. Niederreiter, On the counting function of the lattice profile of periodic sequences, J. Complexity, to appear.
    • F.-W. Fu, H. Niederreiter, On the counting function of the lattice profile of periodic sequences, J. Complexity, to appear.
  • 9
    • 84937412475 scopus 로고    scopus 로고
    • Exploiting multiples of the connection polynomial in word-oriented stream ciphers
    • Okamoto T. (Ed), Springer, Berlin
    • Hawkes P., and Rose G.G. Exploiting multiples of the connection polynomial in word-oriented stream ciphers. In: Okamoto T. (Ed). Advances in Cryptology-ASIACRYPT 2000, Lecture Notes in Computer Science vol. 1976 (2000), Springer, Berlin 303-316
    • (2000) Advances in Cryptology-ASIACRYPT 2000, Lecture Notes in Computer Science , vol.1976 , pp. 303-316
    • Hawkes, P.1    Rose, G.G.2
  • 10
    • 0020733320 scopus 로고
    • Factoring multivariate polynomials over finite fields
    • Lenstra A.K. Factoring multivariate polynomials over finite fields. J. Comput. System Sci. 30 (1985) 235-248
    • (1985) J. Comput. System Sci. , vol.30 , pp. 235-248
    • Lenstra, A.K.1
  • 11
    • 0010034194 scopus 로고
    • An analogue to Minkowski's geometry of numbers in a field of series
    • Mahler K. An analogue to Minkowski's geometry of numbers in a field of series. Ann. of Math. 42 (1941) 488-522
    • (1941) Ann. of Math. , vol.42 , pp. 488-522
    • Mahler, K.1
  • 12
    • 0001240132 scopus 로고
    • The structure of linear congruential sequences
    • Zaremba S.K. (Ed), Academic Press, New York
    • Marsaglia G. The structure of linear congruential sequences. In: Zaremba S.K. (Ed). Applications of Number Theory to Numerical Analysis (1972), Academic Press, New York 249-285
    • (1972) Applications of Number Theory to Numerical Analysis , pp. 249-285
    • Marsaglia, G.1
  • 13
    • 33645509119 scopus 로고    scopus 로고
    • Continued fraction for formal Laurent series and the lattice structure of sequences
    • Meidl W. Continued fraction for formal Laurent series and the lattice structure of sequences. Appl. Algebra Engrg. Comm. Comput. 17 (2006) 29-39
    • (2006) Appl. Algebra Engrg. Comm. Comput. , vol.17 , pp. 29-39
    • Meidl, W.1
  • 14
    • 31644434606 scopus 로고    scopus 로고
    • Enumeration results on linear complexity profiles and lattice profiles
    • Meidl W. Enumeration results on linear complexity profiles and lattice profiles. J. Complexity 22 (2006) 275-286
    • (2006) J. Complexity , vol.22 , pp. 275-286
    • Meidl, W.1
  • 15
    • 40749149216 scopus 로고    scopus 로고
    • W. Meidl, personal communication.
    • W. Meidl, personal communication.
  • 16
    • 33749650610 scopus 로고    scopus 로고
    • The probabilistic theory of the joint linear complexity of multisequences
    • Gong G., et al. (Ed), Springer, Berlin
    • Niederreiter H. The probabilistic theory of the joint linear complexity of multisequences. In: Gong G., et al. (Ed). Sequences and Their Applications-SETA 2006, Lecture Notes in Computer Science vol. 4086 (2006), Springer, Berlin 5-16
    • (2006) Sequences and Their Applications-SETA 2006, Lecture Notes in Computer Science , vol.4086 , pp. 5-16
    • Niederreiter, H.1
  • 17
    • 0036955497 scopus 로고    scopus 로고
    • Lattice structure and linear complexity of nonlinear pseudorandom numbers
    • Niederreiter H., and Winterhof A. Lattice structure and linear complexity of nonlinear pseudorandom numbers. Appl. Algebra Engrg. Comm. Comput. 13 (2002) 319-326
    • (2002) Appl. Algebra Engrg. Comm. Comput. , vol.13 , pp. 319-326
    • Niederreiter, H.1    Winterhof, A.2
  • 19
    • 0000930972 scopus 로고
    • Construction and estimation of bases in function fields
    • Schmidt W.M. Construction and estimation of bases in function fields. J. Number Theory 39 (1991) 181-224
    • (1991) J. Number Theory , vol.39 , pp. 181-224
    • Schmidt, W.M.1
  • 21
    • 8144230276 scopus 로고    scopus 로고
    • F [x]-lattice basis reduction algorithm and multisequence synthesis
    • Wang L.-P., and Zhu Y.-F. F [x]-lattice basis reduction algorithm and multisequence synthesis. Sci. China Ser. F 44 (2001) 321-328
    • (2001) Sci. China Ser. F , vol.44 , pp. 321-328
    • Wang, L.-P.1    Zhu, Y.-F.2
  • 22
    • 8144226815 scopus 로고    scopus 로고
    • On the lattice basis reduction multisequence synthesis algorithm
    • Wang L.-P., Zhu Y.-F., and Pei D.-Y. On the lattice basis reduction multisequence synthesis algorithm. IEEE Trans. Inform. Theory 50 (2004) 2905-2910
    • (2004) IEEE Trans. Inform. Theory , vol.50 , pp. 2905-2910
    • Wang, L.-P.1    Zhu, Y.-F.2    Pei, D.-Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.