Cryptanalysis of Boolean permutation-based key escrow scheme

  • Authors:
  • Amr M. Youssef

  • Affiliations:
  • Concordia Institute for Information Systems Engineering, Concordia University, 1515 St. Catherine Street West, Ev7.638, Montreal, Quebec, Canada H3G 1M8

  • Venue:
  • Computers and Electrical Engineering
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Wu and Varadharajan [Computers and Electrical Engineering 25(4) 1999] proposed a fast public key escrow scheme. The security of this system is based on a special class of trapdoor Boolean permutations that can be constructed efficiently. In this paper, we show that this proposed class of Boolean permutations can be easily inverted without the knowledge of the secret key parameters. This allows the cryptanlyst to efficiently recover the session key using the known public key parameters.