论文信息 - A Novel Public Key Cryptosystem Based on Ergodic Matrix over GF(2)

A Novel Public Key Cryptosystem Based on Ergodic Matrix over GF(2)

This paper constructs a new EL Gamal-type public key cryptosystem based on the irreducibility of characteristic polynomial of ergodic matrices over, whose security is equivalent to the difficulty of polynomial discrete logarithm problem over binary finite field. Since plaintext is represented by matrix and its message expansion is almost 1, the novel scheme can encrypt effectively more information one time.

[1] Taher ElGamal,et al. A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[2] Chen Yan-ling. ElGamal cryptosystem and digital signature scheme based on polynomials over finite fields , 2005 .

[3] Huang Sheng-lie. Implementation of Shamir's Three Pass Protocol Based on Ergodic Matrix over Finite Field , 2006 .

[4] Chris Monico,et al. Semirings and Semigroup Actions in Public-Key Cryptography , 2002 .

[5] Zuohua Ding,et al. A Public-Key Cryptosystem Based On , 2014 .

[6] Roy Dubisch,et al. Introduction to modern algebra , 1961 .

[7] Zhao Hong-Wei,et al. Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2) , 2007, TAMC.

[8] Amr M. Youssef,et al. Cryptanalysis of a Public Key Encryption Scheme Using Ergodic Matrices , 2011, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..