New results in biclique cryptanalysis of full round GIFT

2021 ◽  
pp. 1-10
Author(s):  
K.B. Jithendra ◽  
Shahana T. Kassim
Keyword(s):  
Block Cipher ◽  
Security Level ◽  
Secret Keys

Security of a recently proposed bitwise block cipher GIFT is evaluated in this paper. In order to mount full round attacks on the cipher, biclique cryptanalysis method is applied. Both variants of the block cipher are attacked using Independent biclique approach. For recovering the secret keys of GIFT-64, the proposed attack requires 2127.45 full GIFT-64 encryption and 28 chosen plain texts. For recovering the secret keys of GIFT-128, the proposed attack requires 2127.82 full GIFT-128 encryption and 218 chosen plain texts. The attack complexity is compared with that of other attacks proposed previously. The security level of GIFT is also compared with that of the parent block cipher PRESENT, based on the analysis.

A novel cryptosystem based on abstract automata and Latin cubes

2015 ◽  
Vol 52 (2) ◽  
pp. 221-232
Author(s):  
Pál Dömösi ◽  
Géza Horváth
Keyword(s):  
Block Cipher ◽  
Finite Automata ◽  
Theoretical Background ◽  
Point Of View ◽  
Theoretical Point ◽  
Transition Matrices ◽  
Encryption And Decryption ◽  
Secret Keys ◽  
Automata Network ◽  
Fully Functioning

In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.

A Chaos-Based Approach for Correcting the Security Level of a Block Cipher Algorithm

2016 ◽  
Vol 11 (2) ◽  
pp. 92
Author(s):  
Fatma Zayen Sbiaa ◽  
Medien Zeghid ◽  
Sonia Kotel ◽  
Rached Tourki ◽  
Mohsen Machhout ◽  
...  
Keyword(s):  
Block Cipher ◽  
Security Level

scholarly journals Efficient Implementation of PRESENT and GIFT on Quantum Computers

2021 ◽  
Vol 11 (11) ◽  
pp. 4776
Author(s):  
Kyungbae Jang ◽  
Gyeongju Song ◽  
Hyunjun Kim ◽  
Hyeokdong Kwon ◽  
Hyunji Kim ◽  
...  
Keyword(s):  
Block Cipher ◽  
Search Algorithm ◽  
Block Ciphers ◽  
Quantum Circuits ◽  
Security Level ◽  
Symmetric Key ◽  
Grover Search ◽  
Target Block ◽  
Symmetric Key Cryptography ◽  
Grover Search Algorithm

Grover search algorithm is the most representative quantum attack method that threatens the security of symmetric key cryptography. If the Grover search algorithm is applied to symmetric key cryptography, the security level of target symmetric key cryptography can be lowered from n-bit to n2-bit. When applying Grover’s search algorithm to the block cipher that is the target of potential quantum attacks, the target block cipher must be implemented as quantum circuits. Starting with the AES block cipher, a number of works have been conducted to optimize and implement target block ciphers into quantum circuits. Recently, many studies have been published to implement lightweight block ciphers as quantum circuits. In this paper, we present optimal quantum circuit designs of symmetric key cryptography, including PRESENT and GIFT block ciphers. The proposed method optimized PRESENT and GIFT block ciphers by minimizing qubits, quantum gates, and circuit depth. We compare proposed PRESENT and GIFT quantum circuits with other results of lightweight block cipher implementations in quantum circuits. Finally, quantum resources of PRESENT and GIFT block ciphers required for the oracle of the Grover search algorithm were estimated.

scholarly journals Color Image Encryption using AES and RSA

2020 ◽  
Vol 9 (5) ◽  
pp. 547-550
Keyword(s):  
Data Security ◽  
Block Cipher ◽  
Color Image ◽  
Signal To Noise Ratio ◽  
Security Level ◽  
Change Rate ◽  
The Public ◽  
Key Block ◽  
Symmetric Key ◽  
Encryption Algorithms

