Public key encryption and digital signatures based on permutation polynomials

被引：72

作者：

Schwenk, J ^{[1
]}

Huber, K ^{[1
]}

机构：

[1] Deutsch Telekom AG, Technol Zentrum, D-64295 Darmstadt, Germany

来源：

ELECTRONICS LETTERS | 1998年 / 34卷 / 08期

关键词：

D O I：

10.1049/el:19980569

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Permutation polynomials over Z(n) 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.

引用

页码：759 / 760

页数：2