Algorithm Of The Electronic Digital Subscript On The Basis Of The Composition Of Computing Complexities

D. Akbarov, S. Umarov
{"title":"Algorithm Of The Electronic Digital Subscript On The Basis Of The Composition Of Computing Complexities","authors":"D. Akbarov, S. Umarov","doi":"10.37547/TAJET/VOLUME03ISSUE04-16","DOIUrl":null,"url":null,"abstract":"In article the new algorithm of a digital signature in composition of the existing difficulties is developed: discrete logarithming in a final field, decomposition of rather large natural number on simple multipliers, additions of points with rational coordinates of an elliptic curve. On the basis of a combination of difficulties of discrete logarithming on a final field with the characteristic of large number, decomposition of rather large odd number on simple multipliers and additions of points of an elliptic curve develops algorithm of a digital signature for formation. The conventional scheme (model) of a digital signature covers three processes: generation of keys of EDS; formation of EDS; check (authenticity confirmation) of EDS. The idea of a design of the offered algorithm allows modifying and increasing crypto stability with addition to other computing difficulties. It is intended for use in systems of information processing of different function during forming and confirmation of authenticity of digital signature.","PeriodicalId":280041,"journal":{"name":"The American Journal of Engineering And Techonology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The American Journal of Engineering And Techonology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37547/TAJET/VOLUME03ISSUE04-16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In article the new algorithm of a digital signature in composition of the existing difficulties is developed: discrete logarithming in a final field, decomposition of rather large natural number on simple multipliers, additions of points with rational coordinates of an elliptic curve. On the basis of a combination of difficulties of discrete logarithming on a final field with the characteristic of large number, decomposition of rather large odd number on simple multipliers and additions of points of an elliptic curve develops algorithm of a digital signature for formation. The conventional scheme (model) of a digital signature covers three processes: generation of keys of EDS; formation of EDS; check (authenticity confirmation) of EDS. The idea of a design of the offered algorithm allows modifying and increasing crypto stability with addition to other computing difficulties. It is intended for use in systems of information processing of different function during forming and confirmation of authenticity of digital signature.
基于计算复杂度组成的电子数字下标算法
本文针对目前存在的问题,提出了一种新的数字签名算法:最终域的离散对数、较大自然数在简单乘数上的分解、椭圆曲线有理坐标点的加法。结合具有大数特征的终域离散对数的困难、简单乘法器上较大奇数的分解和椭圆曲线点的相加,提出了一种构造数字签名的算法。传统的数字签名方案(模型)包括三个过程:生成EDS密钥;EDS的形成;检查(确认真伪)EDS。所提供算法的设计思想允许在增加其他计算困难的情况下修改和增加加密稳定性。适用于不同功能的信息处理系统在数字签名的形成和真实性确认过程中使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信