Paper 2022/1766
Systematically Quantifying Cryptanalytic Non-Linearities in Strong PUFs
Abstract
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 non-linearity~(NL). However, with a large challenge space~(usually
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- Keywords
- Strong PUFsNon-linearityCryptanalysisCryptanalytic AttacksNon-homomorphicity Tests
- Contact author(s)
-
durba chatterjee94 @ gmail com
its kuheli96 @ gmail com
aritrah @ cse iitkgp ac in
ruehrmair @ ilo de
debdeep mukhopadhyay @ gmail com - History
- 2022-12-27: revised
- 2022-12-26: received
- See all versions
- Short URL
- https://ia.cr/2022/1766
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2022/1766, author = {Durba Chatterjee and Kuheli Pratihar and Aritra Hazra and Ulrich Rührmair and Debdeep Mukhopadhyay}, title = {Systematically Quantifying Cryptanalytic Non-Linearities in Strong {PUFs}}, howpublished = {Cryptology {ePrint} Archive, Paper 2022/1766}, year = {2022}, url = {https://eprint.iacr.org/2022/1766} }