Mirosław Szaban

Dr. Mirosław Szaban

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 August 2008 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
MSMirosław Szaban
Mirosław Szaban
FSFranciszek Seredynski
Franciszek Seredynski

22 September 2006
Verified
Conference Paper
Closed access
MSMirosław Szaban
Mirosław Szaban
FSFranciszek Seredynski
Franciszek Seredynski
Pascal BouvryPascal Bouvry
Pascal Bouvry
The problem of generation by cellular automata of high quality pseudorandom sequences useful in cryptography is considered in the paper. For this purpose one dimensional nonuniform cellular automata is considered. The quality of pseudorandom sequences generated by cellular automata depends on collective behavior of rules assigned to cellular automata cells. Genetic algorithm is used to find suitable rules from predefined earlier set of rules. It has been shown that genetic algorithm eliminates bad subsets of rules and founds subsets of rules, which provide high quality pseudorandom sequences. These sequences are suitable for symmetric key cryptography and can be used in different cryptographic modules.

25 April 2012 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
APAnna Piwonska
Anna Piwonska
FSFranciszek Seredynski
Franciszek Seredynski
MSMirosław Szaban
Mirosław Szaban

1 April 2008 in 2008 IEEE International Symposium on Parallel and Distributed Processing
Verified
Conference Paper
Closed access
MSMirosław Szaban
Mirosław Szaban
FSFranciszek Seredynski
Franciszek Seredynski
Substitution boxes (S-boxes) play very important role in cryptography. In this paper we propose a new method based on applying Cellular Automata (CA) to create S-boxes. We present preliminary results suggesting that CA are able to realize a function of classical S-boxes. It was shown that proposed CA fulfills a number of creation conditions necessary to play a role of S-box table. Proposed CA offer a solution which produces result comparable with classical S-boxes.

1 January 2009
Verified
Book Chapter
Closed access
PDF file
MSMirosław Szaban
Mirosław Szaban
FSFranciszek Seredynski
Franciszek Seredynski

1 January 2012
Verified
Book Chapter
Closed access
PDF file
MSMirosław Szaban
Mirosław Szaban
FSFranciszek Seredynski
Franciszek Seredynski