255 research outputs found
A Simple Attack on Some Clock-Controlled Generators
We present a new approach to edit distance attacks on certain
clock-controlled generators, which applies basic concepts of Graph Theory to
simplify the search trees of the original attacks in such a way that only the
most promising branches are analyzed. In particular, the proposed improvement
is based on cut sets defined on some graphs so that certain shortest paths
provide the edit distances. The strongest aspects of the proposal are that the
obtained results from the attack are absolutely deterministic, and that many
inconsistent initial states of the target registers are recognized beforehand
and avoided during search
Comparison analysis of stream cipher algorithms for digital communication
The broadcast nature of radio communication such as in the HF (High Frequency) spectrum exposes the transmitted information to unauthorized third parties. Confidentiality is ensured by employing cipher system. For bulk transmission of data, stream ciphers are ideal choices over block ciphers due to faster implementation speed and not introducing error propagation. The stream cipher algorithms evaluated are based on the linear feedback shift register (LFSR) with nonlinear combining function. By using a common key length and worst case conditions, the strength of several stream cipher algorithms are evaluated using statistical tests, correlation attack, linear complexity profile and nonstandard test. The best algorithm is the one that exceeds all of the tests
A fast and light stream cipher for smartphones
We present a stream cipher based on a chaotic dynamical system. Using a
chaotic trajectory sampled under certain rules in order to avoid any attempt to
reconstruct the original one, we create a binary pseudo-random keystream that
can only be exactly reproduced by someone that has fully knowledge of the
communication system parameters formed by a transmitter and a receiver and
sharing the same initial conditions. The plaintext is XORed with the keystream
creating the ciphertext, the encrypted message. This keystream passes the NISTs
randomness test and has been implemented in a videoconference App for
smartphones, in order to show the fast and light nature of the proposed
encryption system
Graph-Based Approach to the Edit Distance Cryptanalysis of Irregularly Clocked Linear Feedback Shift Registers
This paper proposes a speed-up of a known-plaintext attack on some stream ciphers
based on Linear Feedback Shift Registers (LFSRs). The algorithm consists of two basic steps:
first, to guess the initial seed value of one of the LFSRs, and then to use the resulting binary
sequence in order to deduce useful information about the cipher parameters. In particular, the
proposed divide-and-conquer attack is based on a combination of graph-based techniques with
edit distance concepts. While the original edit distance attack requires the exhaustive search over
the set of all possible initial states of the involved LFSR, this work presents a new heuristic optimization
that avoids the evaluation of an important number of initial states through the identification
of the most promising branches of the search graph. The strongest aspects of the proposal
are the facts that the obtained results from the attack are absolutely deterministic, and that many
inconsistent initial states of the target LFSRs are recognized and avoided during search.This work was supported by the Spanish Ministry of Science and Innovation and European
FEDER Fund under Project TIN2008-02236/TSI as well as by CDTI (Spain)and the companies INDRA, Unin Fenosa, Tecnobit, Visual Tool, Brainstorm, SAC and
Technosafe under Project Cenit-HESPERIA.Peer reviewe
Deciphering a novel image cipher based on mixed transformed Logistic maps
Since John von Neumann suggested utilizing Logistic map as a random number
generator in 1947, a great number of encryption schemes based on Logistic map
and/or its variants have been proposed. This paper re-evaluates the security of
an image cipher based on transformed logistic maps and proves that the image
cipher can be deciphered efficiently under two different conditions: 1) two
pairs of known plain-images and the corresponding cipher-images with
computational complexity of ; 2) two pairs of chosen plain-images
and the corresponding cipher-images with computational complexity of ,
where is the number of pixels in the plain-image. In contrast, the required
condition in the previous deciphering method is eighty-seven pairs of chosen
plain-images and the corresponding cipher-images with computational complexity
of . In addition, three other security flaws existing in most
Logistic-map-based ciphers are also reported.Comment: 10 pages, 2 figure
- …