Pregled bibliografske jedinice broj: 709066
Evolving Genetic Algorithms for Fault Injection Attacks
Evolving Genetic Algorithms for Fault Injection Attacks // Information and Communication Technology, Electronics and Microelectronics (MIPRO 2014)
Opatija: Institute of Electrical and Electronics Engineers (IEEE), 2014. str. 1356-1361 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 709066 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Evolving Genetic Algorithms for Fault Injection Attacks
Autori
Picek, Stjepan ; Batina, Lejla ; Jakobović, Domagoj ; Rafael, Boix Carpi
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Information and Communication Technology, Electronics and Microelectronics (MIPRO 2014)
/ - Opatija : Institute of Electrical and Electronics Engineers (IEEE), 2014, 1356-1361
ISBN
978-953-233-081-6
Skup
MIPRO
Mjesto i datum
Opatija, Hrvatska, 26.05.2014. - 30.05.2014
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Genetic algorithms ; Monte Carlo methods ; Optimization ; Search problems ; Security
Sažetak
Genetic algorithms are used today to solve numerous difficult problems. However, it is often needed to specialize and adapt them further in order to successfully tackle some specific problem. One such example is the fault injection attack where the goal is to find a specific set of parameters that can lead to a successful cryptographic attack in a minimum amount of time. In this paper we address the process of the specialization of genetic algorithm from its standard form to the final, highly-specialized one. In this process we needed to customize crossover operator, add a mapping between the values in cryptographic domain and genetic algorithm domain and finally to adapt genetic algorithm to work on-the-fly. For the last phase of development we plan to go to the memetic algorithm by adding a local search strategy. Furthermore, we give a comparison between our algorithm and random search which is the mostly employed method for this problem at the moment. Our experiments show that our algorithm significantly outperforms the random search.
Izvorni jezik
Engleski
Znanstvena područja
Računarstvo
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb