The shortest feedback shift register that can generate a given sequence

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

Volumn 435 LNCS, Issue , 1990, Pages 90-99

  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

CRYPTOGRAPHY; SHIFT REGISTERS;

ARBITRARY FINITE ALPHABET; FEEDBACK FUNCTIONS; FEEDBACK SHIFT REGISTER; LINEAR TIME; NEW THEORY; NONLINEAR FEEDBACK SHIFT REGISTERS; S-ALGORITHMS;

NONLINEAR FEEDBACK;

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

References (15)

1. R. Arratia, L. Gordon and M. S. Waterman. “An Extreme Value Theory for Sequence Matching”, The Annals of Statistics, vol. 14, no. 3, pp. 971-993, 1986.
2. 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.
3. D. W. Davies and W. L. Price. Security for Computer Networks, John Wiley & Sons, Inc., Chichester, 1984.
4. H. Fredricksen. “A survey of full-length nonlinear shift register cycle algorithms”, SIAM Rev., vol. 24, pp. 195-221, April 1982.
5. S. W. Golomb. Shift Register Sequences, Holden-Day Inc., San Francisco, 1967.
6. C. J. A. Jansen. Investigations On Nonlinear Streamcipher Systems: Construction and Evaluation Methods, PhD. Thesis, Technical University of Delft, Delft, 1989.
7. S. Karlin, G. Ghandour, F. Ost, S. Tavare and L. J. Korn. “New Approaches for Computer Analysis of Nucleic Acid Sequences”, Proc. Natl. Acad. Sci. USA, vol. 80, pp. 5660-5664, September 1983.
8. A. G. Konheim. Cryptography, John Wiley & Sons, Inc., New York, 1981.
9. A. Lempel and J. Ziv. “On the Complexity of Finite Sequences”, IEEE Trans. on Info. Theory, vol. IT-22, no. 1, pp. 75-81, January 1976.
10. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes, Amsterdam, North-Holland, 1978.
11. J. L. Massey. “Shift-Register Synthesis and BCH Decoding”, IEEE Trans. on Info. Theory, vol. IT-15, January 1969.
12. C. H. Meyer and S. M. Matyas. Cryptography: A New Dimension in Computer Data Security, John Wiley & Sons, New York, 1982.
13. E. M. McCreight. “A space-economical suffix tree construction algorithm”, JACM, vol. 23, no. 2, pp. 262-272, April 1976.
14. R. A. Rueppel. New Approaches to Stream Ciphers, PhD. Thesis, Swiss Federal Institute of Technology, Zurich, 1984.
15. C. E. Shannon. “Communication Theory of Secrecy Systems”, Bell Systems Technical Journal, vol. 28, pp. 656-715, October 1949.