This paper analyzes the security of amplitude encoding for double random phase encryption. We describe several types of attack. The system is found to be resistant to brute-force attacks but vulnerable to chosen and known plaintext attacks.

In this paper we describe the main ideas of a few versions of an algebraic known plaintext attack against AES-128. The attack could be applied under the hypothesis of knowing a part of the 16-bytes key. These attack versions are based on some specific properties of the key schedule, properties that allow splitting the keys space (2 keys) in subspaces based on some well-defined criteria. The pra...

In this paper, we describe a sequence of simple, yet efficient chosen-plaintext (or chosen-ciphertext) attacks against reduced-round versions of IDEA (with 2, 2.5, 3, 3.5, and 4 rounds) which compare favourably with the best known attacks: some of them decrease considerably the time complexity given the same order of data at disposal while other ones decrease the amount of necessary knownor cho...

Recently G. Jakimoski and L. Kocarev cryptanalzed two chaotic cryptosystems without using chaotic synchronization – Baptista cryptosystem and Alvarez cryptosystem. As a result, they pointed out that neither of the two cryptosystems are secure to known-plaintext attacks. In this letter, we re-study the performance of Jakimoski-Kocarev attack on Baptista cryptosystem and find that it is not effic...

Recently, a VoIP (voice over Internet protocol) technique with a new hierarchical data security protection (HDSP) scheme was proposed by using a secret chaotic bit sequence. This paper points out some insecure properties of the HDSP scheme, and then uses them to develop known/chosen-plaintext attacks. The following main findings are: 1) given n known plaintexts, about (100− 50 2n ) percent of s...

although more than 98% of the human genome is transcribed, most of these transcripts are not translated into proteins. rather, they are considered as non-coding rnas. micrornas (mirnas) are very short non-coding rnas approximately 22 nucleotides in length which regulate many key processes of cells such as growth, proliferation, differentiation, cell cycle, apoptosis (programmed cell death) and ...

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when we choose a digit set that does not contain 0. We prove that such digit sets exist and we provide infinitely many examples for every base b with |b| ≥ 4, and...

We propose a cryptanalysis of the original Domingo-Ferrer’s algebraic privacy homomorphism. We show that the scheme over Zn can be broken by d + 1 known plaintexts in O(d3 log n) time when it has d times expansion through the encryption. Furthermore even when the public modulus n is kept secret, it can be broken by d + 2 known plaintexts in time at most O(d5 log(dn)).

Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help of an arbitrator which is called in only when a dispute happens between the two parties. In almost all the previous work on OFE, after obtaining a partial signature from the signer, the verifier can present it to others...

The choice of an operator in evolutionary computation is generally based on comparative runs of the algorithms. However, some statistical a priori measures, based on samples of (parents-oospring), have been proposed to avoid such brute comparisons. This paper surveys some of these works in the context of binary crossover operators. We rst extend these measures to overcome some of their limitati...