{"title":"基于ECC的受限设备的高效一遍实体认证","authors":"Johann Heyszl, F. Stumpf","doi":"10.1109/HST.2010.5513107","DOIUrl":null,"url":null,"abstract":"In this contribution, we present a highly efficient single-message protocol for repeated entity authentication based on Elliptic Curve Cryptography (ECC). Repeated unilateral authentication is used in scenarios where a prover repeatedly authenticates himself to the same verifier. Our protocol requires the transfer of only one single message for this purpose and reduces the required computations on the prover's side to a minimum which supports efficient implementations. In order to support this, a three pass setup protocol has to performed once. We have proven the efficiency of our approach through a prototype implementation of a remote keyless entry system including a microcontroller and an FPGA-based, GF(2163) Elliptic Curve (EC) co-processor which features state-of-the-art measures against simple and differential power analysis and fault attacks. General modular arithmetic is performed on the microcontroller and the EC scalar point multiplication is executed in 93.5k clock cycles on the FPGA based EC co-processor which has a hardware complexity of 12.7k gate equivalents. Our implementation results confirm the efficiency of our protocol for application scenarios where repeated authentication is performed through low-energy, uni-directional devices like in remote access control.","PeriodicalId":6367,"journal":{"name":"2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST)","volume":"172 1","pages":"88-93"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Efficient one-pass entity authentication based on ECC for constrained devices\",\"authors\":\"Johann Heyszl, F. Stumpf\",\"doi\":\"10.1109/HST.2010.5513107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this contribution, we present a highly efficient single-message protocol for repeated entity authentication based on Elliptic Curve Cryptography (ECC). Repeated unilateral authentication is used in scenarios where a prover repeatedly authenticates himself to the same verifier. Our protocol requires the transfer of only one single message for this purpose and reduces the required computations on the prover's side to a minimum which supports efficient implementations. In order to support this, a three pass setup protocol has to performed once. We have proven the efficiency of our approach through a prototype implementation of a remote keyless entry system including a microcontroller and an FPGA-based, GF(2163) Elliptic Curve (EC) co-processor which features state-of-the-art measures against simple and differential power analysis and fault attacks. General modular arithmetic is performed on the microcontroller and the EC scalar point multiplication is executed in 93.5k clock cycles on the FPGA based EC co-processor which has a hardware complexity of 12.7k gate equivalents. Our implementation results confirm the efficiency of our protocol for application scenarios where repeated authentication is performed through low-energy, uni-directional devices like in remote access control.\",\"PeriodicalId\":6367,\"journal\":{\"name\":\"2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST)\",\"volume\":\"172 1\",\"pages\":\"88-93\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HST.2010.5513107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Hardware-Oriented Security and Trust (HOST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HST.2010.5513107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient one-pass entity authentication based on ECC for constrained devices
In this contribution, we present a highly efficient single-message protocol for repeated entity authentication based on Elliptic Curve Cryptography (ECC). Repeated unilateral authentication is used in scenarios where a prover repeatedly authenticates himself to the same verifier. Our protocol requires the transfer of only one single message for this purpose and reduces the required computations on the prover's side to a minimum which supports efficient implementations. In order to support this, a three pass setup protocol has to performed once. We have proven the efficiency of our approach through a prototype implementation of a remote keyless entry system including a microcontroller and an FPGA-based, GF(2163) Elliptic Curve (EC) co-processor which features state-of-the-art measures against simple and differential power analysis and fault attacks. General modular arithmetic is performed on the microcontroller and the EC scalar point multiplication is executed in 93.5k clock cycles on the FPGA based EC co-processor which has a hardware complexity of 12.7k gate equivalents. Our implementation results confirm the efficiency of our protocol for application scenarios where repeated authentication is performed through low-energy, uni-directional devices like in remote access control.