{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T05:10:19Z","timestamp":1756357819772,"version":"3.44.0"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:00:00Z","timestamp":1751760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T00:00:00Z","timestamp":1751760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,7,6]]},"DOI":"10.1109\/isvlsi65124.2025.11130282","type":"proceedings-article","created":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T18:20:15Z","timestamp":1756318815000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["MADel0: A Modelling and Assessment Framework for Delay PUFs leveraging Gradient-based Optimization Techniques"],"prefix":"10.1109","author":[{"given":"Durba","family":"Chatterjee","sequence":"first","affiliation":[{"name":"Digital Security Group Radboud University,Nijmegen,The Netherlands"}]},{"given":"Debdeep","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"IIT Kharagpur,Department of CSE,Kharagpur,India"}]},{"given":"Aritra","family":"Hazra","sequence":"additional","affiliation":[{"name":"IIT Kharagpur,Department of CSE,Kharagpur,India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48324-4_27"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586249"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415647"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3254434"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2818186"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76717-8"},{"key":"ref7","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv preprint arXiv:1412.6980"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2005.859470"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3390\/electronics9101715"},{"key":"ref10","article-title":"On the convergence of adam and beyond","author":"Reddi","year":"2019","journal-title":"arXiv preprint arXiv:1904.09237"},{"key":"ref11","first-page":"237","article-title":"Modeling attacks on physical unclonable functions","author":"R\u00c3\u00bchrmair","year":"2010","journal-title":"ACM CCS"},{"key":"ref12","article-title":"Deep learning based model building attacks on arbiter puf compositions","author":"Santikellur","year":"2019","journal-title":"Cryptology ePrint Archive"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35423-7_28"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278484"},{"key":"ref15","article-title":"Rmsprop: Divide the gradient by a running average of its recent magnitude. coursera: Neural networks for machine learning","volume":"17","author":"Tieleman","year":"2012","journal-title":"Neural Networks Mach. Learn"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2021.i2.357-389"},{"article-title":"pypuf: Cryptanalysis of Physically Unclonable Functions","year":"2021","author":"Wisiol","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2020.i3.97-120"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3189533"},{"key":"ref20","article-title":"Adadelta: an adaptive learning rate method","author":"Zeiler","year":"2012","journal-title":"arXiv preprint arXiv:1212.5701"},{"key":"ref21","article-title":"On the convergence of adaptive gradient methods for nonconvex optimization","author":"Zhou","year":"2018","journal-title":"arXiv preprint arXiv:1808.05671"}],"event":{"name":"2025 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","start":{"date-parts":[[2025,7,6]]},"location":"Kalamata, Greece","end":{"date-parts":[[2025,7,9]]}},"container-title":["2025 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11129697\/11130193\/11130282.pdf?arnumber=11130282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T04:32:15Z","timestamp":1756355535000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11130282\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,6]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isvlsi65124.2025.11130282","relation":{},"subject":[],"published":{"date-parts":[[2025,7,6]]}}}