Cryptanalysis of a public key cryptosystem based on boolean permutations
暂无分享,去创建一个
[1] Hideki Imai,et al. Algebraic Methods for Constructing Asymmetric Cryptosystems , 1985, AAECC.
[2] Jacques Patarin,et al. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.
[3] Burt Kaliski,et al. Feature: Considerations for New Public-Key Algorithms , 2000 .
[4] Jacques Patarin,et al. Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88 , 1995, CRYPTO.
[5] Kaisa Nyberg,et al. On the Construction of Highly Nonlinear Permutations , 1992, EUROCRYPT.
[6] Eli Biham,et al. Cryptanalysis of Patarin's 2-Round Public Key System with S Boxes (2R) , 2000, EUROCRYPT.
[7] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.
[8] Amr M. Youssef. Cryptanalysis of Boolean permutation-based key escrow scheme , 2010, Comput. Electr. Eng..
[9] Louis Goubin,et al. Trapdoor one-way permutations and multivariate polynominals , 1997, ICICS.
[10] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[11] Jean-Charles Faugère,et al. Cryptanalysis of 2R- Schemes , 2006, CRYPTO.
[12] Vijay Varadharajan,et al. Public key cryptosystems based on boolean permutations and their applications , 2000, Int. J. Comput. Math..