CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Public-key cryptosystems based on cubic finite field extensions
IEEE Transactions on Information Theory
Generating a Large Prime Factor of p4 ± p2 + 1 in Polynomial Time
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
On Generating Elements of Orders Dividing p2k±pk + 1
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Message transmission for GH-public key cryptosystem
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
In 1999, Gong and Harn proposed a new cryptosystem based on third-order characteristic sequences over finite fields. This paper gives an efficient method to generate instances of this cryptosystem over large finite fields. The method first finds a "good" prime p to work with and then constructs the sequence to ensure that it has the desired period. This method has been implemented in C++ using NTL [7] and so timing results are presented.