{"title":"基于椭圆曲线和混沌映射分解问题的新签名方案","authors":"N. Tahat, S. Shatnawi","doi":"10.1080/19361610.2022.2041157","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, we present the new signature scheme based on elliptic curve (EC) and factoring (FAC) problems using chaotic maps (CMs). The newly developed scheme requires only minimal and low-complexity computations, which makes it very efficient. We compare our scheme with the other schemes with respect to signature generation cost, signature size, and verification cost and show that our scheme is superior to the other schemes. To the best of our knowledge, this is the first time a signature scheme based on EC and FAC problems using CMs has been proposed.","PeriodicalId":44585,"journal":{"name":"Journal of Applied Security Research","volume":"18 1","pages":"588 - 596"},"PeriodicalIF":1.1000,"publicationDate":"2022-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New Signature Scheme Based on Elliptic Curve and Factoring Problems Using Chaotic Map\",\"authors\":\"N. Tahat, S. Shatnawi\",\"doi\":\"10.1080/19361610.2022.2041157\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this paper, we present the new signature scheme based on elliptic curve (EC) and factoring (FAC) problems using chaotic maps (CMs). The newly developed scheme requires only minimal and low-complexity computations, which makes it very efficient. We compare our scheme with the other schemes with respect to signature generation cost, signature size, and verification cost and show that our scheme is superior to the other schemes. To the best of our knowledge, this is the first time a signature scheme based on EC and FAC problems using CMs has been proposed.\",\"PeriodicalId\":44585,\"journal\":{\"name\":\"Journal of Applied Security Research\",\"volume\":\"18 1\",\"pages\":\"588 - 596\"},\"PeriodicalIF\":1.1000,\"publicationDate\":\"2022-03-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied Security Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/19361610.2022.2041157\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"CRIMINOLOGY & PENOLOGY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Security Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/19361610.2022.2041157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"CRIMINOLOGY & PENOLOGY","Score":null,"Total":0}
New Signature Scheme Based on Elliptic Curve and Factoring Problems Using Chaotic Map
Abstract In this paper, we present the new signature scheme based on elliptic curve (EC) and factoring (FAC) problems using chaotic maps (CMs). The newly developed scheme requires only minimal and low-complexity computations, which makes it very efficient. We compare our scheme with the other schemes with respect to signature generation cost, signature size, and verification cost and show that our scheme is superior to the other schemes. To the best of our knowledge, this is the first time a signature scheme based on EC and FAC problems using CMs has been proposed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
