Division in the Plactic Monoid

IF 0.5 3区 数学 Q3 MATHEMATICS Journal of Algebra and Its Applications Pub Date : 2023-11-01 DOI:10.1142/s021949882550080x
Chris Monico
{"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":54888,"journal":{"name":"Journal of Algebra and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebra and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s021949882550080x","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
塑胶单关节部
在[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的度量,并利用它给出了一个求解该问题的概率算法,该算法对于参数值在感兴趣的范围内是快速的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
1.50
自引率
12.50%
发文量
226
审稿时长
4-8 weeks
期刊介绍: The Journal of Algebra and Its Applications will publish papers both on theoretical and on applied aspects of Algebra. There is special interest in papers that point out innovative links between areas of Algebra and fields of application. As the field of Algebra continues to experience tremendous growth and diversification, we intend to provide the mathematical community with a central source for information on both the theoretical and the applied aspects of the discipline. While the journal will be primarily devoted to the publication of original research, extraordinary expository articles that encourage communication between algebraists and experts on areas of application as well as those presenting the state of the art on a given algebraic sub-discipline will be considered.
期刊最新文献
A note on odd periodic derived Hall algebras Künneth formulas for Cotor Abelian groups whose endomorphism rings are V-rings Near automorphisms of the complement or the square of a cycle Semirings generated by idempotents
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1