Square impossible differential attack and security of AES in known plaintext scenario [PDF]
CryptologiaIn this work, we examine the security of the 8-round AES, under the known plaintext attack scenario, a type of cryptographic attack in which an attacker has access to the plaintext and corresponding ciphertext pairs. We present an innovative impossible differential (ID) attack technique, which utilizes a specific ID characteristic, to perform the first
Orhun Kara
semanticscholar +4 more sources
A Known-Plaintext Attack with Minimal Data Complexity on 25-Round CRAFT [PDF]
IACR Transactions on Symmetric CryptologyWe present the first known-plaintext attack on up to 25 rounds of the tweakable block cipher Craft. These attacks require only two known plaintextciphertext pairs to recover the full key, and work independent of the used tweaks.
Eran Lambooij, Patrick Neumann
doaj +3 more sources
Cryptanalysis and Improvement of a Chaotic Map-Based Image Encryption System Using Both Plaintext Related Permutation and Diffusion [PDF]
Entropy, 2020 In theory, high key and high plaintext sensitivities are a must for a cryptosystem to resist the chosen/known plaintext and the differential attacks. High plaintext sensitivity can be achieved by ensuring that each encrypted result is plaintext-dependent.
Cheng-Yi Lin, Ja-Ling Wu
doaj +2 more sources
Cryptanalysis of LowMC instances using single plaintext/ciphertext pair [PDF]
IACR Transactions on Symmetric Cryptology, 2020 Arguably one of the main applications of the LowMC family ciphers is in the post-quantum signature scheme PICNIC. Although LowMC family ciphers have been studied from a cryptanalytic point of view before, none of these studies were directly concerned ...
Subhadeep Banik +3 more
doaj +4 more sources
A known-plaintext heuristic attack on the Fourier plane encryption algorithm [PDF]
Optics Express, 2006 The Fourier plane encryption algorithm is subjected to a known-plaintext attack. The simulated annealing heuristic algorithm is used to estimate the key, using a known plaintext-ciphertext pair, which decrypts the ciphertext with arbitrarily low error. The strength of the algorithm is tested by using this estimated key to decrypt a different ciphertext
Gopinathan, Unnikrishnan +3 more
openaire +7 more sources
Image Privacy Protection Communication Scheme by Fibonacci Interleaved Diffusion and Non-Degenerate Discrete Chaos [PDF]
EntropyThe rapid development of network communication technology has led to an increased focus on the security of image storage and transmission in multimedia information.
Zhiyu Xie +5 more
doaj +2 more sources
A Known Plaintext Attack of FEAL-4 and FEAL-6 [PDF]
Annual International Cryptology Conference, 1992 We present new results on the cryptanalysis of the FEAL-N blockcipher. As a matter of fact, almost all the attacks of this cryptosystem published so far are chosen plaintext attacks [3,4,5,7], except the announcement in [7] of a non-differential known plaintext attack of FEAL-4 which requires about 100000 plaintext blocks.
Anne Tardy-Corfdir, Henri Gilbert
openaire +2 more sources
Cryptanalysis of Dual-Stage Permutation Encryption Using Large-Kernel Convolutional Neural Network and Known Plaintext Attack [PDF]
CryptographyReversible data-hiding in encrypted images (RDHEI) plays a pivotal role in preserving privacy within images stored on cloud platforms. Recently, Wang et al.
Ching-Chun Chang +3 more
doaj +2 more sources
Known-plaintext attack on a joint transform correlator encrypting system
Optics Letters, 2010 We demonstrate in this Letter that a joint transform correlator shows vulnerability to known-plaintext attacks. An unauthorized user, who intercepts both an object and its encrypted version, can obtain the security key code mask. In this contribution, we conduct a hybrid heuristic attack scheme merge to a Gerchberg-Saxton routine to estimate the ...
Barrera Ramírez, John Fredy +4 more
openaire +4 more sources
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security [PDF]
, 2007 Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes based on any weakpseudorandom function (PRF) which can be much more efficiently implemented than PRFs.
Ueli Maurer, Johan Sjödin
openaire +5 more sources