Public-key cryptosystems based on general finite field extentions
Yu Zhang · Jounal of Xidian University · 2000
Guang Gong and Lein Harn proposed a new public key cryptosystem in which the cryptographic property of 3rd order LFSR sequences over GF(p) was investigated. In this paper we extend it to general finite field extentions and introduce an efficient formula to calculate the k th term of sequences. We explore to construct public key cryptosystems by using nrd order LFSR sequences over GF(p). The security is based on the difficulty of solving the discrete logarithm in GF(p n), which is much harder than solving the discrete logarithm in the GF(p) for the same p. It is successful in reducing the size of the modulus.