Cryptanalysis of Boolean permutation-based key escrow scheme
β Scribed by Amr M. Youssef
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 161 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0045-7906
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
Recently, Fan proposed an enhanced scheme to improve the security of Yang-Shieh's timestamp-based password authentication scheme. The enhanced scheme can withstand the attacks presented by Chan, Cheng and Fan. In this paper, we show that the enhanced scheme is still insecure. An intruder is able to
In this paper, we show that the identity-based society oriented signature scheme with anonymous signers proposed by Saeednia is insecure. If some members of a given group leave that group or if some new members join the group, their secret keys would be revealed. We also propose a simple way to fulf