{"title":"PowerRanger:使用基于sat的静态分析来评估电路对电源攻击的脆弱性","authors":"Jeff Hao, V. Bertacco","doi":"10.1109/HLDVT.2009.5340174","DOIUrl":null,"url":null,"abstract":"Cryptographic cores, though algorithmically secure, can leak information about their operation during execution. By monitoring the power dissipation of a core, an attacker can extract secret keys used for encryption. To guard against this, designers must minimize the variation of power dissipation of their circuits over time. Unfortunately, power dissipation is a complex function of several different factors, and an exhaustive search for its maximum range is computationally infeasible. In this paper, we propose PowerRanger, a technique based on Boolean satisfiability to produce tight upper and lower bounds on both maximum and minimum power dissipation. In addition, we incorporate min-cut partitioning in our solution to improve its scalability for large designs. We evaluated the quality and performance of PowerRanger on a number of ISCAS benchmarks, as well as two cryptographic cores, showing that our technique significantly outperforms previously known solutions.","PeriodicalId":153879,"journal":{"name":"2009 IEEE International High Level Design Validation and Test Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"PowerRanger: Assessing circuit vulnerability to power attacks using SAT-based static analysis\",\"authors\":\"Jeff Hao, V. Bertacco\",\"doi\":\"10.1109/HLDVT.2009.5340174\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cryptographic cores, though algorithmically secure, can leak information about their operation during execution. By monitoring the power dissipation of a core, an attacker can extract secret keys used for encryption. To guard against this, designers must minimize the variation of power dissipation of their circuits over time. Unfortunately, power dissipation is a complex function of several different factors, and an exhaustive search for its maximum range is computationally infeasible. In this paper, we propose PowerRanger, a technique based on Boolean satisfiability to produce tight upper and lower bounds on both maximum and minimum power dissipation. In addition, we incorporate min-cut partitioning in our solution to improve its scalability for large designs. We evaluated the quality and performance of PowerRanger on a number of ISCAS benchmarks, as well as two cryptographic cores, showing that our technique significantly outperforms previously known solutions.\",\"PeriodicalId\":153879,\"journal\":{\"name\":\"2009 IEEE International High Level Design Validation and Test Workshop\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE International High Level Design Validation and Test Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HLDVT.2009.5340174\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International High Level Design Validation and Test Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HLDVT.2009.5340174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
PowerRanger: Assessing circuit vulnerability to power attacks using SAT-based static analysis
Cryptographic cores, though algorithmically secure, can leak information about their operation during execution. By monitoring the power dissipation of a core, an attacker can extract secret keys used for encryption. To guard against this, designers must minimize the variation of power dissipation of their circuits over time. Unfortunately, power dissipation is a complex function of several different factors, and an exhaustive search for its maximum range is computationally infeasible. In this paper, we propose PowerRanger, a technique based on Boolean satisfiability to produce tight upper and lower bounds on both maximum and minimum power dissipation. In addition, we incorporate min-cut partitioning in our solution to improve its scalability for large designs. We evaluated the quality and performance of PowerRanger on a number of ISCAS benchmarks, as well as two cryptographic cores, showing that our technique significantly outperforms previously known solutions.