Abstract
We present a new approach to construction of pseudo-random binary sequences (PRBS) generators for the purpose of cryptographic data protection, secured from the perpetrator’s attacks, caused by generation of masses of hardware errors and faults. The new method is based on the use of linear polynomial arithmetic for the realization of systems of boolean characteristic functions of pseudo-random sequences (PRS) generators. “Arithmetization” of systems of logic formulas has allowed to apply mathematical apparatus of residue systems for multisequencing of the process of PRS generation and organizing control of computing errors, caused by hardware faults. This has guaranteed high security of PRS generator’s functioning and, consequently, security of tools for cryptographic data protection based on those PRSs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Forouzan, B.A.: Cryptography and Network Security. McGraw Hill (2008)
Schneier, B.: Applied Cryptography. Wiley, New York (1996)
Yang, B., Wu, K., Karri, R.: Scan based side channel attack on data encryption standard. Report 2004(324), 114–116 (2004)
Hetagurov, J.A., Prudnaya, Y.P.: Improving the reliability of digital devices redundant coding methods. Energiya, Moscow (1974)
Kelsey, J.: Protocol interactions and the chosen protocol attack. Security protocols. In: 5th International Workshop, pp. 91–104, Springer New York. (1996)
Ortega, J.M.: Introduction to Parallel & Vector Solution of Linear Systems. Plenum Press, New York (1988)
Shmerko, V.P.: Malyugin’s theorems: a new concept in logical control, VLSI design, and data structures for new technologies. Autom. Remote. Control. 65(6), 893–912 (2004). June
Finko, O.A.: Large systems of boolean functions: realization by modular arithmetic methods. Autom. Remote. Control. 65(6), 871–892 (2004). June
Garner, H.L.: Number systems and arithmetic. Adv. Comput. 6, 131–194 (1965)
Omondi, A., Premkumar, B.: Residue Number System: Theory and Implementation. Imperial College Press, London (2007)
Soderstrand, M.A., Jenkins, W.K., Jullien, G.A., Tailor, F.J.: Residue Number System Arithmetic: Modern Application in Digital Signal Processing. IEEE Press, New York (1986)
Jenkins, W.K.: The design of error checkers for self-checking residue number arithmetic. IEEE Trans. Comput. 4, 388–396 (1983)
Finko, O.A., Vishnevsky, A.K.: Parallel realization of systems of substitutions by numerical polynoms. In: Papers of the 5th International Conference Parallel Computing and Control Problems, pp. 935–943. Moscow (2010)
Finko, O.A., Vishnevsky, A.K.: Standard function hybrid cryptosystem arithmetic and logical multinomial realization. Theory and Techniques of Radio, pp. 32–38. Voronezh (2011)
Finko, O.A., Dichenko, S.A., Eliseev, N.I.: Error function generator binary PRS control implemented on arithmetic polynomials. St. Petersburg State Polytechnical University J. Comput. Sci. Telecommun. Control Syst. 176(4), 142–149 (2013)
Krasnobaev, V.A.: Reliable model in the computer residue number system. Electron. Model. 7(4), 44–46 (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Finko, O., Dichenko, S. (2015). Secure Pseudo-Random Linear Binary Sequences Generators Based on Arithmetic Polynoms. In: Wiliński, A., Fray, I., Pejaś, J. (eds) Soft Computing in Computer and Information Science. Advances in Intelligent Systems and Computing, vol 342. Springer, Cham. https://doi.org/10.1007/978-3-319-15147-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-319-15147-2_24
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15146-5
Online ISBN: 978-3-319-15147-2
eBook Packages: EngineeringEngineering (R0)