On the significance of the directed acyclic word graph in cryptology

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

Volumn 453 LNCS, Issue , 1990, Pages 318-326

  Jansen, Cees J A ^a   Boekee, Dick E ^b  

^a PHILIPS RESEARCH LABORATORIES   (Germany)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); CRYPTOGRAPHY; NONLINEAR FEEDBACK; SHIFT REGISTERS;

CRYPTOLOGY; DIRECTED ACYCLIC WORD GRAPHS; LINEAR TIME; NONLINEAR FEEDBACK SHIFT REGISTERS; PERIODIC SEQUENCE; S-ALGORITHMS;

DIRECTED GRAPHS;

EID: 34247529748     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0030372     Document Type: Conference Paper

References (5)

1. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler and R. McConnell. “Linear Size Finite Automata for the Set of all Subwords of a Word: An Outline of Results”, Bul. Eur. Assoc. Theor. Comp. Sci., no. 21, pp. 12-20, 1983.
2. A. Blumer. “A Generalization of Run-Length Coding”, IEEE Intern. Symp. on Info. Theory 1985, Brighton, England, June 24-28, 1985.
3. N. G. de Bruijn. “A Combinatorial Problem”, Nederl. Akad. Wetensch. Proc., vol. 49, pp. 758-754, 1946.
4. C. J. A. Jansen. Investigations On Nonlinear Streamcipher Systems: Construction and Evaluation Methods, PhD. Thesis, Technical University of Delft, Delft, april 1989.
5. R. A. Rueppel. New Approaches to Stream Ciphers, PhD. Thesis, Swiss Federal Institute of Technology, Zurich, 1984.