2010
DOI: 10.1007/s11227-010-0398-y
|View full text |Cite
|
Sign up to set email alerts
|

Improving quality of DES S-boxes by cellular automata-based S-boxes

Abstract: In the paper we use recently proposed cellular automata (CA) based methodology (Szaban and Seredynski in LNCS, vol. 5191, pp. 478-485, 2008) to design the 6 × 4 S-boxes functionally equivalent to S-boxes used in current cryptographic standard known as Data Encryption Standard (DES). We provide an exhaustive experimental analysis of the proposed CA-based S-boxes in terms of nonlinearity, autocorrelation, balance and strict avalanche criterion, and compare results with ones corresponding to DES S-boxes. We show… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 9 publications
(13 reference statements)
0
3
0
Order By: Relevance
“…The cellular automata-based algorithms [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17] inherently support parallel computing architecture but their implementation never focuses on parallel computation. The traditional popular security algorithms are designed to achieve more security, but performance is not a criterion, as it uses a complex operation during implementation and uses multiple keys.…”
Section: Proposed Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The cellular automata-based algorithms [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17] inherently support parallel computing architecture but their implementation never focuses on parallel computation. The traditional popular security algorithms are designed to achieve more security, but performance is not a criterion, as it uses a complex operation during implementation and uses multiple keys.…”
Section: Proposed Algorithmmentioning
confidence: 99%
“…The work of S. Nandi [4] and M. Tomassini [5] explained different applications of cellular automata in the area of cryptography. Seredynski [6][7][8] proposed a block encryption system using cellular automata and the design of an S-box using cellular automata and improved the performance of the S-box. P. Anghelescu [9] offered a hybrid additive cellular automata technique to block encryption.…”
Section: Introductionmentioning
confidence: 99%
“…He creates a cellular automationbased pseudo-random number generator. Szaban and Seredynski [7], [8] proposed a block encryption system using cellular automata and the design of an S-box using cellular automata and improving S-box performance. Hanin et al [9] presented a lightweight cellular automata-based hash algorithm (L-CAHASH).…”
Section: Introductionmentioning
confidence: 99%