基于排序的公钥加密
Publickey encryption by ordering
AI总结：
本文尝试从与矩阵等价的非交换置换群构造公钥加密方案，并通过实现探索其潜力，以回应Sarah Flannery矩阵密码体制被破解的问题。
摘要：
1999年，一名16岁的高中女生Sarah Flannery设计了一种使用矩阵的公钥密码体制。该密码系统似乎比RSA更快，并且具有甚至超越RSA加密的强度。然而，这一加密方案在她的论文发表之前就被破解了。在本文中，我们尝试从置换群构造公钥加密方案，该置换群作为非交换群与矩阵等价。并且我们通过实现探索了这一密码系统的潜力。
英文摘要：
In 1999, public key cryptography using the matrix was devised by a hish school student of 16 yesrs old girl Sarah Flannery. This cryptosystem seemed faster than RSA, and it's having the strength to surpass even the encryption to RSA. However, this encryption scheme was broken bfore har papers were published. In this paper, We try to construct publickey encryption scheme from permutation group that is equivalent to matrix as noncommutative group. And we explore the potential of this cryptsystem through implementation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
