An Improved Known Plaintext Attack on PKZIP Encryption Algorithm

2012 ◽  
pp. 235-247 ◽  
Author(s):  
Kyung Chul Jeong ◽  
Dong Hoon Lee ◽  
Daewan Han
Keyword(s):  
Encryption Algorithm ◽  
Known Plaintext Attack

scholarly journals Preventing Cryptographic Attacks in Iot using Lightweight P-Box Permutation Encryption

2020 ◽  
Vol 9 (4) ◽  
pp. 1696-1702
Keyword(s):  
Smart Grid ◽  
Smart Home ◽  
Research Work ◽  
Encryption Algorithm ◽  
Smart Meter ◽  
Chosen Plaintext Attack ◽  
Exchange Information ◽  
Cryptographic Attacks ◽  
Known Plaintext Attack ◽  
Electricity Tariff

Internet of Things (IoT) is a leading technology, where numerous sensors with the ability to exchange information over the internet are involved. It supports various applications ranging from smart home to smart city including smart grid for calculating electricity tariff, real time monitoring and controlling traffic, Co2 emission level finding etc. Research advancements in IoT facilitates us to control or monitor the things remotely and take actions accordingly. Efficient working of the IoT, involves continuous exchange of information between the nodes which should be executed in trusted environment as this data is confidential and only trusted nodes should handle it. Current research work in IoT suggests the confidentiality mechanisms which are heavyweight and not suitable in IoT scenario. So there is a need for lightweight confidentiality mechanism. In this paper we have shown how lightweight P-Box permutation encryption algorithm can be effective in IoT. We have compared this encryption algorithm with PRESENT protocol and our results show that lightweight P-Box permutation algorithm took less time. To prove that our encryption algorithm is better w.r.t. security, we have also carried out known plaintext attack and chosen plaintext attack and shown that lightweight P-Box permutation encryption algorithm is resistant to both of these attacks. Further we have used this technique to transfer the smart meter data in Smart Grid and shown that the data exchanged between the two nodes in confidential manner

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.

DEVELOPMENT AND ANALYSIS OF THE ENCRYPTION ALGORITHM IN NONPOSITIONAL POLYNOMIAL NOTATIONS

2018 ◽  
Vol 6 (2) ◽  
pp. 19-33 ◽  
Author(s):  
R.G. Biyashev ◽  
◽  
M.N. Kalimoldayev ◽  
S.E. Nyssanbayeva ◽  
N.A. Kapalova ◽  
...  
Keyword(s):  
Encryption Algorithm

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.

Image Encryption Algorithm with Plaintext Related Chaining

2019 ◽  
Vol 38 (3) ◽  
pp. 647-678 ◽  
Author(s):  
Ľuboš Ovseník ◽  
Ján Turán ◽  
Tomáš Huszaník ◽  
Jakub Oravec ◽  
Ondrej Kováč ◽  
...  
Keyword(s):  
Image Encryption ◽  
Encryption Algorithm ◽  
Image Encryption Algorithm
Sign in / Sign up

Export Citation Format

Share Document