一种基于椭圆曲线的高效认证签密方案

IF 0.3 Q4 MATHEMATICS
Manoj Kumar, Pratik Gupta
{"title":"一种基于椭圆曲线的高效认证签密方案","authors":"Manoj Kumar, Pratik Gupta","doi":"10.11113/MATEMATIKA.V35.N1.1042","DOIUrl":null,"url":null,"abstract":"Signcryption schemes are compact and specially suited for efficiency-critical applications such as smart card dependent systems. Several researchers have performed a large number of significant applications of signcryption such as authenticated key recovery and key establishment in one mall data packet, secure ATM networks as well as light weight electronic transaction protocols and multi-casting over the internet. In this paper we have proposed an efficient and efficient scheme of signcryption symmetric key solutions, using elliptic curves by reducing senders computational cost. It needs two elliptic curve point multiplication for sender and comparative study of computational cost for sender and recipient as well as there is no any inverse computation for sender and recipient. This makes it more crucial than others.","PeriodicalId":43733,"journal":{"name":"Matematika","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Efficient and Authentication Signcryption Scheme Based on Elliptic Curves\",\"authors\":\"Manoj Kumar, Pratik Gupta\",\"doi\":\"10.11113/MATEMATIKA.V35.N1.1042\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Signcryption schemes are compact and specially suited for efficiency-critical applications such as smart card dependent systems. Several researchers have performed a large number of significant applications of signcryption such as authenticated key recovery and key establishment in one mall data packet, secure ATM networks as well as light weight electronic transaction protocols and multi-casting over the internet. In this paper we have proposed an efficient and efficient scheme of signcryption symmetric key solutions, using elliptic curves by reducing senders computational cost. It needs two elliptic curve point multiplication for sender and comparative study of computational cost for sender and recipient as well as there is no any inverse computation for sender and recipient. This makes it more crucial than others.\",\"PeriodicalId\":43733,\"journal\":{\"name\":\"Matematika\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Matematika\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11113/MATEMATIKA.V35.N1.1042\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Matematika","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11113/MATEMATIKA.V35.N1.1042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 2

摘要

签名加密方案非常紧凑,特别适合于效率关键型应用程序,例如依赖智能卡的系统。一些研究人员已经完成了大量重要的签名加密应用,如在一个小数据包中验证密钥恢复和密钥建立,安全ATM网络以及轻量级电子交易协议和互联网上的多播。本文提出了一种高效的签名加密对称密钥解方案,利用椭圆曲线降低了发送方的计算成本。该算法需要对发送方进行两次椭圆曲线点乘法运算,并对发送方和接收方的计算成本进行比较研究,并且不需要对发送方和接收方进行反向计算。这使得它比其他的更重要。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient and Authentication Signcryption Scheme Based on Elliptic Curves
Signcryption schemes are compact and specially suited for efficiency-critical applications such as smart card dependent systems. Several researchers have performed a large number of significant applications of signcryption such as authenticated key recovery and key establishment in one mall data packet, secure ATM networks as well as light weight electronic transaction protocols and multi-casting over the internet. In this paper we have proposed an efficient and efficient scheme of signcryption symmetric key solutions, using elliptic curves by reducing senders computational cost. It needs two elliptic curve point multiplication for sender and comparative study of computational cost for sender and recipient as well as there is no any inverse computation for sender and recipient. This makes it more crucial than others.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Matematika
Matematika MATHEMATICS-
自引率
25.00%
发文量
0
审稿时长
24 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信