Results 151 to 160 of about 2,006 (178)

A chameleon encryption scheme resistant to known-plaintext attack

Proceedings of the tenth annual ACM workshop on Digital rights management, 2010
From a ciphertext and a secret key assigned to a user, the decryption of a Chameleon encryption scheme produces a message which is the plaintext embedded with a watermark associated to the user. Most existing constructions of Chameleon encryption scheme are LUT (lookup table)-based, where a secret LUT plays the role of the master key and each user has ...
Ee-Chien Chang, Chengfang Fang, Jia Xu 0006   +2 more
openaire   +1 more source

Known Plaintext Correlation Attack against RC5

2002
We investigate a known plaintext attack on RC5 based on correlations. Compared with the best previous known-plaintext attack on RC5-32, a linear cryptanalysis by Borst, Preneel, and Vandewalle, our attack applies to a larger number of rounds. RC5-32 with r rounds can be broken with a success probability of 90% by using 26.14r+2.27 plaintexts. Therefore,
Atsuko Miyaji, Masao Nonaka, Yoshinori Takii   +2 more
openaire   +1 more source

Known Plaintexts Attack on Polynomial based Homomorphic Encryption

Proceedings of the 7th International Conference on Security of Information and Networks, 2014
This paper presents the security analysis of symmetric homomorphic cryptosystems based on polynomial ring homomorphisms.First we describe an approach to carry out a known plaintexts attack (KPA) on such cryptosystems in the case when the plaintexts space is a finite field.
Alina Trepacheva, Liudmila Babenko
openaire   +1 more source

CRYPTANALYTIC ATTACK AND DEFENSE: CIPHERTEXT-ONLY, KNOWN-PLAINTEXT, CHOSEN-PLAINTEXT

Cryptologia, 1977
(1977). CRYPTANALYTIC ATTACK AND DEFENSE: CIPHERTEXT-ONLY, KNOWN-PLAINTEXT, CHOSEN-PLAINTEXT. Cryptologia: Vol. 1, No. 4, pp. 366-370.
openaire   +1 more source

Slide Attacks with a Known-Plaintext Cryptanalysis

2002
Although many strong cryptanalytic tools exploit weaknesses in the data-randomizing part of a block cipher, relatively few general tools for cryptanalyzing on the other part, the key scheduling part, are known. A slide attack is an instance of attacks exploiting the keyschedule weakness.
openaire   +1 more source

An Improved Known Plaintext Attack on PKZIP Encryption Algorithm

2012
The PKZIP encryption algorithm has been widely used to protect the contents of compressed archives despite the known security weakness. Biham and Kocher proposed a known plaintext attack with the complexity 240 when 12 plaintext bytes are given. Stay suggested a different way to attack and addressed an idea which makes the complexity be reduced if the ...
Kyung Chul Jeong, Dong Hoon Lee 0002, Daewan Han   +2 more
openaire   +1 more source

Improved known-plaintext attack to permutation-only multimedia ciphers

Information Sciences, 2018
Abstract Permutation is a commonly used operation in many secure multimedia systems . However, it is fragile against cryptanalysis when used alone. For instance, it is well-known that permutation-only multimedia encryption is insecure against known-plaintext attack (KPA).
Leo Yu Zhang, Yuansheng Liu, Cong Wang 0001, Jiantao Zhou 0001, Yushu Zhang 0001, Guanrong Chen   +5 more
openaire   +1 more source

Reliable steganalysis of HUGO steganography based on partially known plaintext

Multimedia Tools and Applications, 2017
The image adaptive steganography represented by HUGO (Highly Undetectable steGO) has high anti-detection capabilities. The primary challenge for steganalyzers is how to reliably detect such steganography and extract the embedded message from stego. Although existing steganalysis algorithms based on parameter recognition of STCs (Syndrome-Trellis Codes)
Junjun Gan, Jiu-fen Liu, Xiangyang Luo 0001, Chunfang Yang, Fenlin Liu   +4 more
openaire   +1 more source

CRYPTANALYSIS OF THE SWEDISH HC-9 A KNOWN-PLAINTEXT APPROACH

Cryptologia, 1997
An extension of the Morris Known-Plaintext Attack is shown to permit cryptanalysis of the Swedish HC-9 cipher machine. Modifications in the encrypting algorithm are presented to defeat the attack.
openaire   +1 more source

Known-plaintext attack of DES-16 using Particle Swarm Optimization

2011 Third World Congress on Nature and Biologically Inspired Computing, 2011
Discovering the root key bits in the cryptanalysis of 16-rounded Data Encryption Standard (DES-160 is considered to be a hard problem. In this paper we present an approach for cryptanalysis of DES-16 based on Particle Swarm Optimization (PSO) using Known-plaintext attack and some equations that deduced from the relationship between sub-key differences ...
Wafaa G. Abd-Elmonim, Neveen I. Ghali, Aboul Ella Hassanien, Ajith Abraham   +3 more
openaire   +1 more source