Pitfalls in identity based encryption using extended chebyshev polynomial

Haifeng Qian, Xiangxue Li*, Yu Yu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Chebyshev polynomials are used as a reservoir for generating intricate classes of symmetrical and chaotic patterns, and have been used in a vast amount of applications. Using extended Chebyshev polynomial over finite field Z p, Algehawi and Samsudin presented recently an Identity Based Encryption (IBE) scheme. In this paper, we showed their proposal is not as secure as they claimed. More specifically, we presented a concrete attack on the scheme of Algehawi and Samsudin, which indicated the scheme cannot be consolidated as a real alternative of IBE schemes since one can exploit the semi group property (bilinearity) of extended Chebyshev polynomials over Z p to implement the attack without any difficulty.

Original languageEnglish
Pages (from-to)58-63
Number of pages6
JournalChina Communications
Volume9
Issue number1
StatePublished - Jan 2012

Keywords

  • Bilinearity
  • Chaotic cryptography
  • Extended Chebyshev polynomial
  • IBE

Fingerprint

Dive into the research topics of 'Pitfalls in identity based encryption using extended chebyshev polynomial'. Together they form a unique fingerprint.

Cite this