High-Performance Reliable Block Encryption Algorithms Secured against Linear and Differential Cryptanalytic Attacks

2017

Closed access Metadata (CSL-JSON)
DOI 10.55056/ceur-ws.org/vol-2104/paper_220.pdf
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

To be secure, modern information and communication technology (ICT) needs reliable encryption. Symmetric cryptography combines encryption algorithms that use the same cryptographic keys for both encryption of plaintext and decryption of ciphertext. These algorithms are used for confidentiality ensuring in different spheres but most of them are worn out and outdated. Modern encryption algorithms development is very actual task for ICT (up to date and next generation). In this paper to improve the security effectiveness of electronic information resources, two encryption algorithms have been developed based on fixed lookup tables with extended-bit depth and dynamic key-dependent lookup tables. The developed algorithms are at least two times faster than the previous national encryption standard and virtually secure to linear and differential cryptanalysis. Properties of random sequences formed using the proposed algorithms’ encryption (in counter mode) were explored in the environment of NIST STS statistical tests, according to which they passed integrated control by mentioned tests with better results than other generators.