30,223 research outputs found
Cryptanalysis of a computer cryptography scheme based on a filter bank
This paper analyzes the security of a recently-proposed signal encryption
scheme based on a filter bank. A very critical weakness of this new signal
encryption procedure is exploited in order to successfully recover the
associated secret key.Comment: 6 pages, 1 figur
Cryptanalysis of two chaotic encryption schemes based on circular bit shift and XOR operations
Recently two encryption schemes were proposed by combining circular bit shift
and XOR operations, under the control of a pseudorandom bit sequence (PRBS)
generated from a chaotic system. This paper studies the security of these two
encryption schemes and reports the following findings: 1) there exist some
security defects in both schemes; 2) the underlying chaotic PRBS can be
reconstructed as an equivalent key by using only two chosen plaintexts; 3) most
elements in the underlying chaotic PRBS can be obtained by a differential
known-plaintext attack using only two known plaintexts. Experimental results
are given to demonstrate the feasibility of the proposed attack.Comment: 17 pages, 8 figure
Cryptanalysis of a chaotic block cipher with external key and its improved version
Recently, Pareek et al. proposed a symmetric key block cipher using multiple
one-dimensional chaotic maps. This paper reports some new findings on the
security problems of this kind of chaotic cipher: 1) a number of weak keys
exists; 2) some important intermediate data of the cipher are not sufficiently
random; 3) the whole secret key can be broken by a known-plaintext attack with
only 120 consecutive known plain-bytes in one known plaintext. In addition, it
is pointed out that an improved version of the chaotic cipher proposed by Wei
et al. still suffers from all the same security defects.Comment: 14 pages, 2 figures, 1 table, formatted with elsart.cl
Some hints for the design of digital chaos-based cryptosystems: lessons learned from cryptanalysis
In this work we comment some conclusions derived from the analysis of recent
proposals on the field of chaos-based cryptography. These observations remark
the main problems detected in some of those schemes under examination.
Therefore, this paper is a list of what to avoid when considering chaos as
source of new strategies to conceal and protect information
Cryptanalysis of a new chaotic cryptosystem based on ergodicity
This paper analyzes the security of a recent cryptosystem based on the
ergodicity property of chaotic maps. It is shown how to obtain the secret key
using a chosen-ciphertext attack. Some other design weaknesses are also shown.Comment: 10 pages, 5 figure
Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience
It has been proven that quantum adders are forbidden by the laws of quantum
mechanics. We analyze theoretical proposals for the implementation of
approximate quantum adders and optimize them by means of genetic algorithms,
improving previous protocols in terms of efficiency and fidelity. Furthermore,
we experimentally realize a suitable approximate quantum adder with the cloud
quantum computing facilities provided by IBM Quantum Experience. The
development of approximate quantum adders enhances the toolbox of quantum
information protocols, paving the way for novel applications in quantum
technologies
- …