Недвійкові криптографічні функції для генерації блоків підстановок симетричних шифрів

doi:10.26565/2519-2310-2019-4-06

Микита Гончаров V. N. Karazin Kharkiv National University https://orcid.org/0000-0002-9790-7260
Тетяна Кузнецова V. N. Karazin Kharkiv National University https://orcid.org/0000-0001-6154-7139
Олександр Кузнецов V. N. Karazin Kharkiv National University https://orcid.org/0000-0003-2331-6326

DOI: https://doi.org/10.26565/2519-2310-2019-4-06

Keywords: Symmetric cryptoalgorithm, Nonlinearity replacement nodes, Nonlinearity; Autocorrelation, Spectrum transformation, Cryptographic function, Simulated annealing, Cost function

Abstract

In the paper considers the traditional way of describing S-blocks through a set of component Boolean functions.non-binary functions were used to represent s-blocks compactly and formalize the method of generating them. Some results of computational search for S-blocks were presented using the proposed approach, where the generated S-blocks have improved properties based on non-linearity and autocorrelation indicators.

Downloads

Download data is not yet available.

Author Biographies

Микита Гончаров, V. N. Karazin Kharkiv National University

Computer science student

Тетяна Кузнецова, V. N. Karazin Kharkiv National University

Researcher

Олександр Кузнецов, V. N. Karazin Kharkiv National University

Doctor of Sciences (Engineering), Full Prof., Academician of the Academy of Applied Radioelectronics Sciences

References

Сорока Л.С. Вероятностная модель формирования нелинейных узлов замен для симметричных криптографических средств защиты информации / Сорока Л.С., Кузнецов А.А., Московченко И.В., Исаев С.А. // Системи обробки інформації. – Х.:ХУВС, 2009. - № 3 (77). – С. 101-104.

O’Connor L. An analysis of a class of algorithms for S-box construction / O’Connor L. // J. Cryptology/. -1994. – P. 133-151.

Сорока Л.С. Исследование вероятностных методов формирования нелинейных узлов замен / Сорока Л.С., Кузнецов А.А., Исаев С.А. // Системи обробки інформації. – 2011. - № 8 (98). – С. 113 – 122.

Булева функция [Електронний ресурс] // Режим доступу: http://ru.wikipedia.org/wiki/Булева_функция.

Dawson E. Designing Boolean functions for cryptographic applications / Dawson E., Millan W., Simpson L. // Contributions to General Algebra, Verlag Johannes Heyn, Klagenfurt. – 2000. – 12. – P. 1-22.

Clark J.A. Evolving Boolean functions satisfying multiple criteria / Clark J.A., Jacob J.L., Stepney S., Maitra S., Milan W. // Lecture Notes in Computer Science (2551), Springer, Berlin. – 2002. - 2251. - P. 246-259.

Parker M.G. Generalised S-Box Nonlinearity / Parker M.G. // NES/DOC/UIB/WP5/020/A. – 2003.

Millan W. How to improve the nonlinearity of bijective s-boxes / Millan W. // Information Security and Privacy, ACISP '98, Springer Verlag. – 1998. – volume 1438 of Lecture Notes in Computer Science. – P. 181-192.

Millan W. Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes / Millan W., Burnett L., Carter G., Clark A., Dawson E. // Information and communication security, Springer, Heidelberg. – 1999. – Lecture Notes in Computer Science Volume 1726. – P.263-274.

Clark J.A. The Design of S-Boxes by Simulated Annealing / Clark J.A., Jacob J.L., Stepney S. // New Generation Computing. – 2005. – 23(3). – P.219–231.

Laskari C. Utilizing Evolutionary Computation Methods for the Design of S-Boxes / Laskari C., Meletiou C., Vrahatis N. // Computational Intelligence and Security. – 2006. – Volume 2. – P.1299-1302.

Tesar P. A new method for generating high non-linearity S-Boxes / Tesar P. // Radioengineering. – 2010. - Part I of II, Vol. 19 Issue 1. – P.23 -26.

Kavut S. Improved Cost Function in the Design of Boolean Functions Satisfying Multiple Criteria / Kavut S., Yücel M.D. // Proc. INDOCRYPT. – 2003. – P.121-134.

Kwangjo K. Securing DES S-Boxes against Three Robust Cryptanalysis / Kwangjo K., Sangjin L., Sangjoon P., Daiki L. // Proceedings of the Workshop on Selected Areas in Cryptography, SAC '95. – 1995. – P.145-157.