2015
DOI: 10.29252/mmr.1.1.13
|View full text |Cite
|
Sign up to set email alerts
|

A Stream Cipher Based on Chaotic Permutations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…Note that one get the synchronous mode when W = E = 0. It is proved in [12] (see Theorem A below) that if…”
Section: The Kernel Computation Phasementioning
confidence: 99%
See 2 more Smart Citations
“…Note that one get the synchronous mode when W = E = 0. It is proved in [12] (see Theorem A below) that if…”
Section: The Kernel Computation Phasementioning
confidence: 99%
“…Based on the following theorem [12], by making A secret as a function of the key and choosing D properly, one may prove that a receiver as an UIO exists. We recall the result along with a sketch of proof for the scheme as follows.…”
Section: The Encryption/decryption Phasementioning
confidence: 99%
See 1 more Smart Citation