Secure pseudo-random linear binary sequences generators based on arithmetic polynoms
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2014
- DOI:
- 10.48550/arXiv.1409.2248
- arXiv:
- arXiv:1409.2248
- Bibcode:
- 2014arXiv1409.2248F
- Keywords:
-
- Computer Science - Cryptography and Security;
- 94C10;
- 94A60;
- 11K45;
- 11A07
- E-Print:
- Advances in Intelligent Systems and Computing (Pomeranian Univ Technol, Fac Comp Sci, Miedzyzdroje, POLAND, OCT 22-24, 2014), Soft Computing in Computer and Information Science, 342