{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T07:03:13Z","timestamp":1780038193043,"version":"3.53.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"National Board for Higher Mathematics, Department of Atomic Energy, Govt. of India"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s10623-026-01861-7","type":"journal-article","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T11:04:29Z","timestamp":1778238269000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multipath PA-PUFs generate all Boolean functions"],"prefix":"10.1007","volume":"94","author":[{"given":"R.","family":"Radheshwar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dibyendu","family":"Roy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pantelimon","family":"St\u0103nic\u0103","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,8]]},"reference":[{"key":"1861_CR1","doi-asserted-by":"crossref","unstructured":"Becker G.T.: The gap between promise and reality: on the insecurity of XOR arbiter PUFs. In: G\u00fcneysu T., Handschuh H.: (eds.) CHES 2015. LNCS, 9293, pp. 535\u2013555, Springer, Heidelberg (2015).","DOI":"10.1007\/978-3-662-48324-4_27"},{"key":"1861_CR2","doi-asserted-by":"crossref","unstructured":"Chatterjee D., Pratihar K., Hazra A., R\u00fchrmair U., Mukhopadhyay D.: Systematically quantifying cryptanalytic nonlinearities in strong PUFs. IEEE Transactions on Information Forensics and Security (2023).","DOI":"10.1109\/TIFS.2023.3329438"},{"key":"1861_CR3","unstructured":"Chen Q., Csaba G., Ju X., Natarajan S. B., Lugli P., Stutzmann M., Schlichtmann U., R\u00fchrmair U.: Analog circuits for physical cryptography. Proc. 2009 12th International Symposium on Integrated Circuits, pp. 121\u2013124, IEEE (2009)."},{"key":"1861_CR4","doi-asserted-by":"crossref","unstructured":"Devadas S.: Physical unclonable functions and secure processors. In Clavier C., Gaj K.: (eds.) CHES 2009. LNCS, 5747, p. 65, Springer, Heidelberg (2009).","DOI":"10.1007\/978-3-642-04138-9_5"},{"key":"1861_CR5","doi-asserted-by":"crossref","unstructured":"Gassend B., Clarke D., Dijk M. V., Devadas S.: Silicon physical random functions. Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 148\u2013160, ACM (2002).","DOI":"10.1145\/586110.586132"},{"key":"1861_CR6","doi-asserted-by":"crossref","unstructured":"Guajardo J., Kumar S.S., Schrijen G. J., Tuyls P.: FPGA intrinsic PUFs and their use for IP protection. Cryptographic hardware and embedded systems - CHES 2007, LNCS, 4727, pp. 63\u201380, Springer (2007).","DOI":"10.1007\/978-3-540-74735-2_5"},{"key":"1861_CR7","doi-asserted-by":"crossref","unstructured":"Hori Y., Takahiro Y., Toshihiro K., Akashi S.: Quantitative and statistical performance evaluation of arbiter physical unclonable functions on FPGAs. In 2010 International conference on reconfigurable computing and FPGAs, pp. 298\u2013303. IEEE (2010).","DOI":"10.1109\/ReConFig.2010.24"},{"key":"1861_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.dam.2024.05.013","volume":"356","author":"M Kansal","year":"2024","unstructured":"Kansal M., Roy A., Roy D., Bodapati S., Chattopadhyay A.: Priority arbiter PUF: analysis. Discret. Appl. Math. 356, 71\u201395 (2024).","journal-title":"Discret. Appl. Math."},{"key":"1861_CR9","doi-asserted-by":"crossref","unstructured":"Krishna A. R., Narasimhan S., Wang X., Bhunia S.: MECCA: A robust low-overhead PUF using embedded memory array. Cryptographic hardware and embedded systems - CHES 2011, LNCS, 6917, pp. 407\u2013420, Springer (2011).","DOI":"10.1007\/978-3-642-23951-9_27"},{"key":"1861_CR10","doi-asserted-by":"crossref","unstructured":"Kumar S. S., Guajardo J., Maes R., Schrijen G. J., Tuyls P.: Extended abstract: The butterfly PUF protecting IP on every FPGA. IEEE International workshop on hardware-oriented security and trust, Anaheim, pp. 67\u201370, IEEE (2008).","DOI":"10.1109\/HST.2008.4559053"},{"key":"1861_CR11","doi-asserted-by":"crossref","unstructured":"Lee J.W., Lim D, Gassend B., Suh G.E., Dijk M.V., Devadas S.: A technique to build a secret key in integrated circuits for identification and authentication applications. Symposium on VLSI Circuits. Digest of Technical Papers, pp. 176\u2013179, IEEE (2004).","DOI":"10.1109\/VLSIC.2004.1346548"},{"issue":"10","key":"1861_CR12","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/TVLSI.2005.859470","volume":"13","author":"D Lim","year":"2005","unstructured":"Lim D., Lee J.W., Gassend B., Suh G.E., Dijk M.V., Devadas S.: Extracting secret keys from integrated circuits. IEEE Trans. Very Large Scale Integration (VLSI) Syst. 13(10), 1200\u20131205 (2005).","journal-title":"IEEE Trans. Very Large Scale Integration (VLSI) Syst."},{"key":"1861_CR13","unstructured":"Lofstrom K., Daasch W. R., Taylor D.: IC identification circuit using device mismatch. IEEE International Solid-State Circuits Conference. Digest of Technical Papers (Cat. No. 00CH37056), pp. 372\u2013373, IEEE (2000)."},{"key":"1861_CR14","doi-asserted-by":"crossref","unstructured":"Maiti A., Vikash G., Patrick S.: A systematic method to evaluate and compare the performance of physical unclonable functions. In Embedded systems design with FPGAs, pp. 245-267. Springer, New York (2012).","DOI":"10.1007\/978-1-4614-1362-2_11"},{"issue":"1","key":"1861_CR15","doi-asserted-by":"publisher","first-page":"501","DOI":"10.46586\/tches.v2024.i1.501-526","volume":"2024","author":"N Mishra","year":"2024","unstructured":"Mishra N., Pratihar K., Mandal S., Chakraborty A., R\u00fchrmair U., Mukhopadhyay D.: Calypso: an enhanced search optimization based framework to model delay-based PUFs. IACR Trans. Cryptogr. Hardware Embedded Syst. 2024(1), 501\u2013526 (2024).","journal-title":"IACR Trans. Cryptogr. Hardware Embedded Syst."},{"key":"1861_CR16","doi-asserted-by":"crossref","unstructured":"Roy A., Roy D., Maitra S.: How do the arbiter PUFs sample the Boolean function class? In the proceeding of 28th Edition of Selected Areas in Cryptography (SAC 2021). Springer, LNCS (2021).","DOI":"10.1007\/978-3-030-99277-4_6"},{"key":"1861_CR17","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair U., Jaeger C., Hilgers C., Algasinger M., Csaba G., Stutzmann M.: Security applications of diodes with unique current-voltage characteristics (short paper). Financial cryptography and data security: 14th international conference, FC 2010, Tenerife, Canary Islands, January 25-28, 2010, Revised Selected Papers. 14, pp. 328\u2013335, Springer (2010).","DOI":"10.1007\/978-3-642-14577-3_26"},{"key":"1861_CR18","doi-asserted-by":"crossref","unstructured":"R\u00fchrmair U., Sehnke F., S\u00f6lter J., Dror G., Devadas S., Schmidhuber J.: Modeling attacks on physical unclonable functions. In: Proceedings of the 17th ACM conference on computer and communications security, pp. 237\u2013249. ACM (2010).","DOI":"10.1145\/1866307.1866335"},{"key":"1861_CR19","doi-asserted-by":"crossref","unstructured":"Siddhanti A. A., Bodapati S., Chattopadhyay A., Maitra S., Roy D., St\u0103nic\u0103 P.: Analysis of the strict avalanche criterion in variants of arbiter-based physically unclonable functions. Progress in Cryptology-INDOCRYPT 2019, LNCS, 11898, pp. 556\u2013577, Springer (2019).","DOI":"10.1007\/978-3-030-35423-7_28"},{"key":"1861_CR20","doi-asserted-by":"crossref","unstructured":"Simons P., van der Sluis E., van der Leest V.: Buskeeper PUFs, a promising alternative to D Flip-Flop PUFs. In 2012 IEEE international symposium on hardware-oriented security and trust, pp. 7\u201312, IEEE (2012).","DOI":"10.1109\/HST.2012.6224311"},{"key":"1861_CR21","doi-asserted-by":"crossref","unstructured":"Singh S., Bodapati S., Patkar S., Leupers R., Chattopadhyay A., Merchant F.: PA-PUF: a novel priority arbiter PUF. IFIP\/IEEE 30th international conference on very large scale integration (VLSI-SoC), Patras, Greece, pp. 1\u20136, IEEE (2022).","DOI":"10.1109\/VLSI-SoC54400.2022.9939642"},{"key":"1861_CR22","doi-asserted-by":"crossref","unstructured":"Suh G. E., Devadas S.: Physical unclonable functions for device authentication and secret key generation. 44th ACM\/IEEE Design Automation Conference, San Diego, pp. 9\u201314 (2007).","DOI":"10.1109\/DAC.2007.375043"},{"key":"1861_CR23","doi-asserted-by":"crossref","unstructured":"Suzuki D., Shimizu K.: The glitch PUF: a new delay-PUF architecture exploiting glitch shapes. Cryptographic hardware and embedded systems - CHES 2010, LNCS, 6225, pp. 366\u2013382, Springer (2010).","DOI":"10.1007\/978-3-642-15031-9_25"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01861-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01861-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01861-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T06:20:28Z","timestamp":1780035628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01861-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["1861"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01861-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"18 April 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"104"}}