Three-level cryptographic system for block data encryption
DOI:
https://doi.org/10.3103/S0735272710070058Keywords:
data protection, block data encryption, m-shift, decimation, scramblingAbstract
It is proposed three-level iterative cryptosystem for block data encryption, where three procedures of (block) encryptic protection: multi-loop m-shift, decimation and scrambling, are applied at each iteration. Cryptographic system is characterized by analytically proved practical stability and several promising properties.
References
B. Sklar, Digital Communications: Fundamentals and Applications, 2nd ed. (Prentice-Hall, New Jersey, 2001; Izdat. dom “Williams,” Moscow, 2003).
P. Roele, “The Design of Composite Permutations with Applications to DES–Like S–Boxes, Designs,” DESI 42, No. 1, 21 (2007).
H. Saputra, N. Vijaykrishnan, M. Kandemir, et al., “Masking the Energy Behavior of DES Encryption,” IEEE Computer Society, No. 1, 10084 (2003).
A. M. Trakhtman and V. A. Trakhtman, Basic Principles of Discrete Signals Theory at Finite Interval (Sov. Radio, Moscow, 1975) [in Russain].
V. I. Zhuravlyov and A. B. Tsaryov, “Application of Decimation and Redecimation Properties of M-sequence in Radio Engineering System,” Radiotekhnika, No. 10, 8 (1990).
O. I. Lagutenko, Modems. User’s Handbook (Lan’, St. Petersburg, 1997) [Russian translation].
C. E. Shannon, “A Mathematical Theory of Communication,” Bell Sys. Tech. J. 27, 379 (1948).
M. I. Mazurkov and V. Ya. Chechel’nitskii, “The Classes of Equivalent and Generative Perfect Binary Arrays for CDMA-Technologies,” Izv. Vyssh. Uchebn. Zaved., Radioelektron. 46(5), 54 (2003); Radioelectron. Commun. Syst. 46(5), 45 (2003).
M. I. Mazurkov, V. Ya. Chechel’nitskii and P. Murr, “Information security method based on perfect binary arrays,” Izv. Vyssh. Uchebn. Zaved., Radioelektron. 51(11), 53 (2008) [Radioelectron. Commun. Syst. 51(11), 612 (2008)].
