Ziang Chen;Li-Wei Chen;Xianyue Zhao;Kefeng Li;Heidemarie Krüger;Ilia Polian;Nan Du
{"title":"Power-Balanced Memristive Cryptographic Implementation Against Side Channel Attacks","authors":"Ziang Chen;Li-Wei Chen;Xianyue Zhao;Kefeng Li;Heidemarie Krüger;Ilia Polian;Nan Du","doi":"10.1109/TNANO.2025.3623307","DOIUrl":null,"url":null,"abstract":"Memristors, as emerging nano-devices, offer promising performance and exhibit rich electrical dynamic behavior. Having already found success in applications such as neuromorphic and in-memory computing, researchers are now exploring their potential for cryptographic implementations. In this study, we present a novel power-balanced hiding strategy utilizing memristor groups to conceal power consumption in cryptographic logic circuits. Our approach ensures consistent power costs of all 16 logic gates in Complementary-Resistive-Switching-with-Reading (CRS-R) logic family during writing and reading cycles regardless of Logic Input Variable (LIV) values. By constructing hiding groups, we enable an effective power balance in each gate hiding group. Furthermore, experimental validation of our strategy includes the implementation of a cryptographic construction, xor4SBox, using hiding groups containing NOR gates. The circuit construction without the hiding strategy and with the hiding strategy undergo Test Vector Leakage Assessment (TVLA) based on T-test, confirming the significant improvement achieved with our approach. To address the extensive data requirements necessitated by the T-test, simulated power traces are employed. Our work presents a substantial advancement in power-balanced hiding methods, offering enhanced security and efficiency in logic circuits.","PeriodicalId":449,"journal":{"name":"IEEE Transactions on Nanotechnology","volume":"24 ","pages":"518-528"},"PeriodicalIF":2.5000,"publicationDate":"2025-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Nanotechnology","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/11207550/","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract
Memristors, as emerging nano-devices, offer promising performance and exhibit rich electrical dynamic behavior. Having already found success in applications such as neuromorphic and in-memory computing, researchers are now exploring their potential for cryptographic implementations. In this study, we present a novel power-balanced hiding strategy utilizing memristor groups to conceal power consumption in cryptographic logic circuits. Our approach ensures consistent power costs of all 16 logic gates in Complementary-Resistive-Switching-with-Reading (CRS-R) logic family during writing and reading cycles regardless of Logic Input Variable (LIV) values. By constructing hiding groups, we enable an effective power balance in each gate hiding group. Furthermore, experimental validation of our strategy includes the implementation of a cryptographic construction, xor4SBox, using hiding groups containing NOR gates. The circuit construction without the hiding strategy and with the hiding strategy undergo Test Vector Leakage Assessment (TVLA) based on T-test, confirming the significant improvement achieved with our approach. To address the extensive data requirements necessitated by the T-test, simulated power traces are employed. Our work presents a substantial advancement in power-balanced hiding methods, offering enhanced security and efficiency in logic circuits.
期刊介绍:
The IEEE Transactions on Nanotechnology is devoted to the publication of manuscripts of archival value in the general area of nanotechnology, which is rapidly emerging as one of the fastest growing and most promising new technological developments for the next generation and beyond.