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
相关论文
共 50 条
  • [1] Security of Public-Key Cryptosystems Based on Chebyshev Polynomials Over Z/pkZ
    Yoshioka, Daisaburo
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2020, 67 (10) : 2204 - 2208
  • [2] Security of public-key cryptosystems based on Chebyshev polynomials
    Bergamo, P
    D'Arco, P
    De Santis, A
    Kocarev, L
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2005, 52 (07) : 1382 - 1393
  • [3] More on security of public-key cryptosystems based on Chebyshev polynomials
    Cheong, Kai Y.
    Koshiba, Takeshi
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2007, 54 (09) : 795 - 799
  • [4] Security of Public-key Cryptosystems Based on Chebyshev Polynomials over Prime Finite Fields
    Lima, J. B.
    Campello de Souza, R. M.
    Panario, D.
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1843 - +
  • [5] On the Security of Public-Key Algorithms Based on Chebyshev Polynomials over the Finite Field ZN
    Liao, Xiaofeng
    Chen, Fei
    Wong, Kwok-Wo
    IEEE TRANSACTIONS ON COMPUTERS, 2010, 59 (10) : 1392 - 1401
  • [6] Public-Key Encryption Based on Chebyshev Polynomials
    L. Kocarev
    J. Makraduli
    P. Amato
    Circuits, Systems and Signal Processing, 2005, 24 : 497 - 517
  • [7] Public-key encryption based on Chebyshev polynomials
    Kocarev, L
    Makraduli, J
    Amato, P
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2005, 24 (05) : 497 - 517
  • [8] Public-key encryption based on Chebyshev polynomials over GF(q)
    Lima, J. B.
    Panario, D.
    Campello de Souza, R. M.
    INFORMATION PROCESSING LETTERS, 2010, 111 (02) : 51 - 56
  • [9] Security and reliability of LDPC based public-key cryptosystems
    Saad, D
    Skantzos, NS
    Kabashima, Y
    PROGRESS OF THEORETICAL PHYSICS SUPPLEMENT, 2005, (157): : 229 - 236
  • [10] Public Key Cryptosystems Based On Chaotic-Chebyshev Polynomials
    Prasadh, K.
    Ramar, K.
    Gnanajeyaraman, R.
    IAMA: 2009 INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT & MULTI-AGENT SYSTEMS, 2009, : 281 - +
12345