A METHOD OF CONSTRUCTING A BLOCK CIPHERS ROUND FUNCTION’S POLYNOMIAL OVER A FINITE FIELD

Abstract

The work outlines the method of construction of round function as a polynomial of one variable over the finite field. The proposed method is based on the calculation of the initial cryptographic transformation at special points of the finite field and the subsequent inversion of Vandermonde matrix. For this class of matrices, there are algorithms for calculating the inverse matrix, which are much more efficient than the standard algorithm of inversion using the Gauss method. In the proposed work, the Traub algorithm is used. The computational complexity of Traub algorithm is proportional to the square of the size of a given matrix. The method is applicable to block iterative ciphers of special type (SP-network). For this type of ciphers, mathematical evaluations of algebraic parameters of polinomials of round functions over the finite fields are provided. Quantative values of estimations are calculated for Russian encryption standard "Kuznechik". The estimates of computational complexity of the proposed method are provided. The article contains practical results of estimations of work time for polynomials notation for finite fields of varying dimensions. The proposed method is used for explicit calculation of the polynomial of one variable over the finite field of round function of block cipher PRESENT.

Authors and Affiliations

Sergey Belov

Keywords

Related Articles

AUTOMATION OF DISTRIBUTION OF STUDENTS BETWEEN GRADUATE SUPERVISORS WITH APPLICATION OF TWO-SIDED MATCHING MODEL

The article deals with an approach for modeling and software support of distribution of students between graduate supervisors at large graduate department. The approach is based on the stable matching problem and the Gal...

DESIGN AND IMPLEMENTATION OF THE TRAINING AND CONTROL MODES OF THE EMULATOR FOR THE REFERENCE-TRAINING SYSTEM ON THE COURSE «THEORY OF ALGORITHMS»

This article deals with the design and implementation of the training and control modes of the emulator of Markov algorithms for the reference and training system for the course "Theory of algorithms". The analysis and c...

EXPERIMENTAL SOFTWARE FOR MODELING AND INTERPRETING EDUCATIONAL DATA ANALYSIS PROCESSES

Problems, tasks and processes of educational data mining are considered in this article. The objective is to create a fundamentally new information system of the University using the results educational data analysis. On...

STATE POLICY OF THE RUSSIAN FEDERATION AIMED AT THE DEVELOPMENT OF EDUCATION IN THE DIGITAL ECONOMY

This article examines state measures, in particular the state program of the Russian Federation "Development of Education", approved by the Government of the Russian Federation No. 1642 of December 26, 2017. Prospects fo...

ABOUT THE PROGRAMMING TECHNIQUES, ORIENTED TO MINIMIZE ERRORS

The article focuses on the idea of creating a language for the description of the problem, not an algorithm. It talks about how by using it one can minimize software errors and simplify the process of programming. It als...

Download PDF file
  • EP ID EP520728
  • DOI 10.25559/SITITO.14.201803.586-593
  • Views 102
  • Downloads 0

How To Cite

Sergey Belov (2018). A METHOD OF CONSTRUCTING A BLOCK CIPHERS ROUND FUNCTION’S POLYNOMIAL OVER A FINITE FIELD. Современные информационные технологии и ИТ-образование, 14(3), 586-593. https://europub.co.uk/articles/-A-520728