论文信息 - Cryptanalysis of Boolean permutation-based key escrow scheme

Cryptanalysis of Boolean permutation-based key escrow scheme

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.

Amr M. Youssef

[1] Louis Goubin,et al. Asymmetric cryptography with S-Boxes , 1997, ICICS.

[2] Louis Goubin,et al. Trapdoor one-way permutations and multivariate polynominals , 1997, ICICS.

[3] Jintai Ding,et al. Multivariate Public Key Cryptosystems (Advances in Information Security) , 2006 .

[4] Jacques Patarin,et al. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.

[5] Eli Biham,et al. Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R) , 2000, EUROCRYPT.

[6] Hideki Imai,et al. Algebraic Methods for Constructing Asymmetric Cryptosystems , 1985, AAECC.

[7] Jacques Patarin,et al. Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88 , 1995, CRYPTO.

[8] Vijay Varadharajan,et al. Public key cryptosystems based on boolean permutations and their applications , 2000, Int. J. Comput. Math..

[9] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[10] Vijay Varadharajan,et al. Boolean permutation-based key escrow , 1999 .

[11] Kwok-Yan Lam,et al. Cryptanalysis of "2 R" Schemes , 1999, CRYPTO.