On the linear consistency test (LCT) in cryptanalysis with applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 435 LNCS, Issue , 1990, Pages 164-174

  Zeng, Kencheng ^a   Yang, C H ^b   Rao, T R N ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b UNIVERSITY OF LOUISIANA AT LAFAYETTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR ALGEBRA; LINEAR EQUATIONS;

COEFFICIENT MATRIX; LINEAR CONSISTENCIES; MULTIPLE SPEED; SYSTEM OF LINEAR ALGEBRAIC EQUATIONS;

CRYPTOGRAPHY;

EID: 0346602660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/0-387-34805-0_16     Document Type: Conference Paper

References (7)

1. Martin E. Hellman, Ehud D. Karnin, Justin Reyneri, On the Necessity of Cryptanalytic Exhaustive Search, ACM SIGACT, Vol. 18, No. 2, 1984, pp. 40-44.
2. C.H. Yang, Kencheng Zeng, and T.R.N. Rao, An Improved Linear Syndrome Algorithm in Cryptanalysis with Applications, to appear.
3. Sylvia M. Jennings, A Special Class of Binary Sequences, University of London, 1980, Ph.D. Thesis.
4. James L. Massey and Rainer A. Rueppel, Linear Ciphers and Random Sequence Generators with Multiple Clocks, EUROCRYPT 84, 1984, pp. 74-87.
5. A. Adrian Albert, Fundamental Concepts of Higher Algebra, University of Chicago Press, 1956.
6. W.G. Chambers, Clock-controlled shift registers in binary sequence generators, Proc. IEE, Pt. E., Jan. 1988, pp. 17-24.
7. Whitfield Diffie, Martin E. Hellman, Privacy and Authentication: An Introduction to Cryptography, Proc. IEEE, Mar. 1979, pp. 397-427.