Definitions and Preliminaries
This chapter focuses on the background information and notations required to understand the general concept of PUFs, PAC model and several mathematical representations established to launch ML attacks against PUFs. The material collected and reworked in this chapter has been first presented in Ganji et al. (J Cryptogr Eng Spec Sect Proofs, 2014:1–10, 2016, ; Trust and trustworthy computing, Springer, Berlin, pp. 22–39, 2015, ; Let me prove it to you: RO PUFs are provably learnable, 2015, ; Ganji et al. International conference on cryptographic hardware and embedded systems–CHES 2016, Springer, Berlin, pp. 391–411, 2016, ; J Cryptogr Eng, 2017, ).