Napredna pretraga

Pregled bibliografske jedinice broj: 765244

Evolutionary Methods for the Construction of Cryptographic Boolean Functions


Picek, Stjepan; Jakobović, Domagoj; Miller, Julian F.; Marchiori, Elena; Batina, Lejla
Evolutionary Methods for the Construction of Cryptographic Boolean Functions // Lecture Notes in Computer Science Volume 9025
Copenhagen, Danska, 2015. str. 192-204 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)


Naslov
Evolutionary Methods for the Construction of Cryptographic Boolean Functions

Autori
Picek, Stjepan ; Jakobović, Domagoj ; Miller, Julian F. ; Marchiori, Elena ; Batina, Lejla

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Lecture Notes in Computer Science Volume 9025 / - , 2015, 192-204

ISBN
978-3-319-16501-1

Skup
18th European Conference, EuroGP 2015

Mjesto i datum
Copenhagen, Danska, 8-10.4.2015

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
Genetic programming ; cartesian genetic programming ; cryptographic functions

Sažetak
Boolean functions represent an important primitive when constructing many stream ciphers. Since they are often the only nonlinear element of such ciphers, without them the algorithm would be trivial to break. Therefore, it is not surprising there exist a substantial body of work on the methods of constructing Boolean functions. Among those methods, evolutionary computation (EC) techniques play a significant role. Previous works show it is possible to use EC methods to generate high-quality Boolean functions that even surpass those built by algebraic constructions. However, up to now, there was no work investigating the use of Cartesian Genetic Programming (CGP) for producing Boolean functions suitable for cryptography. In this paper we compare Genetic Programming (GP) and CGP algorithms in order to reach the conclusion which algorithm is better suited to evolve Boolean functions suitable for cryptographic usage. Our experiments show that CGP performs much better than the GP when the goal is obtaining as high as possible nonlinearity. Our results indicate that CGP should be further tested with different fitness objectives in order to check the boundaries of its performance.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo



POVEZANOST RADA


Ustanove
Fakultet elektrotehnike i računarstva, Zagreb