Breaching Security of Full Round Tiny Encryption Algorithm

2018 ◽  
Vol 12 (1) ◽  
pp. 89-98
Author(s):  
Puneet Kumar Kaushal ◽  
Rajeev Sobti
Keyword(s):  
Block Cipher ◽  
Binary Sequence ◽  
Random Permutation ◽  
Encryption Algorithm ◽  
Hardware Cost ◽  
Cipher Text ◽  
Known Plaintext Attack

Tiny encryption algorithm is a 64-bit block cipher designed by Wheeler and Needham in 1994 and attracted much of its attention due to its capability of reducing the hardware cost. In this paper, we introduced coincidence count attack at bit level, a kind of known-plaintext attack and evaluated the resistance of TEA to withstand with it. We also examined confrontation of full round TEA against bit sum attack. Furthermore, we introduced a modest algorithm based on coincidence count and bit sum concept that makes it easy to find relevant plaintext corresponding to an arbitrary cipher text with a probability of 0.93. We also presented how cipher text originated from tiny encryption algorithm can be distinguished from a random permutation of binary sequence.

Research on Encryption Algorithm Based on Delayed Chaotic Neural Network

2013 ◽  
Vol 662 ◽  
pp. 907-909
Author(s):  
Li Luo ◽  
Feng Liu ◽  
Jin Zhou Liu
Keyword(s):  
Neural Network ◽  
Time Delay ◽  
Block Cipher ◽  
Encryption Algorithm ◽  
Chaotic Neural Network ◽  
Network Parameters ◽  
Link Model ◽  
Known Plaintext Attack

According to analysis and research on the time-delay neural network password algorithm, the paper points out that the encryption algorithm based on time-delay chaotic neural network is vulnerable. Attackers can decrypt partial plaintext without knowing any network parameters. Therefore suggesting that adopting different keys when plaintext encrypted every time, or using group link model similar to the block cipher to resist known plaintext attack.

A Study of Distinguisher Attack on AES-128 and AES-256 Block Ciphers through Model Based Classification Using Neural Network

2015 ◽  
Vol 710 ◽  
pp. 133-138
Author(s):  
K. Vetrivel ◽  
S.P. Shantharajah
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Block Cipher ◽  
Research Work ◽  
Random Permutation ◽  
Advanced Encryption Standard ◽  
Text Block ◽  
Cipher Text ◽  
Encryption Algorithms ◽  
Symmetric Block

Modern encryption algorithms will focus on transforming rendered text block into a non-rendered block of symbols. The objective is to make the cipher block more non-interpretable. Distinguisher attack algorithm is used to distinguish cipher text from random permutation and other related algorithms. Currently, a cipher has been design to concentrate on distinguisher attack. In this research work, we have attempted to distinguish the cipher blocks of AES-128 (Advanced Encryption Standard) and AES-256 symmetric block cipher algorithms using an artificial neural network based classifier.

scholarly journals Implementasi Algoritma Rot Dan Subtitusional Block Cipher Dalam Mengamankan Data

2017 ◽  
pp. 73-79
Author(s):  
Ayu Pratiwi
Keyword(s):  
Information System ◽  
Information Systems ◽  
Block Cipher ◽  
Rapid Development ◽  
Encryption Algorithm ◽  
New Techniques ◽  
Plain Text ◽  
Cipher Text ◽  
Processing Data ◽  
Confidential Data

The security and confidentiality of data is one of the most important aspects in the information system at this time. Caused by the rapid development of science and technology that allows the emergence of new techniques, which are misused by certain parties that threaten the security of information systems. In general, the data are categorized into two, namely confidential data and data that is not confidential. Data that is not confidential is usually not too much attention. What really needs to be considered is confidential data, where every information contained in it will be very valuable for those who need it because the data can be easily duplicated. The ROT-n algorithm is one simple encryption algorithm that uses alphabetical shifts as much as n to convert plain text into cipher text, whereas Block ciphers work by processing data in blocks, where several characters / data are combined into one block. Each one block process produces one block output as well.

Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme

2020 ◽  
Vol 38 (3B) ◽  
pp. 98-103
Author(s):  
Atyaf S. Hamad ◽  
Alaa K. Farhan
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Second Phase ◽  
Cipher Text ◽  
The Face ◽  
Substitution Principle ◽  
2D Logistic Map ◽  
Image Encryption Algorithm

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.

scholarly journals Entropy-Based Block Scrambling Image Encryption Using DES Structure and Chaotic Systems

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Xuncai Zhang ◽  
Lingfei Wang ◽  
Guangzhao Cui ◽  
Ying Niu
Keyword(s):  
Image Encryption ◽  
Key Management ◽  
Chaotic Systems ◽  
Image Data ◽  
Large Data ◽  
Data Encryption ◽  
Image Correlation ◽  
Encryption Algorithm ◽  
Strong Correlations ◽  
Cipher Text

Traditional encryption algorithms are inefficient when applied to image encryption because image data have the characteristics of large data sizes and strong correlations between adjacent pixels. The shortcomings of the traditional Data encryption standard (DES) encryption algorithm when applied to image encryption are analyzed, and a new image encryption algorithm based on the traditional DES encryption algorithm model, chaotic systems, DNA computing, and select cipher-text output is proposed. Select cipher-text output selects cipher image with the biggest entropy, and it can increase the randomness of cipher image and reduce the risk of encryption system being broken down. This algorithm overcomes the shortcomings of high computational complexity and inconvenient key management that the traditional text encryption algorithm has when applied to image encryption. The experimental results show that the security of this algorithm is verified by analyzing the information entropy, image correlation of adjacent pixels and other indexes. At the same time, this algorithm passes the noise attack test and the occlusion attack test, so it can resist common attacks.

Sign in / Sign up

Export Citation Format

Share Document