加载中…
In this paper,we propose a modified Anshel-Anshel-Goldfeld(AAG) key exchange scheme. The hardness assumption underlying this modified construction is based on the membership problem for Mihailova subgroups of the braid group, a problem that is algorithmically unsolvable. According to the security analysis, we show that the proposed scheme is resistant to all known attacks, including quantum computational attacks.

生成讲解博客的中文版本

生成AI智能校验的中文版本