|
ИСТИНА |
Войти в систему Регистрация |
ФНКЦ РР |
||
Secure pseudo-random linear binary sequences generators based on arithmetic polynomsстатья
Информация о цитировании статьи получена из
Scopus
Дата последнего поиска статьи во внешних источниках: 16 февраля 2016 г.
- Авторы: Oleg Finko, Sergey Dichenko
- Сборник: Soft Computing in Computer and Information Science
- Серия: Advances in Intelligent Systems and Computing
- Том: 342
- Глава в коллективной монографии
- Год издания: 2015
- Место издания: Springer
- Первая страница: 279
- Последняя страница: 290
- DOI: 10.1007/978-3-319-15147-2_24
- Аннотация: 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.
- Добавил в систему: Финько Олег Анатольевич