1994
DOI: 10.1109/12.338094
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: This paper deals with the theory and application of Cellular Automata (CAI for a class of block ciphers and stream ciphers. Based on CA state transitions certain fundamental transformations are defined which are block ciphering functions of the proposed enciphering scheme. These fundamental transformations are found to generate the simple (alternating) group of even permutations which in turn is a subgroup of the permutation group. These functions are implemented with a class of programmable cellular automata … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
142
0
3

Year Published

2005
2005
2019
2019

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 307 publications
(147 citation statements)
references
References 20 publications
2
142
0
3
Order By: Relevance
“…And researchers have studied on cellular automata configured with rules 51, 60, 102, 153, 195 or 204 [1][2][3][4][5][6][7][8].…”
Section: Introductionmentioning
confidence: 99%
“…And researchers have studied on cellular automata configured with rules 51, 60, 102, 153, 195 or 204 [1][2][3][4][5][6][7][8].…”
Section: Introductionmentioning
confidence: 99%
“…On this, the structure of the message is encrypted to make it meaningless and unintelligible till the decryption key isn't available. The basic service delivered by cryptography is the capability to transmit information in such a way that unauthorized person can't understand it [2]. The original form of the message is known as plain text or clear text.…”
Section: Related Work Cryptographymentioning
confidence: 99%
“…Kar, and P. Pal Chaudhuri et al [10].A CA having a combination of XOR and XNOR rules is called Additive CA. They matrix algebraic tools that characterize Additive CA and help develop its applications in the field of VLSI testing.…”
Section: Additive Camentioning
confidence: 99%
“…Kar, and P. Pal Chaudhuri et al [10]. If the Rule of CA involves only XNOR logic then it is called the Complement rules .…”
Section: Complement Camentioning
confidence: 99%