Main Article Content


Based on an analytical study of the theory of m-sequences, a tool is developed to facilitate practicing engineers to either generate m-sequence for its application, or to test applied m-sequence, or both. The developed test–kit simulates all the properties of m-sequences including number of 1s and 0s, the run lengths, pulse periods as well as autocorrelation properties.  This simplified tool is developed using MATLAB–SIMULINK with required codes as well as desired blocks. The model is cost-effective and the output files of the generated SIMULINK models can be utilized in any software program or simulation procedures.


LFSR M- Sequence PN Codes Stream Cipher Run Length

Article Details


  1. AHMAD, A., AL-MUSHARAFI, M.J., AL-BUSAIDI, S., AL-NAAMANY, A., and JERVASE, J.A., 2001. ‘An NLFSR Based Sequence Generator for Stream Ciphers’ Proceedings of Seta01 (Sequences and Their Applications - an International Conference, held at Norway in May’ 2001), pp. 11-12
  2. BAKER, W.G., ‘Cryptanalysis of Shift-Register Generated Stream Cipher Systems,’ Aegean Park Press, 1984.
  3. BLUM, L., BLUM, M., and SHUB, M., 1986. ‘A Simple Unpredictable Pseudo-Random Number Generator,’ SIAM Journal on Computing, 15(2): .
  4. BLUM, L., BLUM, M., and SHUB, M., 1986. A Simple Unpredictable Pseudo-random Number Generator, SIAM Journal of Computing, 15(2): 364-383.b
  5. BRILLINGER, DAVID., 1981. ‘Time Series: Data Analysis and Theory, Holden-Day.
  6. BROTHERTON-RATCLIFF, R., 1995. Using Quasi-Random Sequences in Monte-Carlo Valuation of Path–Dependent Options’, Risk Magazine, December 1994, and also in Canadian Treasure, 11(2): 36-38.
  7. CHEN, H.W., AINE, C.J.E., BEST, D., RANKEN, HARRISON, R.R., FLYNN, E.R. and WOOD, C.C., 1996. ‘Nonlinear Analysis of Biological Systems Using Short m-sequences and Sparse-Simulation Techniques’, Annals of Biomedical Engineering, 24: 513-536.
  8. DAVIS, D., IHAKA, R., and FENSTERMACHER, P., 1994. ‘Cryptographic Randomness from Air Turbulence in Disk Drives, Advances in Cryptology – Crypto-94, Springer-Verlag Lecture Notes in Computer Science No. 839.
  9. DIFFIE W., and HELLMAN, M.E., 1996. ‘New Directions in Cryptography,’ IEEE Transactions on Information Technology.
  10. ENTACHER, K., and LEEB, H., 1995. ‘Inversive pseudorandom number generators: empirical results. In Proceedings of the Conference Parallel Numerics 95, Sorrento, Italy, September 27-29, 1995, pp 15-27.
  11. GEFFE, P.R, 1973. ‘How to protect data with Ciphers that are really hard to break’, Electronics.
  12. GLAISE, R.J., ‘A Two-Step Computation of Cyclic Redundancy Code CRC-32 For ATM Networks’, IBM Journal, 41( 6) –Non-Topical Issue, 1997.
  13. GOLIC, J.D., 1998.‘Recent advances in stream cipher cryptanalysis,’ Publications de L’Institut Mathematique, 64/78: 183-204.
  14. GOLIC, J.D., May 2000. Cryptanalysis of Three Mutually Clock-Controlled Stop/Go Shift Registers’, IEEE Transactions on Information Technology, 46(3):1081-1090.
  15. GOLOMB, S.W. 1982.‘Shift Register Sequences, Aegean Park Press, Revised Edition.
  16. KNUTH, D.E., 1982. ‘The Art of Computer Programming, Volume 2: Semi numerical Algorithms, Chapter 3: Random Numbers. Addison Wesley Publishing Company, Second Edition.
  17. KONHEIM, A.G., 1981. ‘Cryptography: A Primer,’ A Wiley-Inter-science Publication, John Wiley & Sons.
  18. KRAWCZYK, H., 1992. ‘How to Predict Congruential Generators, Journal of Algorithms,’ 13(4) December.
  19. L’ECUYER, P., 1992. Testing Random Number Generators , Proceedings of the 1992 Winter simulation Conference, IEEE press, pp. 305-313.
  20. MASSEY, J.L., 1969. Shift register synthesis and BCH Decoding’, IEEE Transactions On Information Technology, Vol. IT-15.
  21. MEYER, C.H., and MATYAS, S.M., ‘Cryptography: A New Dimension in Computer Data Security,’ A Wiley-Inter-science Publication, John Wiley & Sons, 1982.
  22. MICALI, S., and SCHNORR, C.P., 1991. Efficient, Perfect Polynomial Random Number Generators,’ Journal of Cryptology, 3: 157-172.
  23. MOORE, L., $600,000 put aside for keno winner, The Gazette, Montreal, April 23, 1994, page A6.
  24. NEUMANN, V., 1963. ‘Various techniques used in connection with random digits,’ von Neumann's Collected Works, Vol. 5, Pergamon Press.
  25. NEWBRIDGE MICROSYSTEMS, 1992. RBG1210 Random Bit Generator, data sheet published in Newbridge Microsystems’ 3rd issue of CMOS Products data book, Newbridge Microsystems, Kanata, Ontario, Canada.
  26. PLESS, V.S., 1977. ‘Encrypting Schemes for Computer Confidentiality’, IEEE Trans. On Computer, Vol. C-26, No. 11.
  27. RUEPPEL, R.A., 1986. Analysis and Design of Stream Ciphers. New York, NY: Springer.
  28. RUEPPEL, R.A., 1991. ‘Stream Ciphers in Contemporary Cryptography: The Science of Information Integrity, Editor – G. Simmons, IEEE Press, 1991, pp. 65-134.
  29. SCHNEIER, B., 1996. ‘Applied Cryptography: Protocols, Algorithms, and Source Code in C,’ John Wiley & Sons.
  30. SIEGENTHALER, T. 1985. ‘Decrypting a class of Stream Ciphers Using Ciphertext Only’, IEEE Trans. On Computer, Vol. C-34, No.’1.
  31. SHANNON, C.E., 1963. ‘The Mathematical Theory of Communication,’ University of Illinois Press. (Originally from: Bell System Technical Journal, July and October 1948).
  32. TAUSWORTHE, R.C., 1965.Random numbers generated by linear recurrence modulo two, Mathematics of Computation, 19: 201-209.
  33. VATTULAINEN, I., ALA-NISSILA, T., and KANKAALA, K., 1994. Physical tests for Random Numbers in Simulations, Physical Review Letters, Vol. 73, Number 19, 7, pp. 2513-2516.
  34. WEIZHENG WANG, 1997. ‘SIMULINK (User’s Guide – Version 2),’ the MathWorks, Inc.