Security of Public-Key Cryptosystems Based on Chebyshev Polynomials over the Residue Ring Z/pkZ

被引：0

作者：

Yoshioka, Daisaburo ^{[1
]}

机构：

[1] Sojo Univ, Dept Comp & Informat Sci, Nishi Ku, 4-22-1 Ikeda, Kumamoto 8600082, Japan

来源：

2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM) | 2018年

关键词：

ALGORITHM;

D O I：

暂无

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

Recently, a public-key cryptosystem using Chebyshev polynomials defined on a finite set has been proposed. The security of the cryptosystem depends on the difficulty of finding the degree of Chebyshev polynomials from given parameters. In this paper, we propose an algorithm to find the degree of Chebyshev polynomials modulo a prime power. The result shows that the cryptosystem based on Chebyshev polynomials modulo a prime power is insecure unless a huge prime is used.

引用

页数：4