arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.1685math.GR
收藏

群和分支过程中的搜索问题

Search problems in groups and branching processes

Pavel Morar, Alexander Ushakov

摘要:

本文研究了群中随机生成的Dehn搜索问题的复杂性。我们使用Crump-Mode-Jagers过程来证明大多数随机实例是容易的。我们的分析表明,对于Wagner-Wagner公开密钥加密协议中的任何一个随机平台组的选择,大多数随机密钥都可以被多项式时间算法破解。

英文摘要:

In this paper we study complexity of randomly generated instances of Dehn search problems in finitely presented groups. We use Crump-Mode-Jagers processes to show that most of the random instances are easy. Our analysis shows that for any choice of a finitely presented platform group in Wagner-Wagner public key encryption protocol the majority of random keys can be broken by a polynomial time algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