Public key encryption and digital signatures based on permutation polynomials
Public key encryption and digital signatures based on permutation polynomials
复制标题
DOI：
10.1049/el:19980569
复制
发表时间：
1998-04
影响因子：
1.1
通讯作者：
Jorg Schwenk;K. Huber
中科院分区：
文献类型：
--
作者：
Jorg Schwenk;K. Huber
Zn上的置换多项式形成RSA和Dickson公钥方案的基础。然而，以前，只有那些置换多项式的逆置换多项式是容易评估已在密码学中使用。作者提出了一种方法，通过计算两个多项式的gcd来实现密钥解密和签名生成，从而避免了公钥密码中的这种限制。这允许实现新的公钥方案类别。
Permutation polynomials over Zn form the basis of the RSA and Dickson public key schemes. Previously, however, only those permutation polynomials whose inverse permutation polynomial was easy to evaluate have been used in cryptography. The authors propose a way to avoid this restriction in public key cryptography by implementing secret key decryption and signature generation by computation of the gcd of two polynomials. This allows the implementation of new classes of public key scheme.