Područje interesa Odjela za računalnu inteligenciju je teorija, oblikovanje, primjena i razvoj biološki i lingvistički motiviranih računalnih paradigmi s naglaskom na neuronske mreže, konekcijske sustave, genetičke algoritme, evolucijsko programiranje, neizrazite sustave i hibridne inteligentne sustave koji su temeljeni na ovim paradigmama.
Odjel za računalnu inteligenciju
Odjel za računalnu inteligenciju Hrvatske sekcije IEEE poziva Vas na predavanje:
Cryptography by Cellular Automata
koje će se održati Luca Mariot u utorak, 14. studenoga 2017. s početkom u 13:05 u prostoriji B2; predviđeno trajanje predavanja je 45 minuta, a predavanje će biti na engleskom jeziku.
Pozivamo i sve zainteresirane studente, a posebice sve kojima je interesantno područje evolucijskog računarstva, kriptografije te njihovog spoja.
Kratak opis predavanja te životopis predavača dostupni su u nastavku.
Abstract. Cellular Automata (CA) have been studied for a long time as a possible way to implement cryptographic primitives. Indeed, CA are interesting for cryptography for two reasons: first, the complexity emerging from the dynamical behavior of certain CA can be used to design cryptosystems satisfying strong security properties. Second, being a massively parallel computational model, CA are especially interesting for implementing efficient cryptographic algorithms in hardware. Nowadays, there are some well known block ciphers who include in their design transformations based on CA. This is the case of the χ nonlinear transformation used in the K ECCAK sponge construction, which won the SHA-3
competition for the NIST cryptographic hash function standard.
In this talk, I will present the research carried out during my PhD about the applications of CA to cryptography. In particular, I will address two main topics. The first one concerns the analysis of the cryptographic properties of CA, viewed as a particular type of Boolean functions. There, I will present some theoretical bounds on the properties achievable by CA, as well as some experimental results on evolving CA rules by means of Evolutionary Computation (EC) techniques. The second topic of the talk is about the design of Secret Sharing Schemes (SSS) based on CA. In this case, I will present a theoretical characterization of CA-based SSS in terms of orthogonal Latin squares (OLS), and also how to evolve such OLS through EC techniques.
Short Bio. Luca Mariot earned his bachelor and master degree in Computer Science at the University of Milano-Bicocca, Italy. Before starting the PhD, he carried out a one-year research period at Consorzio Milano Ricerche focused on cryptographic protocols for anonymizing pharmaceutical prescription data. At the moment, he is completing his PhD in Computer Science at the University of Milano-Bicocca and the University of Nice Sophia Antipolis, France, under a double degree agreement.