{"title":"子空间建模:基于机器学习的XOR仲裁者PUF注册解决方案","authors":"Amir Ali Pour, D. Hély, V. Beroulle, G. D. Natale","doi":"10.1109/isqed54688.2022.9806267","DOIUrl":null,"url":null,"abstract":"—In this work we present sub-space modeling of XOR Arbiter PUF as a cost efficient solution for enrollment for the designers’ community. Our goal is to demonstrate a method which can reduce the overall cost in terms of number of CRPs required for training, training time and memory. Here we propose to reduce the complexity of the modeling target by dividing the PUF into smaller sub-components and model each sub-component of the PUF independently. Our early experimental assessment show that our sub-space modeling can significantly reduce the cost of training compared to some of the latest works, thus it is potentially a cost-efficient solution to enroll strong PUF with high complexity.","PeriodicalId":302936,"journal":{"name":"IEEE International Symposium on Quality Electronic Design","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sub-Space Modeling: An Enrollment Solution for XOR Arbiter PUF using Machine Learning\",\"authors\":\"Amir Ali Pour, D. Hély, V. Beroulle, G. D. Natale\",\"doi\":\"10.1109/isqed54688.2022.9806267\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"—In this work we present sub-space modeling of XOR Arbiter PUF as a cost efficient solution for enrollment for the designers’ community. Our goal is to demonstrate a method which can reduce the overall cost in terms of number of CRPs required for training, training time and memory. Here we propose to reduce the complexity of the modeling target by dividing the PUF into smaller sub-components and model each sub-component of the PUF independently. Our early experimental assessment show that our sub-space modeling can significantly reduce the cost of training compared to some of the latest works, thus it is potentially a cost-efficient solution to enroll strong PUF with high complexity.\",\"PeriodicalId\":302936,\"journal\":{\"name\":\"IEEE International Symposium on Quality Electronic Design\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Symposium on Quality Electronic Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/isqed54688.2022.9806267\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Symposium on Quality Electronic Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/isqed54688.2022.9806267","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Sub-Space Modeling: An Enrollment Solution for XOR Arbiter PUF using Machine Learning
—In this work we present sub-space modeling of XOR Arbiter PUF as a cost efficient solution for enrollment for the designers’ community. Our goal is to demonstrate a method which can reduce the overall cost in terms of number of CRPs required for training, training time and memory. Here we propose to reduce the complexity of the modeling target by dividing the PUF into smaller sub-components and model each sub-component of the PUF independently. Our early experimental assessment show that our sub-space modeling can significantly reduce the cost of training compared to some of the latest works, thus it is potentially a cost-efficient solution to enroll strong PUF with high complexity.