Results 101 to 110 of about 6,241,434 (232)
On Plaintext-Aware Public-Key Encryption Schemes [PDF]
, 2010 Plaintext awareness is a property of a public-key encryption scheme intended to capture the idea that the only way to produce a valid ciphertext is to take a message and encrypt it. The idea is compelling, but the devil, as always, is in the details. The
Birkett, James
core
A fundamental flaw in the ++AE authenticated encryption mode
Journal of Mathematical Cryptology, 2018 In this article, we analyse a block cipher mode of operation for authenticated encryption known as ++AE (plus-plus-AE). We show that this mode has a fundamental flaw: the scheme does not verify the most significant bit of any block in the plaintext ...
Qahur Al Mahri Hassan +4 more
doaj +1 more source
Optics Express, 2010 We have shown that the application of double random phase encoding (DRPE) to biometrics enables the use of biometrics as cipher keys for binary data encryption.
H. Tashima +5 more
semanticscholar +1 more source
Practical Polynomial Time Known Plaintext Attacks on a Stream Cipher Proposed by John Nash [PDF]
, 2012 In this paper we present two known plaintext attacks on a stream cipher which was developed by John Nash in the early 1950\u27s but whose design was declassified by the NSA only in 2012.
Eldad Zinger, Adi Shamir
core
On Distinct Known Plaintext Attacks
, 2016 Among statistical attacks, we often make a distinction between attacks in the linear context, for which the knowledge of plaintexts and corresponding ciphertexts is enough to perform the attack, and attacks in the differential context, for which the plaintexts are chosen. Such attacks are usually referred as known-or chosen-plaintext attacks.
Blondeau, Céline, Nyberg, Kaisa
openaire +1 more source
Known plaintext cryptanalysis oftree-structured block ciphers
Electronics Letters, 1995 The cryptanalysis of a class of block ciphers referred to as substitution-permutation networks (SPNs) is examined. Specifically, a novel attack applicable to tree-structured SPNs is presented. Since it uses a known plaintext approach, the attack is preferable to previously outlined chosen plaintext attacks.
H.M. Heys, S.E. Tavares
openaire +1 more source
A hybrid heuristic algorithm to improve known-plaintext attack on Fourier plane encryption.
Optics Express, 2009 A hybrid heuristic attack scheme that combines the hill climbing algorithm and the simulated annealing algorithm is proposed to speed up the search procedure and to obtain a more accurate solution to the original key in the Fourier plane encryption ...
Wensi Liu, Guanglin Yang, H. Xie
semanticscholar +1 more source
A general quantitative cryptanalysis of permutation-only multimedia ciphers against plaintext attacks [PDF]
, 2004 In recent years secret permutations have been widely used for protecting different types of multimedia data, including speech files, digital images and videos.
Guanrong Chen +4 more
core
On Hiding a Plaintext Length by Preencryption [PDF]
, 2011 It is a well known fact that encryption schemes can not hide a plaintext length when it is unbounded. We thus admit that an approximation of it may leak and we focus on hiding its precise value.
Tezcan, Cihangir +3 more
core +1 more source