分野別セミナー

The Chebyshev Polynomial was first proposed by Kocarev and Tasev in 2003 to construct a public key encryption scheme. Following a revelation of a weakness in their original scheme, numerous proposals to improve on the design have been proposed and attacked throughout the past decade. In this talk we take a brief look at the progress of cryptosystems constructed from Chebyshev Polynomials and their downfalls. As case studies, we point to two recent constructions in literature and show attacks on these schemes.
Finally we venture in a different direction by using the Chebyshev Polynomial to construct a simpler cryptographic primitive that is easier to prove secure – a commitment scheme.
This talk is organized in collaboration with Institute of Systems, Information Technologies and Nanotechnologies (ISIT).