Presentation	2017-09-08 A solution of degree determination problem of Chebyshev polynomials over Z/p^kZ Daisaburo Yoshioka,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Recently, a public key cryptosystem employing Chebyshev polynomials over a residue ring of integers has been proposed. The security of the cryptosystem only depends on the difficulty of soloving degree determination problem of Chebyshev polynomials. In this paper, we propose a solution of such a degree determination problem of Chebyshev polynomialsover $Z/p^kZ$. As a result, the cryptosystem employing Chebyshev polynomials over $Z/p^kZ$ is not secure if a prime p is not sufficiently large.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	Chebyshev polynomial / public key cryptography / degree determination problem
Paper #	IT2017-38
Date of Issue	2017-09-01 (IT)

Conference Information
Committee	IT
Conference Date	2017/9/8(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)	Centcore Yamaguchi Hotel
Topics (in Japanese)	(See Japanese page)
Topics (in English)	error correcting codes, general
Chair	Masayoshi Ohashi(Fukuoka Univ.)
Vice Chair	Jun Muramatsu(NTT)
Secretary	Jun Muramatsu(Yokohama College of Commerce)
Assistant	Sigeaki Kuzuoka(wakayama univ.)

Paper Information
Registration To	Technical Committee on Information Theory
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	A solution of degree determination problem of Chebyshev polynomials over Z/p^kZ
Sub Title (in English)
Keyword(1)	Chebyshev polynomial
Keyword(2)	public key cryptography
Keyword(3)	degree determination problem
1st Author's Name	Daisaburo Yoshioka
1st Author's Affiliation	Sojo University(Sojo Univ.)
Date	2017-09-08
Paper #	IT2017-38
Volume (vol)	vol.117
Number (no)	IT-208
Page	pp.pp.1-4(IT),
#Pages	4
Date of Issue	2017-09-01 (IT)