首页 | 本学科首页   官方微博 | 高级检索  
     


Cryptanalysis of Boolean permutation-based key escrow scheme
Authors:Amr M. Youssef
Affiliation:Concordia Institute for Information Systems Engineering, Concordia University, 1515 St. Catherine Street West, Ev7.638, Montreal, Quebec, Canada H3G 1M8
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.
Keywords:Boolean functions   Public key encryption systems   Trapdoor permutations
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号