Information security is an important task on multimedia and communication world. During storing and sharing maintaining a strategic distance from the outsider access of information is the difficult one. There are many encryption algorithms that can provide data security. In this paper two of the encryption algorithms namely AES and RSA are implemented for color images. AES (Advanced Encryption Standard) is a symmetric key block cipher published in December 2001 by NSIT (National Institute of Standards and Technology). RSA (Rivest-Shamir-Adleman) is an asymmetric key block cipher. It uses two separate keys, one for encryption called the public key and other for decryption called the private key. Both the implementation and analysis are done in Matlab. The quality and security level of both the algorithms is analysed based on various criteria such as Histogram analysis, Correlation analysis, Entropy analysis, NPCR (Number of Pixel Change Rate), UACI (Unified Average Changing Intensity), PSNR (Peak Signal-to-Noise Ratio).

scholarly journals Development of Block Cipher Cryptography Based on Denok Deblong Dance Pattern

2019 ◽  
Vol 3 (1) ◽  
pp. 43-51
Author(s):  
Yuana Sambadha Sambadha
Keyword(s):  
Block Cipher ◽  
Information Infrastructure ◽  
Security Level ◽  
Avalanche Effect

The popularity of cybercrime caused unsafe information. Infrastructure IT made an effort to take in hand the problem, i.e. manipulating information. Cryptography existed as knowledge to protect information. To improve the security level, cryptography needs to be developed. Block Cipher Cryptography based on Dance Denok Deblong is designed to create a new cryptography. This cryptography is designed by using 4 process and 20 rounds. In fourth procesis transformed with S-BOX to get a more random ciphertext. Testing is also done using Avalanche Effect and Correlation value where the character change reaches 49,844%, so it can be used as an alternative in securing data

Design Time Engineering of Side Channel Resistant Cipher Implementations

2013 ◽  
pp. 133-157 ◽  
Author(s):  
Alessandro Barenghi ◽  
Luca Breveglieri ◽  
Fabrizio De Santis ◽  
Filippo Melzani ◽  
Andrea Palomba ◽  
...  
Keyword(s):  
Power Consumption ◽  
Information Leakage ◽  
Smart Phones ◽  
Mobile Systems ◽  
Side Channel ◽  
Security Level ◽  
Embedded Devices ◽  
Design Time ◽  
Secret Keys ◽  
Channel Information

Dependable and trustworthy security solutions have emerged as a crucial requirement in the specification of the applications and protocols employed in modern Information Systems (IS). Threats to the security of embedded devices, such as smart phones and PDAs, have been growing since several techniques exploiting side-channel information leakage have proven successful in recovering secret keys even from complex mobile systems. This chapter summarizes the side-channel techniques based on power consumption and elaborates the issue of the design time engineering of a secure system, through the employment of the current hardware design tools. The results of the analysis show how these tools can be effectively used to understand possible vulnerabilities to power consumption side-channel attacks, thus providing a sound conservative margin on the security level. The possible extension of this methodology to the case of fault attacks is also sketched.

scholarly journals Exploring Secret Keys in Searching Integral Distinguishers Based on Division Property

2020 ◽  
pp. 288-304
Author(s):  
Senpeng Wang ◽  
Bin Hu ◽  
Jie Guan ◽  
Kai Zhang ◽  
Tairong Shi
Keyword(s):  
Block Cipher ◽  
Block Size ◽  
Mixed Integer ◽  
Secret Key ◽  
Improved Method ◽  
Integral Property ◽  
Secret Keys ◽  
Propagation Rule ◽  
Automatic Algorithm ◽  
Better Than

Division property proposed by Todo at EUROCRYPT 2015 is a generalized integral property. Then, conventional bit-based division property (CBDP) and bitbased division property using three subsets (BDPT) were proposed by Todo and Morii at FSE 2016. At ASIACRYPT 2016, Xiang et al. extended Mixed Integer Linear Programming (MILP) method to search integral distinguishers based on CBDP. And at ASIACRYPT 2019, Wang et al. proposed an MILP-aided method of searching integral distinguishers based on BDPT. Although BDPT is powerful in searching integral distinguishers, the accuracy is not perfect.For block cipher SPECK32, as the block size is only 32 bits, we can experimentally observe the behaviors of all the plaintexts under a fixed key. By testing 210 random secret keys, we experimentally find a better integral distinguisher of 6-round SPECK32 with 30 active bits. But this experimental integral distinguisher cannot be proved by existing methods. So there still exists a gap between the proved distinguisher and the experimental one.To fill the gap, we explore secret keys in searching integral distinguishers based on BDPT. We put forward a situation where “Xor with The Secret Key” operation can be bypassed. Based on the new BDPT propagation rule, an improved automatic algorithm of searching integral distinguishers is proposed. For SPECK32, our improved algorithm can find the 6-round integral distinguisher with 230 chosen plaintexts. The gap between the proved distinguisher and the experimental one is filled. Moreover, we apply this improved method to search the integral distinguishers of SPECK, KATAN/KTANTAN, SIMON, SIMECK, SIMON(102), PRESENT and RECTANGLE block ciphers. The integral distinguishers found by our improved method are better than or consistent with the previous longest distinguishers.

