Three theorems on odd degree Chebyshev polynomials and more generalized permutation polynomials over a ring of module 2w

DOI10.1007/S13160-017-0275-7MaRDI QIDQ1742871zbMATH OpenOpenAlexFDO

Authors Atsushi Iwasaki, Ken Umeno

Publication date 12 April 2018

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1602.08238

zbMATH Keywords

Chebyshev polynomialcryptographypermutation polynomialkey-exchangering of modulo \(2^w\)

Mathematics Subject Classification ID

Cryptography (94A60) Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.) (33D45) Orthogonal functions and polynomials, general theory of nontrigonometric harmonic analysis (42C05)

Abstract: Odd degree Chebyshev polynomials over a ring of modulo $2^w$ have two kinds of period. One is an "orbital period". Odd degree Chebyshev polynomials are bijection over the ring. Therefore, when an odd degree Chebyshev polynomial iterate affecting a factor of the ring, we can observe an orbit over the ring. The "orbital period" is a period of the orbit. The other is a "degree period". It is observed when changing the degree of Chebyshev polynomials with a fixed argument of polynomials. Both kinds of period have not been completely studied. In this paper, we clarify completely both of them. The knowledge about them enables us to efficiently solve degree decision problem of Chebyshev polynomial over the ring, and so a key-exchange protocol with Chebyshev polynomial over the ring is not secure. In addition, we generalize the discussion and show that a key-exchange protocol with more generalized permutation polynomials which belong to a certain class is not secure.

Recommendations

• Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
• A Note on the Insecurity of Cryptosystems Based on Chebyshev Polynomials
• Cryptanalysis of multiplicative coupled cryptosystems based on the Chebyshev polynomials
• Public-key encryption based on Chebyshev polynomials over \(\mathrm{GF}(q)\)
• A trigonometric approach for Chebyshev polynomials over finite fields

Cites work

• Permutation polynomials modulo \(2^w\)
• Security of public-key cryptosystems based on Chebyshev polynomials

Cited in

(2)

• One-stroke polynomials over a ring of modulo \(2^w\)
• Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)

This page was built for publication: Three theorems on odd degree Chebyshev polynomials and more generalized permutation polynomials over a ring of module \(2^w\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1742871)