Modeling Strong Physically Unclonable Functions with Metaheuristics

Conference paper (2023)

Authors

Marko Durasevic University of Zagreb
L. Mariot University of Twente,
Domagoj Jakobović University of Zagreb
S. Picek , Radboud Universiteit Nijmegen
Copyright: © 2023 Carlos Coello Coello, M. Krcek, Marko Durasevic, L. Mariot, Domagoj Jakobovic, S. Picek
DOI: https://doi.org/10.1145/3583133.3590699
More Info
expand_more

Published Date

2023

Language

English

Reuse Rights

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.

Files

3583133.3590699.pdf
(pdf | 0.714 Mb)
- Embargo expired in 05-02-2024