Development of the approach to proving the security of block ciphers to impossible differential attack

Ruzhentsev, Victor; Onishchenko, Yurii

doi:10.15587/1729-4061.2017.108413

Cited by 1 publication

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These elements are converted to 128 bits. For the above example, the optimal elements in the optimal selected face are «24, 76,80,33,20,62,6,1,45,15,5,27,47,79,40, 77», and the generated binary random key is «000110000100110001010000001 000010001010000111110000001100 000000100101101000011110000010 1000110110010111101001111001010 0001001101».…”

Section: Resultsmentioning

confidence: 99%

“…In the modern information world, the utilization of safe data transmitting protocols and cryptographic systems assists in protecting against several attacks on information security [1]. Cryptography represents a scheme in which the information is converted into a non-understood or unreadable style and the encryption and decryption processes are applied using programming algorithms over a digital field [2].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Implementation of modified GSO based magic cube keys generation in cryptography

Mazher¹,

Waleed

2021

EEJET

View full text Add to dashboard Cite

Over the last few decades, tremendous and exponential expansion in digital contents together with their applications has emerged. The Internet represents the essential leading factor for this expansion, which provides low-cost communication tools worldwide. However, the main drawback of the Internet is related to security problems. In order to provide secure communication, enormous efforts have been spent in the cryptographic field. Recently, cryptographic algorithms have become essential for increasing information safety. However, these algorithms require random keys and can be regarded as compromised when the random keys are cracked via the attackers. Therefore, it is substantial that the generation of keys should be random and hard to crack. In this paper, this is guaranteed via one of the most efficient nature-inspired algorithms emerged by inspiring the movements of stars, galaxies, and galaxy superclusters in the cosmos that can be utilized with a mathematical model (magic cube) for generating hardly cracking random number keys. In the proposed cryptographic system, the Modified Galactic Swarm Optimization (GSO) algorithm has been utilized in which every row and column of magic cube faces are randomly rotated until reaching the optimal face, and the optimal random elements are selected as optimal key from the optimal face. The generated optimized magic cube keys are used with several versions of RC6 algorithms to encrypt various secret texts. Furthermore, these generated keys are also used for encrypting images using the logical XOR operation. The obtained results of NIST tests proved that the generated keys are random and uncorrelated. Moreover, the security of the proposed cryptographic system was proved

show abstract