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.