|
Design of S-Boxes Using Genetic Algorithms
Hovorka, Bedřich ; Zadina, Martin (referee) ; Hanáček, Petr (advisor)
This work deals with part of the encryption algorithm, called S-box and its development. For its development is used evolutionary computing, such as classical genetic algorithm, Estimation of Distribution Algorithm, Cartesian genetic programming and multi-criteria VEGA and SPEA algorithms. This thesis aims to test the properties of substitution boxes to its evolutionary development. Firstly, the work deals with cryptography and issues of s-boxes. There are explained basic concepts and describes the selected criteria of safety. Next chapter explains evolutionary algorithms and multi-criteria optimization. This knowledge is used to design and program implementation, which are described below. Finally discusses the application of the criteria studied. Discussed here is searching S-boxes in both single-criteria, and especially in multi-criteria genetic search.
|
|
Simulator of Railway Interlocking
Hovorka, Bedřich ; Polášek, Petr (referee) ; Martinek, David (advisor)
Railway interlocking is a dispatching facility for traffic control. The dispatcher controls train paths by setting switches and signals. In this thesis, I describe the design and implementation of a simple simulator of the facility in the Java language. I have studied functions of this facility. I interested with structure of whole application. And I implemented behaviour of foundamental elements.
|
|
Simulator of Railway Interlocking
Hovorka, Bedřich ; Polášek, Petr (referee) ; Martinek, David (advisor)
Railway interlocking is a dispatching facility for traffic control. The dispatcher controls train paths by setting switches and signals. In this thesis, I describe the design and implementation of a simple simulator of the facility in the Java language. I have studied functions of this facility. I interested with structure of whole application. And I implemented behaviour of foundamental elements.
|
|
Design of S-Boxes Using Genetic Algorithms
Hovorka, Bedřich ; Zadina, Martin (referee) ; Hanáček, Petr (advisor)
This work deals with part of the encryption algorithm, called S-box and its development. For its development is used evolutionary computing, such as classical genetic algorithm, Estimation of Distribution Algorithm, Cartesian genetic programming and multi-criteria VEGA and SPEA algorithms. This thesis aims to test the properties of substitution boxes to its evolutionary development. Firstly, the work deals with cryptography and issues of s-boxes. There are explained basic concepts and describes the selected criteria of safety. Next chapter explains evolutionary algorithms and multi-criteria optimization. This knowledge is used to design and program implementation, which are described below. Finally discusses the application of the criteria studied. Discussed here is searching S-boxes in both single-criteria, and especially in multi-criteria genetic search.
|