Random Binary Sequences in Telecommunications

Slavko Šajić; Nebojša Maletić; Branislav M. Todorović; Milan Šunjevarić

doi:10.2478/jee-2013-0033

.blurhash-client-img { display: none !important; }

Random Binary Sequences in Telecommunications

Journal of Electrical Engineering

Volume 64 (2013): Issue 4 (June 2013)

By: Slavko Šajić, Nebojša Maletić, Branislav M. Todorović and Milan Šunjevarić

Open Access

|Aug 2013

Abstract

Realization of modern telecommunication systems is inconceivable without use of different binary sequences. In this paper, an overview of random binary sequences used in different telecommunication systems is given. Basic principles of pseudorandom, chaotic, and true random sequence generation are presented, as well as their application in telecommunications in respect to advantages and drawbacks of the same. Moreover, particular scheme for true random binary sequence generation is given, as well as results of randomness assessment obtained by NIST statistical test suite. Finally, short insight into importance of random binary sequence in secure communications is given.

References

[1] van TILBORG, H. C. A.-JAJODIA, S. (Eds.) : Encyclopedia of Cryptography and Security, Springer, 2011.10.1007/978-1-4419-5906-5
Search in Google Scholar
[2] TORRIERI, D. : Principles of Spread-Spectrum Communication Systems, Springer, 2005.
Search in Google Scholar
[3] GOLOMB, S. W. : Shift Register Sequences, Holden-Day Inc., San Francisco, 1967.
Search in Google Scholar
[4] SARVATE, D. V.-PURSLEY, M. B. : Crosscorrelation Properties of Pseudorandom and Related Sequences, Proc. of the IEEE 68 No. 5 (May 1980), 593-619.10.1109/PROC.1980.11697
Search in Google Scholar
[5] TAUSWORTHE, R. C. : Random Numbers Generated by Linear Recurrence Modulo Two, Mathematics of Computation 19 (1965), 201-209.10.1090/S0025-5718-1965-0184406-1
Search in Google Scholar
[6] LEWIS, T. G.-PAYNE, W. H. : Generalized Feedback Shift Register Pseudorandom Number Algorithm, Journal of the ACM 20 (1973), 456-468.10.1145/321765.321777
Search in Google Scholar
[7] LUBY, M. : Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996.10.1515/9780691206844
Search in Google Scholar
[8] BLACKLEDGE, J. : Cryptology, Fractals and Chaos, Woodhead Publishing, 2011.
Search in Google Scholar
[9] KOHDA, T.-TSUNEDA, A. : Pseudonoise Sequences by Chaotic Nonlinear Maps and their Correlation Properties, IEICE Trans. Commun. E76-B No. 8 (1993), 855-862.
Search in Google Scholar
[10] KOHDA, T.-TSUNEDA, A. : Statistics of Chaotic Binary Sequences, IEEE Trans. Inform. Theory 43 No. 1 (1997), 104-112.10.1109/18.567654
Search in Google Scholar
[11] SANG, T.-WANG, R.-YAN, Y. : Constructing Chaotic Discrete Sequences for Digital Communications based on Correlation Analysis, IEEE Trans. Signal Processing 48 No. 9 (2000), 2557-2565.10.1109/78.863058
Search in Google Scholar
[12] SETTI, G.-MAZZINI, G.-ROVATTI, R.-CALLEGARI, S. : Statistical Modeling of Discrete-Time Chaotic Processes-Basic Finite-Dimensional Tools and Applications, Proc. IEEE 90 No. 5 (2002), 662-690.10.1109/JPROC.2002.1015001
Search in Google Scholar
[13] HEIDARI-BATENI, G.-McGILLEM, C. D. : Chaotic Sequences for Spread Spectrum: An Alternative to PN-Sequences, Proc. IEEE Int. Conf. on Selected Topics in Wireless Communications (ICWC 92), Vancouver (Canada), 1992, pp. 437-440.
Search in Google Scholar
[14] HEIDARI-BATENI, G.-McGILLEM, D. : A Chaotic Direct- Sequence Spread-Spectrum Communication System, IEEE Trans. Commun. 42 No. 2/3/4 (1994), 1524-1527.10.1109/TCOMM.1994.582834
Search in Google Scholar
[15] MAZZINI, G.-ROVATTI, R.-SETTI, G. : Interference Minimization by Autocorrelation Shaping in Asynchronous DSCDMA Systems: Chaos-based Spreading is Nearly Optimal, Electronics Letters 35 (1999), 1054-1055.10.1049/el:19990754
Search in Google Scholar
[16] PARLITZ, U.-ERGEZINGER, S. : Robust Communication based on Chaotic Spreading Sequences, Phys. Lett. A 188 (1994), 146-150.10.1016/0375-9601(84)90009-4
Search in Google Scholar
[17] HORAN, D.-GUINEE, R. A. : A Novel Stream Cipher for Cryptographic Applications, Proc. of IEEE. Military Communications Conference (IEEE MILCOM 06), Washington DC, 2006, pp. 1-5.10.1109/MILCOM.2006.302106
Search in Google Scholar
[18] BLASZCZYK, M.-GUINEE, R. A. : A novel Modelled True Random Binary Number Generator for Key Stream Generation in Cryptographic Applications, Proc. of IEEE. Military Communications Conference (IEEE MILCOM 08),, San Diego, California, 2008, pp. 1-7.10.1109/MILCOM.2008.4753211
Search in Google Scholar
[19] BARDIS, N. G.-MARKOVSKYI, A. P.-DOUKAS, N.-KARADIMAS, N. V. : True Random Number Generation based on Environmental Noise Measurements for Military Applications, Proc. of the 8th WSEAS International Conference on Signal Processing, Robotics and Automation (ISPRA 09), Cambridge, UK, 2009, pp. 68-73.
Search in Google Scholar
[20] KANTER, I.-AVIAD, Y.-REIDLER, I.-COHEN, E.-ROSENBLUH, M. : An Optical Ultrafast Random Bit Generator, Nature Photonics 4 No. 1 (2010), 58-61.10.1038/nphoton.2009.235
Search in Google Scholar
[21] YALCIN, M. E.-SUYKENS, J. A. K.-VandeWALLE, J. : True Random Bit Generation from a Double-Scroll Attractor, IEEE Transactions on Circuits and Systems I: Regular Papers 51 No. 7 (2004), 1395-1404.10.1109/TCSI.2004.830683
Search in Google Scholar
[22] WILLIAMS, C. R. S.-SALEVAN, J. C.-LI, X.-ROY, R.- MURPHY, T. E. : Fast Physical Random Number Generator using Amplified Spontaneous Emission, Optics Express 18 No. 23 (2010), 23584.10.1364/OE.18.02358421164703
Search in Google Scholar
[23] LI, P.-WANG, Y. C.-ZHANG, J. Z. : All-Optical Fast Random Number Generator, Optics Express 18 No. 19 (2010), 20360.10.1364/OE.18.02036020940928
Search in Google Scholar
[24] LIU, Z.-PENG, D. : True Random Number Generator in RFID Systems Against Traceability, Proc. of IEEE Consumer Communications and Networking Conference (CCNC 06), Las Vegas, Nevada, 2006, pp. 620-624.
Search in Google Scholar
[25] MASSEY, J. L. : Shift-Register Synthesis and BCH Decoding, IEEE Trans. Inform. Theory 15 No. 1 (Jan 1969), 122-127.10.1109/TIT.1969.1054260
Search in Google Scholar
[26] GOLD, R. : Optimal Binary Sequences for Spread Spectrum Multiplexing, IEEE Trans. Inform. Theory IT-13 (1967), 619-621.10.1109/TIT.1967.1054048
Search in Google Scholar
[27] GOLD, R. : Maximal Recursive Sequences with 3-Valued Recursive Cross-Correlation Functions, IEEE Trans. Inform. Theory IT-14 (1968), 154-156.10.1109/TIT.1968.1054106
Search in Google Scholar
[28] KASAMI, T. : Weight Distribution Formula for some Class of Cyclic Codes, Tech. Report No. R-285, Univ. of Illinois, 1966.10.21236/AD0632574
Search in Google Scholar
[29] DINAN, E. H.-JABBARI, B. : Spreading Codes for Direct Sequence CDMA and Wideband CDMA Cellular Networks, IEEE Commun. Mag. 36 No. 9 (1998), 48-54.10.1109/35.714616
Search in Google Scholar
[30] GLISIC, S.-VUCETIC, B. : Spread Spectrum CDMA Systems for Wireless Communications, Artech House, Inc., Boston, 1997.
Search in Google Scholar
[31] GUIZANI, M. : Wireless Communication Systems and Networks, Kluwer Academic Publishers, Boston, 2004.10.1007/b105392
Search in Google Scholar
[32] DIXON, R. C. : Spread Spectrum Systems with Commercial Applications, John Wiley & Sons, Boston, 1994.
Search in Google Scholar
[33] ABU-RGHEFF, M. A. : Introduction to CDMA Wireless Communications, 1st ed, Elsevier, 2007.10.1016/B978-075065252-0.50002-8
Search in Google Scholar
[34] ADACHI, F.-SAWAHASHI, M.-OKAWA, O. : Three-Structured Generation of Orthogonal Spreading Codes with Different Length for Forward Link of DS-CDMA Mobile Radio, Electronic Letters 33 No. 1 (1997), 27-28.10.1049/el:19970022
Search in Google Scholar
[35] KADDOUM, G.-CHARGÉ, P.-ROVIRAS, D. : A Generalized Methodology for Bit-Error-Rate Prediction in Correlation- Based Communication Schemes using Chaos, IEEE Communications Letters 13 No. 8 (Aug 2009).10.1109/LCOMM.2009.090715
Search in Google Scholar
[36] MURRY, H. F. : A General Approach for Generating Natural Random Variables, IEEE Transactions on Computers (Dec 1970), 1210-1213.10.1109/T-C.1970.222860
Search in Google Scholar
[37] BUCCI, M.-GERMANI, L.-LUZZI, R.-TRIFILETTI, A.- VARANOUOVO, M. : A High-Speed Oscillator-based Truly Random Number Source for Cryptographic Applications on a Smart Card IC, IEEE Transactions on Computers 52 (Apr 2003), 403-409.10.1109/TC.2003.1190581
Search in Google Scholar
[38] GOV, N. C.-MIHCAK, F. K-ERGUN, S. : True Random Number Generation via Sampling From Flat Band-limited Gaussian Processes, IEEE Transactions on Circuits and Systems-I: Regular Papers 58 No. 6 (June 2011).10.1109/TCSI.2010.2089561
Search in Google Scholar
[39] YALCIN, M. E.-SUYKENS, J. K.-VANDEWALLE, J. : True Random Bit Generation from a Double Scroll Attractor, IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications 51 (July 2004), 1395-1404.10.1109/TCSI.2004.830683
Search in Google Scholar
[40] ŠAJIĆ, S.-TODOROVIĆ, B. M.-MALETIĆ, N. : True Random Binary Sequence Generator for Secure Communications, in Proc of 10th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services (TELSIKS’ 11), vol. 2, Niš, Oct 2011, pp. 723-726.10.1109/TELSKS.2011.6143213
Search in Google Scholar
[41] RUKHIN, A.et al : A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, National Institute of Standards and Technology (NIST), Special Publication 800-22, Revision 1a, April 2010.
Search in Google Scholar
[42] MARSAGLIA, G. : Diehard: a Battery of Tests of Randomness http://stat.fsu.edu/geo/diehard.html, 1996.
Search in Google Scholar
[43] GUSTAFSON, H. et al : A Computer Package for Measuring Strength of Encryption Algorithms, Journal of Computers & Security 13 No. 8 (1994), 687-697.10.1016/0167-4048(94)90051-5
Search in Google Scholar
[44] KNUTH, D. : The Art of Computer Programming, Seminumerical Algorithms, Vol. 2, 3rd edition, Addison Wesley, Reading, Massachusetts, 1998.
Search in Google Scholar
[45] STINSON, D. R. : Cryptography - Theory and Practice, CRC Press, Boca Raton, 1995.
Search in Google Scholar
[46] DIFFIE, W.-HELLMAN, M. E. : New Directions in Cryptography, IEEE Trans. Inform. Theory IT-22 (1976), 644-654.10.1109/TIT.1976.1055638
Search in Google Scholar
[47] MENEZES, A.-van OORSCHOT, P.-VANSTONE, S. : Handbook of Applied Cryptography, CRC Press, 1997.
Search in Google Scholar
[48] BENNETT, C. H.-BRASSARD, G. : Quantum Cryptography: Public Key Distribution and Coin Tossing, proc. IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, 1984, pp. 175-179.
Search in Google Scholar
[49] HRG, D.-BUDIN, L.-GOLUB, M. : Quantum Cryptography and Security of Information Systems, Proceedings of the 15th International Conference on Information and Intelligent Systems, IIS2004, Varaždin, Croatia, 2004.
Search in Google Scholar

Articles in this issue

DOI: https://doi.org/10.2478/jee-2013-0033 | Journal eISSN: 1339-309X | Journal ISSN: 1335-3632

Journal RSS Feed

Language: English

Page range: 230 - 237

Published on: Aug 24, 2013

Published by: Slovak University of Technology in Bratislava

In partnership with: Paradigm Publishing Services

Publication frequency: 6 issues per year

Keywords:

binary sequences,

pseudo-random sequences,

chaotic sequences,

true random sequence,

secure communication,

cryptography,

quantum cryptography

Related subjects:

Engineering,

Introductions and overviews,

Engineering, other

© 2013 Slavko Šajić, Nebojša Maletić, Branislav M. Todorović, Milan Šunjevarić, published by Slovak University of Technology in Bratislava
This work is licensed under the Creative Commons License.

Volume 64 (2013): Issue 4 (June 2013)