谷歌浏览器插件
订阅小程序
在清言上使用

Hardness of learning problems over Burnside groups of exponent 3

Designs, Codes and Cryptography(2013)

引用 6|浏览15
暂无评分
摘要
In this work, we investigate the hardness of learning Burnside homomorphisms with noise ( B_n-𝖫𝖧𝖭 ), a computational problem introduced in the recent work of Baumslag et al. This is a generalization of the learning with errors problem, instantiated with a particular family of non-abelian groups, known as free Burnside groups of exponent 3 . In our main result, we demonstrate a random self-reducibility property for B_n-𝖫𝖧𝖭 . Along the way, we also prove a sequence of lemmas regarding homomorphisms of free Burnside groups of exponent 3 that may be of independent interest.
更多
查看译文
关键词
Learning with errors,Post-quantum cryptography,Non-commutative cryptography,Burnside groups,Random self-reducibility,94A60,69P25,68Q17,68Q32
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要