塑胶单关节部

Pub Date : 2023-11-01 DOI:10.1142/s021949882550080x
Chris Monico
{"title":"塑胶单关节部","authors":"Chris Monico","doi":"10.1142/s021949882550080x","DOIUrl":null,"url":null,"abstract":"In [D. R. L. Brown, Plactic key agreement (insecure?), J. Math. Cryptol. 17(1) (2023) 20220010], a novel cryptographic key exchange technique was proposed using the plactic monoid, based on the apparent difficulty of solving division problems in that monoid. Specifically, given elements [Formula: see text] in the plactic monoid, the problem is to find [Formula: see text] for which [Formula: see text], given that such a [Formula: see text] exists. In this paper, we introduce a metric on the plactic monoid and use it to give a probabilistic algorithm for solving that problem which is fast for parameter values in the range of interest.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Division in the Plactic Monoid\",\"authors\":\"Chris Monico\",\"doi\":\"10.1142/s021949882550080x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In [D. R. L. Brown, Plactic key agreement (insecure?), J. Math. Cryptol. 17(1) (2023) 20220010], a novel cryptographic key exchange technique was proposed using the plactic monoid, based on the apparent difficulty of solving division problems in that monoid. Specifically, given elements [Formula: see text] in the plactic monoid, the problem is to find [Formula: see text] for which [Formula: see text], given that such a [Formula: see text] exists. In this paper, we introduce a metric on the plactic monoid and use it to give a probabilistic algorithm for solving that problem which is fast for parameter values in the range of interest.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2023-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s021949882550080x\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s021949882550080x","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在[D。R. L. Brown, Plactic key agreement (insecure?), J. Math。Cryptol. 17(1)(2023) 20220010],基于求解plactic单群中除法问题的明显困难,提出了一种新的加密密钥交换技术。具体地说,给定plactic monooid中的元素[Formula: see text],问题是找到[Formula: see text]的[Formula: see text],假设存在这样一个[Formula: see text]。在本文中,我们引入了一个关于plactic monooid的度量,并利用它给出了一个求解该问题的概率算法,该算法对于参数值在感兴趣的范围内是快速的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
分享
查看原文
Division in the Plactic Monoid
In [D. R. L. Brown, Plactic key agreement (insecure?), J. Math. Cryptol. 17(1) (2023) 20220010], a novel cryptographic key exchange technique was proposed using the plactic monoid, based on the apparent difficulty of solving division problems in that monoid. Specifically, given elements [Formula: see text] in the plactic monoid, the problem is to find [Formula: see text] for which [Formula: see text], given that such a [Formula: see text] exists. In this paper, we introduce a metric on the plactic monoid and use it to give a probabilistic algorithm for solving that problem which is fast for parameter values in the range of interest.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
×
引用
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学术官方微信