Ehsan Aerabi, A. E. Amirouche, Houda Ferradi, R. Géraud, D. Naccache, J. Vuillemin
{"title":"连体微处理器","authors":"Ehsan Aerabi, A. E. Amirouche, Houda Ferradi, R. Géraud, D. Naccache, J. Vuillemin","doi":"10.1109/HST.2016.7495558","DOIUrl":null,"url":null,"abstract":"Over the last twenty years, the research community has devised sophisticated methods for retrieving secret information from side-channel emanations, and for resisting such attacks. This paper introduces a new CPU architecture called the Conjoined Microprocessor (CμP). The CμP can randomly interleave the execution of two programs at very low extra hardware cost. We developed for the CμP a preprocessor tool that turns a target algorithm into two (or more) separate queues like Q0 and Q1 that can run in alternation. Q0 and Q1 fulfill the same operation as the original target algorithm. Power-analysis resistance is achieved by randomly alternating the execution of Q0 and Q1, with different runs resulting in different interleavings. Experiments reveal that this architecture is indeed effective against CPA.","PeriodicalId":194799,"journal":{"name":"2016 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The Conjoined Microprocessor\",\"authors\":\"Ehsan Aerabi, A. E. Amirouche, Houda Ferradi, R. Géraud, D. Naccache, J. Vuillemin\",\"doi\":\"10.1109/HST.2016.7495558\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Over the last twenty years, the research community has devised sophisticated methods for retrieving secret information from side-channel emanations, and for resisting such attacks. This paper introduces a new CPU architecture called the Conjoined Microprocessor (CμP). The CμP can randomly interleave the execution of two programs at very low extra hardware cost. We developed for the CμP a preprocessor tool that turns a target algorithm into two (or more) separate queues like Q0 and Q1 that can run in alternation. Q0 and Q1 fulfill the same operation as the original target algorithm. Power-analysis resistance is achieved by randomly alternating the execution of Q0 and Q1, with different runs resulting in different interleavings. Experiments reveal that this architecture is indeed effective against CPA.\",\"PeriodicalId\":194799,\"journal\":{\"name\":\"2016 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HST.2016.7495558\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Hardware Oriented Security and Trust (HOST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HST.2016.7495558","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Over the last twenty years, the research community has devised sophisticated methods for retrieving secret information from side-channel emanations, and for resisting such attacks. This paper introduces a new CPU architecture called the Conjoined Microprocessor (CμP). The CμP can randomly interleave the execution of two programs at very low extra hardware cost. We developed for the CμP a preprocessor tool that turns a target algorithm into two (or more) separate queues like Q0 and Q1 that can run in alternation. Q0 and Q1 fulfill the same operation as the original target algorithm. Power-analysis resistance is achieved by randomly alternating the execution of Q0 and Q1, with different runs resulting in different interleavings. Experiments reveal that this architecture is indeed effective against CPA.