Physically non-cloneable arbiter-type function with non-linear path pairs
https://doi.org/10.21122/2309-4923-2023-1-54-62
Abstract
Physically unclonable functions (PUFs) are basic physical cryptographical primitives, providing to solve tasks such as unclonable identification, digital device authentication and copyright authentication, true random sequence generation, etc. The major features of PUFs are stability, unpredictability and irreproducibility, due to uncontrollable random variations of distinctive features of the raw materials and technological processes used during their manufacturing. Generally, PUF are digital circuits that extract such variations and convert them into a binary format, which applied for further use. Among the variety of PUF types, an Arbiter PUF (APUF) is distinguished, which is a digital circuit with N-bit challenge input and single output for one-bit response generation. The functionality of APUF is based on comparison of transition time of two copies of the test signal along a pair of configurable paths, selected by the challenge value CH from a set of 2N all possible pairs. The result of the comparison is the binary value of the response. The set of all challenge-response pairs is a random, unpredictable and irreproducible in the cases of implementation of cloned PUF circuits both on single and/or on another chips, also using different technologies. This article presents a new approach to the synthesis of the APUF circuits, based on the permutation network elements, which allow to construct the nonlinear structures of pair of paths. This implies the potential complication of building an APUF model to attack its implemented instances. This article presents new schematic solutions for the synthesis of APUF circuits. Also, the main characteristics of the proposed APUF circuits implemented on the Xilinx Zynq-7000 FPGA is analyzed.
About the Authors
A. A. Ivaniuk
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Ivaniuk A. A. - doctor of sciences, associated professor, professor at computer science department at the Belarusian State University of Informatics and Radioelectronics.
Minsk
A. Y. Shamyna
Belarusian State University of Informatics and Radioelectronics
Belarus
Belarus
Shamyna A. Y. - Master of Engineering sciences, Senior Lecturer at the Belarusian State University of Informatics and Radioelectronics.
Minsk
References
1. Yarmolik, V.N. Fizicheski nekloniruemye funkcii / V.N. Yarmolik, Yu.G. Vashinko // Informatika. – 2011. –№ 2(30). – PP. 92-103.
2. Gassend, B. Silicon physical random functions / B. Gassend [et al.] // Proc. of 9th Computer and Communications Security Conf. (CCS’02), Washington, DC USA, 18–22 Nov. 2002. – Washington, 2002. – PP. 148-160.
3. Waksman, A. A Permutation Network / A. Waksman // Journal of the ACM. – 1968. – № 1(15). – Pp. 159-163.
4. Santikellur, P. Deep Learning based Model Building Attacks on Arbiter PUF Compositions / P. Santikellur, A. Bhattacharyay, R.S. Chakraborty // IACR Cryptol. ePrint Arch. – 2019. – 10 p. – (Preprint / Paper 2019/566).
5. Zhang, J. Set-Based Obfuscation for Strong PUFs Against Machine Learning Attacks / J. Zhang, C. Shen // IEEE Transactions on Circuits and Systems I: Regular Papers. – 2021. – № 1(68). – Pp. 288-300.
6. ZyboZ7: Zynq-7000 ARM/FPGA SoC Development Board [Electronic resource] . – Mode of access: https://digilent.com/reference/programmable-logic/zybo-z7/start. – Date of access: 19.01.2023.
7. Morozov, S. An Analysis of Delay Based PUF Implementations on FPGA / S. Morozov, A. Maiti, P. Schaumont // Proc. of International Symposium on Applied Reconfigurable Computing: Tools and Applications (ARC 2010), Los Angeles, CA, US, 25–27 Mar. 2010. – Los Angeles, 2010. – P. 382–387.
8. Costa, L.F. Exploring complex networks through random walks [Electronic resource] / L.F. Costa, G. Travieso. – Physical Review E, 2007. – Mode of access: https://arxiv.org/pdf/physics/0604193.pdf. – Date of access: 19.01.2023.
9. Rukhin, A. A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications [Electronic resource] / A. Rukhin [et al.] ‒ NIST Special Publication 800-22, 2010. ‒ Mode of access: https://www.nist.gov/publications/statistical-test-suite-random-and-pseudorandom-number-generators-cryptographic. Date of access: 19.01.2023.
10. Martin-Navarro, J.L. Review of the Lineal Complexity Calculation through Binomial Decomposition-Based Algorithms / J.L. Martin-Navarro, F.S. Amparo // Mathematics. – 2021. ‒ № 5(9) – Pp. 1-22.
11. Maiti, A. A Systematic Method to Evaluate and Compare the Performance of Physical Unclonable Functions /A. Maiti, V. Gunreddy, P. Schaumont. In: Athanas, P., Pnevmatikatos, D., Sklavos, N. (eds.) Embedded Systems Design with FPGAs. Springer, New York, NY, 2013. – Pp. 245-267.
Review
For citations:
Ivaniuk A.A., Shamyna A.Y. Physically non-cloneable arbiter-type function with non-linear path pairs. «System analysis and applied information science». 2023;(1):54-62. (In Russ.) https://doi.org/10.21122/2309-4923-2023-1-54-62
Views:
286
Email this article 