Honey Encryption Applied to Schnorr Signature Scheme

Mariia Oliynyk
{"title":"Honey Encryption Applied to Schnorr Signature Scheme","authors":"Mariia Oliynyk","doi":"10.18523/2617-7080420213-6","DOIUrl":null,"url":null,"abstract":"The security of any cryptosystem mostly depends on the reliability of the protection of secret keys used in it. In particular, key generation procedure must give a variety of keys so that they cannot be picked up by a brute-force attack. Honey encryption is used as an additional barrier of cryptosystems' keys protection to slow down a brute-force attack. As in the case of \" white box cryptography'', different honey encryption schemes are considered depending on what the additional protection is aimed at. The need to additionally protect secret keys arises in remote access systems, when it is necessary to provide access to information to authorized users.The idea of encryption, which would provide adequate additional protection, is to build a system so that the attacker will not be able to recover the original text, even after searching through all possible options for passwords or keys. Based on the concept of lure systems, this system outputs messages that are difficult to distinguish from the true ones. Such messages are called honey, which, like the sweet substance, but in computer security terminology, \" drag '' the opponent into a dead end.This article constructs schemes for additional key protection of the Schnorr Signature Scheme, describes the pseudocodes of the corresponding algorithms, analyzes the complexity of a brute-force attack.This scheme requires additional protection against the a secret key because storing it in the open is unreliable. With the proposed encryption algorythm, we can \"hide'' a into a sequence of integers, and extract it back with the proposed decryption algorythm. If the sequence is entered by an attacker and does not contain a masked number a , decryption algorythm will return the result of multiplying the last number by the inverse q to the first prime number, if any, in the set, or the penultimate number in the set. Therefore, when trying to artificially pick up a secret key by a brute-force attack, the attacker will get a number similar to a but which he will not be able to use when trying to forge Alice's signature.","PeriodicalId":404986,"journal":{"name":"Mohyla Mathematical Journal","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mohyla Mathematical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18523/2617-7080420213-6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The security of any cryptosystem mostly depends on the reliability of the protection of secret keys used in it. In particular, key generation procedure must give a variety of keys so that they cannot be picked up by a brute-force attack. Honey encryption is used as an additional barrier of cryptosystems' keys protection to slow down a brute-force attack. As in the case of " white box cryptography'', different honey encryption schemes are considered depending on what the additional protection is aimed at. The need to additionally protect secret keys arises in remote access systems, when it is necessary to provide access to information to authorized users.The idea of encryption, which would provide adequate additional protection, is to build a system so that the attacker will not be able to recover the original text, even after searching through all possible options for passwords or keys. Based on the concept of lure systems, this system outputs messages that are difficult to distinguish from the true ones. Such messages are called honey, which, like the sweet substance, but in computer security terminology, " drag '' the opponent into a dead end.This article constructs schemes for additional key protection of the Schnorr Signature Scheme, describes the pseudocodes of the corresponding algorithms, analyzes the complexity of a brute-force attack.This scheme requires additional protection against the a secret key because storing it in the open is unreliable. With the proposed encryption algorythm, we can "hide'' a into a sequence of integers, and extract it back with the proposed decryption algorythm. If the sequence is entered by an attacker and does not contain a masked number a , decryption algorythm will return the result of multiplying the last number by the inverse q to the first prime number, if any, in the set, or the penultimate number in the set. Therefore, when trying to artificially pick up a secret key by a brute-force attack, the attacker will get a number similar to a but which he will not be able to use when trying to forge Alice's signature.
蜂蜜加密在Schnorr签名方案中的应用
任何密码系统的安全性在很大程度上取决于它所使用的密钥保护的可靠性。特别是,密钥生成过程必须提供各种密钥,以便它们不能被暴力攻击获取。蜂蜜加密被用作密码系统密钥保护的额外屏障,以减缓暴力攻击。与“白盒加密”的情况一样,根据附加保护的目的,可以考虑不同的蜂蜜加密方案。在远程访问系统中,当需要向授权用户提供对信息的访问权限时,需要额外保护密钥。加密将提供足够的额外保护,其思想是建立一个系统,使攻击者无法恢复原始文本,即使在搜索了所有可能的密码或密钥选项之后。基于诱饵系统的概念,该系统输出的信息很难与真实信息区分开来。这样的信息被称为“蜂蜜”,就像甜蜜的物质一样,但在计算机安全术语中,“把”对手“拖进了死胡同”。本文构建了Schnorr签名方案的附加密钥保护方案,描述了相应算法的伪码,分析了暴力攻击的复杂性。这个方案需要额外的保护来防止密钥泄露,因为公开存储密钥是不可靠的。使用提出的加密算法,我们可以将a“隐藏”到整数序列中,并使用提出的解密算法将其提取出来。如果序列是由攻击者输入的,并且不包含掩码数a,则解密算法将返回最后一个数字乘以q的倒数q乘以集合中的第一个素数(如果有的话)或集合中的倒数第二个素数的结果。因此,当试图通过暴力攻击人为地获取秘钥时,攻击者将获得一个类似于a的数字,但他无法在试图伪造Alice的签名时使用该数字。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信