2005
DOI: 10.1142/s0218127405012260
|View full text |Cite
|
Sign up to set email alerts
|

Cryptanalysis of Observer Based Discrete-Time Chaotic Encryption Schemes

Abstract: This paper investigates the weaknesses of cryptosystems that use observer based synchronized chaotic systems. It is shown that known plaintext and chosen plaintext attacks can successfully be launched against such cryptosystems to recover the system parameters and subsequently eavesdrop on the message transmission. The methods employed rely only on the basic mathematical relations that exist between the output sequence and the message sequence of the transmitter system and require very less computations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
42
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 23 publications
(42 citation statements)
references
References 11 publications
0
42
0
Order By: Relevance
“…have been recovered, which happens with high probability as shown in the previous subsection, the first 15 bytes in f (16) 0⊕1 (k) can be freely chosen by choosing f (15) 0⊕1 (k). The last byte in each 16-byte block f (16) 0⊕1 (k, 15) may not be chosen, if it is equal to Secret.…”
Section: Breaking the First Eight Byte-swapping Operations Inmentioning
confidence: 94%
See 4 more Smart Citations
“…have been recovered, which happens with high probability as shown in the previous subsection, the first 15 bytes in f (16) 0⊕1 (k) can be freely chosen by choosing f (15) 0⊕1 (k). The last byte in each 16-byte block f (16) 0⊕1 (k, 15) may not be chosen, if it is equal to Secret.…”
Section: Breaking the First Eight Byte-swapping Operations Inmentioning
confidence: 94%
“…Without loss of generality, assume that N can be exactly divided by 15. Then, the plaintext has N/15 blocks: f = (f (15) , where f (15) (k) = (f (15) (k, j)) 14 j=0 = (f (15k + j)) 14 j=0 . Similarly, denote the ciphertext by f = (f (i)) (N/15)·16−1 i=0 = (f (16) , where f (16) (k) = (f (16) (k, j)) 15 j=0 = (f (16k + j)) 15 j=0 denotes the expanded cipher-block.…”
Section: Multimedia Cryptography System (Mcs)mentioning
confidence: 99%
See 3 more Smart Citations