Secure pseudo-random linear binary sequences generators based on arithmetic polynoms

TL;DR

This paper introduces a novel cryptographic pseudo-random binary sequence generator utilizing linear polynomial arithmetic, enhancing security against hardware faults and attacks through mathematical residue systems for error control.

Contribution

It proposes a new method for secure PRS generation based on arithmetic polynomials, improving fault tolerance and security in cryptographic applications.

Findings

Enhanced security against hardware errors

Mathematical residue systems enable error control

Improved cryptographic data protection

Abstract

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.