arrow
Return

Systematically Quantifying Cryptanalytic Nonlinearities in Strong PUFs

delete2024-01-01
delete3
PRE
AI
K
Kuheli Pratihar
A
Aritra Hazra
U
Ulrich Rührmair
D
Debdeep Mukhopadhyay
DOI:10.1109/TIFS.2023.3329438delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Physically Unclonable Functions (PUFs) with large challenge space (also called Strong PUFs) are promoted for usage in authentications and various other cryptographic and security applications. In order to qualify for these cryptographic applications, the Boolean functions realized by PUFs need to possess a high nonlinearity (NL). However, with a large challenge space (usually >= 64 bits), measuring NL by classical techniques like the Walsh transformation is computationally infeasible. In this paper, we propose the usage of a heuristic-based measure called the non-homomorphicity test which estimates the cryptographic NL of Boolean functions with high accuracy in spite of not needing access to the entire challenge-response set. We also combine our analysis with a technique used in linear cryptanalysis, called Piling-up lemma, to measure the NL of popular PUF compositions. As a demonstration to justify the soundness of the metric, we perform extensive experimentation by first estimating the NL of constituent Arbiter/Bistable Ring PUFs using the non-homomorphicity test, and then applying them to quantify the same for their XOR compositions namely XOR Arbiter PUFs and XOR Bistable Ring PUF. Our findings show that the metric explains the impact of various parameter choices of these PUF compositions on the NL obtained and thus promises to be used as an important objective criterion for future efforts to evaluate PUF designs. While the framework is not representative of the machine learning robustness of PUFs, it can be a useful complementary tool to analyze the cryptanalytic strengths of PUF primitives.
Keywords:
Strong PUFs
nonlinearity
cryptanalysis
cryptanalytic attacks
non-homomorphicity tests

Journal

IEEE Transactions on Information Forensics and Security cover
IEEE Transactions on Information Forensics and Security
IF:
8
Papers:
5.3K
Citations:
2.3W

Organization

I
indian institute of technology system (iit system)
Scholars:
9.5W
Papers: 9.9W
Citations: 93
I
indian institute of technology (iit) - kharagpur
Scholars:
6.2K
Papers: 6.5K
Citations: 6
Cited Papers

Cited Papers

Physical unclonable functions
err2020-02-24
err321
PREAI
errGao, Yansong; Al-Sarawi, Said F.; Abbott, Derek
errShare
errSave
Transcatheter Versus Surgical Valve Replacement: A 24-months Propensity-matched Analysis of the SILCARD Registry
err2022-03-23
err0
errOAAI
errKrzysztof Wilczek; Michal Hawranek; Wojciech Wojakowski; Piotr Chodór; Michal Zembala; Pawel Buszman; Andrzej Bochenek; Marek Deja; Maciej Dyrbus; Daniel Ciesla; Zbigniew Kalarus; Mariusz Gasior; Marian Zembala
errShare
errSave
Mechanisms for the emergence of Gaussian correlations
err2022-03-30
err0
errOAAI
errMarek Gluza; Thomas Schweigler; Mohammadamin Tajik; João Sabino; Federica Cataldini; Frederik Skovbo Møller; Si-Cong Ji; Bernhard Rauer; Jörg Schmiedmayer; Jens Eisert; Spyros Sotiriadis
errShare
errSave
Weed management in glyphosate-resistant maize
err2020-01-01
err0
errOAAI
errMaicon Rodrigues da Silva; Leandro Galon; Emanuel Rodrigo de Oliveira Rossetto; Alexandre Ferreira da Silva; Emanuel Luis Favretto; Leonardo Brunetto; Alessandra Gallina; Antônio Marcos Loureiro da Silva; Rodrigo José Tonin
errShare
errSave
researcher View more