Development and analysis of symmetric encryption algorithm
Abstract
This paper introduces a new block encryption algorithm designed for the cryptographic protection of data. The paper introduces and explains a newly devised exponentiation modulo (EM) transform method, utilized to obtain the S-block, an essential element within the presented algorithm. A method of optimizing the choice of keys and increasing the efficiency of calculation was also used. It is proposed that incorporating characteristics of cryptographic primitives functioning within the Galois field into the algorithm can lead to favorable outcomes. To increase the encryption algorithm's speed, non-positional polynomial notation systems and a working base index table are used. The paper discusses the implementation of an encryption algorithm in C++ and examines the statistical characteristics of the resulting ciphertexts. For experimental testing of statistical safety, a set of statistical tests by National Institute of Standards and Technology (NIST) and D. Knuth was used. Furthermore, the resulting S-box was examined using linear, differential, and algebraic cryptanalysis techniques. In the future, this proposed S-box will be implemented in the encryption algorithm being developed for the preliminary encryption of confidential data.
Keywords
Algebraic analysis; Exponentiation modulo; Galois field; Nonpositional polynomial notations; S-block; Strict avalanche criterion; Symmetric encryption algorithm
Full Text:
PDFDOI: http://doi.org/10.11591/ijece.v15i2.pp1900-1911
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).