메뉴 건너뛰기




Volumn 76, Issue 1-2, 2000, Pages 67-73

On the linear complexity of the sequences generated by nonlinear filterings

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; CRYPTOGRAPHY; DATA PRIVACY; DATA STRUCTURES; SECURITY OF DATA;

EID: 0343442480     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00117-4     Document Type: Article
Times cited : (11)

References (10)
  • 3
    • 0033548341 scopus 로고    scopus 로고
    • On the general classification of nonlinear filters of m -sequences
    • García-Villalba L.J., Fúster-Sabater A. On the general classification of nonlinear filters of m -sequences. Inform. Process. Lett. Vol. 69:1999;227-232.
    • (1999) Inform. Process. Lett. , vol.69 , pp. 227-232
    • García-Villalba, L.J.1    Fúster-Sabater, A.2
  • 5
    • 0015064669 scopus 로고
    • Generation of binary sequences with controllable complexity
    • Groth E.J. Generation of binary sequences with controllable complexity. IEEE Trans. Inform. Theory. Vol. IT-17:1971;288-296.
    • (1971) IEEE Trans. Inform. Theory , vol.17 , pp. 288-296
    • Groth, E.J.1
  • 6
    • 0017017134 scopus 로고
    • An analysis of the structure and complexity of nonlinear binary sequence generators
    • Key E.L. An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Trans. Inform. Theory. Vol. IT-22:(6):1976;732-736.
    • (1976) IEEE Trans. Inform. Theory , vol.22 , Issue.6 , pp. 732-736
    • Key, E.L.1
  • 7
    • 0020849105 scopus 로고
    • Bounds on the linear span of bent sequences
    • Kumar P.V., Scholtz R.A. Bounds on the linear span of bent sequences. IEEE Trans. Inform. Theory. Vol. IT-29:1983;854-862.
    • (1983) IEEE Trans. Inform. Theory , vol.29 , pp. 854-862
    • Kumar, P.V.1    Scholtz, R.A.2
  • 9
    • 0000937205 scopus 로고
    • A Fourier transform approach to the linear complexity of nonlinearly filtered sequences
    • Berlin: Springer
    • Massey J.L., Serconek S. A Fourier transform approach to the linear complexity of nonlinearly filtered sequences. Advances in Cryptology - CRYPTO'94. Lecture Notes in Computer Science. Vol. 839:1994;332-340 Springer, Berlin.
    • (1994) Advances in Cryptology - CRYPTO'94 Lecture Notes in Computer Science , vol.839 , pp. 332-340
    • Massey, J.L.1    Serconek, S.2


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