基于丢番图问题的伽玛叠加密码系统数学建模

V. Osipyan
{"title":"基于丢番图问题的伽玛叠加密码系统数学建模","authors":"V. Osipyan","doi":"10.1145/2799979.2800026","DOIUrl":null,"url":null,"abstract":"The mathematical model of cryptosystem based on the method of gamma superposition, in which the algorithm of the inverse transformation of the closed text is reduced to the impossibility of problem solution is developed. The multiplicative knapsack task is generalized and the problem of working out of alphabetic cryptosystems mathematical models is considered. The mathematical models of such cryptosystems are offered in the article. The investigation is based on the C. Shannon, who considered, that cryptosystems containing Diophantine difficulties, possesses the greatest uncertainty of key selection process. Necessary and suffitient conditions at which generalized multiplicative knapsack is injective on Zp, p . 2, are established. The problem of building the isomorphic additive and multiplicative knapsacks is also considered.","PeriodicalId":293190,"journal":{"name":"Proceedings of the 8th International Conference on Security of Information and Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Mathematical modelling of cryptosystems based on Diophantine problem with gamma superposition method\",\"authors\":\"V. Osipyan\",\"doi\":\"10.1145/2799979.2800026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The mathematical model of cryptosystem based on the method of gamma superposition, in which the algorithm of the inverse transformation of the closed text is reduced to the impossibility of problem solution is developed. The multiplicative knapsack task is generalized and the problem of working out of alphabetic cryptosystems mathematical models is considered. The mathematical models of such cryptosystems are offered in the article. The investigation is based on the C. Shannon, who considered, that cryptosystems containing Diophantine difficulties, possesses the greatest uncertainty of key selection process. Necessary and suffitient conditions at which generalized multiplicative knapsack is injective on Zp, p . 2, are established. The problem of building the isomorphic additive and multiplicative knapsacks is also considered.\",\"PeriodicalId\":293190,\"journal\":{\"name\":\"Proceedings of the 8th International Conference on Security of Information and Networks\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 8th International Conference on Security of Information and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2799979.2800026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th International Conference on Security of Information and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2799979.2800026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

建立了基于伽玛叠加法的密码系统数学模型,将封闭文本的逆变换算法简化为问题不可能解。对乘式背包任务进行了推广,研究了字母密码系统数学模型的求解问题。本文给出了这类密码系统的数学模型。该研究基于C. Shannon,他认为包含丢番图困难的密码系统具有最大的密钥选择过程不确定性。广义乘法背包在Zp, p上内射的充要条件。2、建立。讨论了构造同构加性和乘性背包的问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mathematical modelling of cryptosystems based on Diophantine problem with gamma superposition method
The mathematical model of cryptosystem based on the method of gamma superposition, in which the algorithm of the inverse transformation of the closed text is reduced to the impossibility of problem solution is developed. The multiplicative knapsack task is generalized and the problem of working out of alphabetic cryptosystems mathematical models is considered. The mathematical models of such cryptosystems are offered in the article. The investigation is based on the C. Shannon, who considered, that cryptosystems containing Diophantine difficulties, possesses the greatest uncertainty of key selection process. Necessary and suffitient conditions at which generalized multiplicative knapsack is injective on Zp, p . 2, are established. The problem of building the isomorphic additive and multiplicative knapsacks is also considered.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信