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.
Original language | English |
---|---|
Title of host publication | GECCO 2023 Companion - Proceedings of the 2023 Genetic and Evolutionary Computation Conference Companion |
Publisher | ACM |
Pages | 719-722 |
Number of pages | 4 |
ISBN (Electronic) | 9798400701207 |
DOIs | |
Publication status | Published - 2023 |
Event | 2023 Genetic and Evolutionary Computation Conference Companion, GECCO 2023 Companion - Lisbon, Portugal Duration: 15 Jul 2023 → 19 Jul 2023 |
Publication series
Name | GECCO 2023 Companion - Proceedings of the 2023 Genetic and Evolutionary Computation Conference Companion |
---|
Conference
Conference | 2023 Genetic and Evolutionary Computation Conference Companion, GECCO 2023 Companion |
---|---|
Country/Territory | Portugal |
City | Lisbon |
Period | 15/07/23 → 19/07/23 |
Bibliographical note
Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-careOtherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Keywords
- CMA-ES
- CRP
- Metaheuristics
- Physically Unclonable Functions