Modeling Strong Physically Unclonable Functions with Metaheuristics
Carlos Coello Coello
Marina Krcek (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Marko Durasevic (University of Zagreb)
Luca Mariot (University of Twente, TU Delft - Electrical Engineering, Mathematics and Computer Science)
Domagoj Jakobovic (University of Zagreb)
Stjepan Picek (TU Delft - Electrical Engineering, Mathematics and Computer Science, Radboud Universiteit Nijmegen)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Evolutionary algorithms have been successfully applied to attack Physically Unclonable Functions (PUFs). CMA-ES is recognized as the most powerful option for a type of attack called the reliability attack. In this paper, we take a step back and systematically evaluate several metaheuristics for the challenge-response pair-based attack on strong PUFs. Our results confirm that CMA-ES has the best performance, but we note several other algorithms with similar performance while having smaller computational costs.