Secure pseudo-random linear binary sequences generators based on arithmetic polynoms
This work addresses security vulnerabilities in cryptographic systems for data protection, though it appears incremental as it builds on existing arithmetic methods.
The paper tackles the problem of securing pseudo-random binary sequence generators against hardware fault attacks by introducing a method based on linear polynomial arithmetic, which guarantees high security for cryptographic data protection tools.
We present a new approach to constructing of pseudo-random binary sequences (PRS) 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 use of linear polynomial arithmetic for the realization of systems of boolean characteristic functions of PRS' generators. "Arithmetizatio" 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.