ORTHOGONAL NOISE-LIKE SIGNAL SYMBOLS FOR BROADBAND CHANNEL PROTECTION

The paper deals with development and analysis of particular case in a complex protection for a channel where radio messages are exchanged on the basis of mutually orthogonal signal broadband characters and alphabets based on them. The object of study is a method of secure broadband channel organization using orthogonal noise-like signal symbols. The signal broadband symbols have been synthesized in the frequency domain based on pseudo-random sequences with the subsequent orthogonalization by the Gram-Schmidt method of transformation into pre-defined spectral components of the signal symbols and subsequent transformation into the time domain with the aid of the inverse fast Fourier transform. We have proposed to deploy and explore the complex secrecy approach comprising information, structural and energy secrecies. Information secrecy is brought into action with a single use of symbols retrieved out of a certain set of alphabets. Structural secrecy is reached by deployment of signal messages filtering in the area of signal symbols merge that makes difficult to determine the duration of individual signal symbols and message separation in individual signal symbols. Therefore, the decoding of entire message becomes more difficult. Energy secrecy is ensured by hiding the radio signal in the radio noise. We have carried out modeling and analysis of information, structural and energy secrecy. Practical importance of the work lies in increasing the level of protection for broadband communication channels based of the method we proposed.  The conclusions have been set up in final part of the paper.

1. Radzievskiy A.G. Modern Electronic Warfare. Methodology. Moscow, Radiotehnika Publ., 2006, 424 p. (in Russian)
2. Tsvetnov V.V., Demin V.P., Kupriyanov A.I. Electronic Warfare. Radio Radioprospecting and Radio Resistance. Moscow, MAI Publ., 1998, 248 p. (in Russian)
3. Balaban P., Jeruchim M.C., Shanmugan K.S. Simulation of Communication Systems. NY,Plenum Press, 1992, 750 p.
4. Grishentcev A. Yu., Korobeinikov A.G. Application of several wavelets for generating wideband signals. Journal of Instrument Engineering, 2017, vol. 60, no. 8, pp. 712–720. (in Russian)doi: 10.17586/0021-3454-2017-60-8-712-720
5. Grishentcev A.Yu., Elsukov A.I. Adaptive synchronization in hidden broadband systems.Scientific and Technical
   Journal of Information Technologies, Mechanics and Optics, 2017, vol. 17, no. 4, pp. 640–650 (in Russian). doi:
   10.17586/2226-1494-2017-17-4-640-650
6. Grishentsev A.Yu., Korobeinikov A.G. Algorithm of search, some properties and application of matrices with complex values of elements for steganography and synthesis of broadband signals. Zhurnal Radioelektroniki, 2016, no. 5, p. 9. (in Russian)
7. Makarenko S.I., Ivanov M.S., Popov S.A. Interference Immunity of Pseudo-Random Frequency Tuning Systems. St. Petersburg, Svoe Izdatel'stvo Publ., 2013, 166 p. (in Russian)
8. Grishentsev A.Yu. On the method of synthesis and application of broadband noise-like signals in the task organization of protected communication channels. Radioengineering, 2017, no. 9, pp. 91–101. (in Russian)
9. Grishentsev A.Yu. Synthesis method for alphabets of orthogonal signaling broadband communications.Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2018, vol. 18, no. 6, pp. 1074–1083 (in Russian). doi: 10.17586/2226-1494-2018-18-6-1074-1083
10. Grishentsev A.Yu., Korobeinikov A.G., Elsukov A.I. The study and analysis of some properties of the alphabets on the basis of the mutually orthogonal broadband signals. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2019, vol. 19, no. 1. (in press)
11. Thomson J.J. On the structure of the atom: an investigation of the stability and periods of oscillation of a number of corpuscles arranged at equal intervals around the circumference of a circle; with application of the results to the theory of atomic structure. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, Series 6, 1904, vol. 7, no. 39,
    pp. 237–265. doi: 10.1080/14786440409463107
12. Jaynes E.T. Probability Theory: The Logic of Science. Cambridge University Press, 2003, 758 p.
13. Suzuki K., Tonien D., Kurosawa K., Toyota K. Birthday paradox for multi-collisions. Lecture Notes in Computer Science, 2006, vol. 4296, pp. 29–40. doi: 10.1007/11927587_5
14. Mathis F.H. A generalized birthday problem. SIAM Review, 1991, vol. 33, no. 2, pp. 265–270. doi: 10.1137/1033051
15. Conway J.H., Sloane N.J.A. Sphere Packing, Lattices and Groups. Springer, 1988.
16. Barker E. Recommendation for Key Management. Part 1: General, 2016, 53 p. doi: 10.6028/nist.sp.800-57pt1r4
17. Panasenko S.A. Encryption Algorithms. Special Handbook. St. Petersburg, BKhV-Peterburg Publ., 2009, 576 p. (in Russian)
18. Dinur I., Dunkelman O., Shamir A. Improved attacks on full GOST. Lecture Notes in Computer Science, 2012, vol. 7549, pp. 9–28.doi: 10.1007/978-3-642-34047-5_2
19. Lyons R.G. Understanding Digital Signal Processing. Prentice Hall PTR, 2001, 538 p.
20. Telatar E. Capacity of multi-antenna Gaussian channels. European Transactions on Telecommunications, 1999, vol. 10, no. 6, pp. 585–596. doi: 10.1002/ett.4460100604
21. Ipatov V.P. Spread Spectrum and CDMA. Principles and Applications. Wiley, 2004, 396 p.
22. Proakis J.G. Digital Communications. 4^th ed. McGraw-Hill, 2001, 938 p.
23. Yakovlev O.I., Yakubov V.P., Uryadov V.P., Pavel'ev A.G. Radiowaves Spread. Moscow, Lenand Publ., 2009, 496 p.
    (in Russian)
24. Ziemer R.E., Peterson R.L. Introduction to Digital Communication. Prentice-Hall, Upper Saddle River, 2000, 464 p.

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License