scholarly journals A new dynamic speech encryption algorithm based on lorenz chaotic map over internet protocol

2020 ◽  
Vol 10 (5) ◽  
pp. 4824
Author(s):  
Obaida M. Al-hazaimeh
Keyword(s):  
Chaotic Map ◽  
Internet Protocol ◽  
Encryption Algorithm ◽  
Security Level ◽  
Generation Process ◽  
Voice Communication ◽  
Secret Keys ◽  
Speech Encryption ◽  
Dynamic Key ◽  
The Voice

This paper introduces a dynamic speech encryption algorithm based on Lorenz chaotic map over internet protocol to enhance the services of the real-time applications such as increases the security level and reduces latency. The proposed algorithm was divided into two processes: dynamic key generation process using 128-bit hash value to dynamically alter the initial secret keys, and encryption and decryption process using Lorenz system. In the proposed algorithm, the performance evaluation is carried out through efficient simulations and implementations and statistical analysis. In addition, the average time delay in the proposed algorithm and some of the existing algorithms such as AES is compared. The obtained results concluded that, the proposed dynamic speech encryption algorithm is effectually secured against various cryptanalysis attacks and has useful cryptographic properties such as confusion and diffusion for better voice communication in the voice applications field in the Internet.

scholarly journals 64 Bit Block Cipher Cryptography Design Based on Traditional Game Patterns with West Java

2019 ◽  
Vol 3 (1) ◽  
pp. 65-73
Author(s):  
Nanda Choirul
Keyword(s):  
Block Cipher ◽  
Security Level ◽  
West Java ◽  
Avalanche Effect ◽  
Traditional Game

Cryptography is a technique of securing data. To improve the security level, cryptography needs to be developed. Block Cipher Cryptography based on Traditional Game Pattern in West Java Bentengan is designed to make a new cryptography. This cryptography is designed by 4 process and 10 rounds. Testing is also done by Avalanche Effect the character changes reach up to 51,563%, so it can be an alternative in securing data.

scholarly journals Enhanced RC5 Algorithm using Parallel Computing for Communication Networks

2019 ◽  
Vol 15 (29) ◽  
pp. 103-125
Author(s):  
David Fabián Cevallos Salas
Keyword(s):  
Communication Networks ◽  
High Performance ◽  
Block Cipher ◽  
Main Idea ◽  
Security Level ◽  
Symmetric Cryptography ◽  
Expansion Mechanism ◽  
Symmetric Key ◽  
Key Length ◽  
Performance Computing

One of the main disadvantages of symmetric key algorithms in compar-ison with asymmetric key ones is their lower security level due to theirshorter key length. Indeed, increasing the number of bits that conformsthe key used by a symmetric cryptography algorithm will increase its se-curity level with a cost on its performance. Expanding a key in symmetriccryptography is not an easy task due to algorithms are designed to workwith keys of a fixed maximum length. This paper presents an alterna-tive design of the RC5 cryptography algorithm with an enhanced securitylevel achieved through a key expansion mechanism with Parallel Comput-ing processing. Although the design was created for the RC5 algorithmthe main idea might be applied to other block cipher algorithms applyingthe same criteria. This methodology makes feasible to obtain a robustsymmetric key algorithm implemented in software with an acceptable per-formance in comparison with other techniques such as implementations inhardware, reduction in the amount of data, improvements in the key ex-change process, advanced high performance computing, and many otherstechniques

Sign in / Sign up

Export Citation Format

Share Document