{"title":"Research on ECDSA timing attack based on hidden Markov model","authors":"Huihui Jia, Yuanyuan Yang, Haohao Song","doi":"10.1117/12.2639130","DOIUrl":null,"url":null,"abstract":"Timing attack is a side channel attack method. Elliptic curve cryptography (ECC) is one of the most important publickey cryptography. In this paper, a new timing attack on the Elliptic Curve Digital Signature Algorithm (ECDSA) based on Hidden Markov Model (HMM) was presented. Precisely speaking, the Grover algorithm was used to retrieve the parts of the ephemeral key, and the Koblitz Curve K-409 which was recommended by NIST was attacked successfully. The experiment results showed that the attack could recover almost all the key bits in a few minutes by collecting only once timing dates, and was easy to experiment at a high success rate.","PeriodicalId":336892,"journal":{"name":"Neural Networks, Information and Communication Engineering","volume":"309 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks, Information and Communication Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2639130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Timing attack is a side channel attack method. Elliptic curve cryptography (ECC) is one of the most important publickey cryptography. In this paper, a new timing attack on the Elliptic Curve Digital Signature Algorithm (ECDSA) based on Hidden Markov Model (HMM) was presented. Precisely speaking, the Grover algorithm was used to retrieve the parts of the ephemeral key, and the Koblitz Curve K-409 which was recommended by NIST was attacked successfully. The experiment results showed that the attack could recover almost all the key bits in a few minutes by collecting only once timing dates, and was easy to experiment at a high success rate.