Quick key sequences generator based on cellular automata

Authors

  • A. V. Sokolov Odessа Polytechnic National University

DOI:

https://doi.org/10.15276/opu.1.43.2014.31

Keywords:

key sequence, cellular automata, bent function, sequence with the property of k-gram distribution

Abstract

One of the most effective modern approaches to the problem of stream encryption used for generation of pseudo-random key sequences is based on the Boolean functions mathematical instrument. A new design of the pseudo-random key sequences generator based on cellular automata and such perfect algebraic structures as bent functions and sequences with the property of k-gram distribution is proposed. It is shown that new generator generates a highly nonlinear and good stochastic quality pseudo-random key sequences compared with the existing high-speed generators, and have a simple program implementation. Thus, the proposed pseudo-random key sequences generator can be recommended for use in modern cryptographic applications, for example, stream encryption algorithms which require high-quality pseudo-random key sequences.

Downloads

Download data is not yet available.

Author Biography

A. V. Sokolov, Odessа Polytechnic National University

магістр

References

Рябко, Б.Я. Основы современной криптографии и стеганографии / Б.Я. Рябко, А.Н. Фионов. - М.: Горячая линия - Телеком, 2010. - 232 с.

Агафонова, И.В. Криптографические свойства нелинейных булевых функций / И.В. Агафонова // Семинар по дискрет. гармон. анализу и геометр. моделированию. - СПб.: DHA CAGD, 2007. - С. 1 - 24.

Иванов, М.А. Теория, применение и оценка качества генераторов псевдослучайных последовательностей / М.А. Иванов, И.В. Чугунков. - М.: КУДИЦ-ОБРАЗ, 2003. - 238 с.

Мазурков, М.И. Генератор ключевых последовательностей на основе дуальных пар бент-функций / М.И. Мазурков, Н.А. Барабанов, А.В. Соколов // Пр. Одес. політехн. ун-ту. - 2013. - Вип. 3(42). - С. 150 - 156.

Szaban, M Cryptographically Strong S-Boxes Based on Cellular Automata / M. Szaban, F. Seredynski // Lecture Notes in Computer Science. - 2008. - Vol. 5191. - PP. 478 - 485.

Мазурков, М.И. Методы синтеза двоичных псевдослучайных последовательностей со свойством k-граммного распределения / М.И. Мазурков, А.В. Соколов // Пр. Одес. політехн. ун-ту. - 2012. - Вип. 1(38). - С. 188 - 198.

Agievich, S.V. On the representation of bent functions by bent rectangles / S.V. Agievich // Probabilistic Methods in Discrete Mathematics: Proc. of the Fifth Intern. Petrozavodsk Conf., Petrozavodsk, June 1–6, 2000. - Utrecht, Boston: VSP, 2002. - PP. 121 - 135.

Published

2014-02-21

How to Cite

[1]
Sokolov, A.V. 2014. Quick key sequences generator based on cellular automata. Proceedings of Odessa Polytechnic University. 1(43) (Feb. 2014), 180–186. DOI:https://doi.org/10.15276/opu.1.43.2014.31.

Issue

Section

Computer and information networks and systems. Manufacturing automation