Designing cryptographically strong \(S\)-boxes with the use of cellular automata
type: Item
instance of: scholarly article
title: Designing cryptographically strong \(S\)-boxes with the use of cellular automata
zbMATH Open document ID: 1284.94116
author: Mirosław Szaban
author: Franciszek Seredynski
publication date: 2014-04-02T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68Q80
zbMATH DE Number: 6277228
MaRDI profile type: Publication
full work available at URL: v10065-008-0022-4
OpenAlex ID: W2028477600
cites work: Q4869527
cites work: Multi-objective optimisation of bijective S-boxes
cites work: Q3150942
cites work: Information Security and Privacy
cites work: The designs of S-boxes by simulated annealing
cites work: Q4510902
cites work: Q3839176
cites work: Q4945395
DOI: 10.2478/V10065-008-0022-4
published in: Annales Universitatis Mariae Curie-Sklodowska, sectio AI – Informatica
Recommended article: Q2998126
Recommended article: Cryptographically Strong S-Boxes Based on Cellular Automata
Recommended article: Cellular automata based S-boxes
Recommended article: Q5117024
Recommended article: Secure and Computationally Efficient Cryptographic Primitive Based on Cellular Automaton
Recommended article: Q4485877
Recommended article: On the use of cellular automata in symmetric cryptography
description: scientific article