Finite field for scientists and engineers
Finite field for scientists and engineers
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Shift Register Sequences
Public-key cryptosystems based on cubic finite field extensions
IEEE Transactions on Information Theory
Fast irreducibility testing for XTR using a gaussian normal basis of low complexity
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Group key agreement protocol based on GH-KEP
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
Verifiable multi-secret sharing based on LFSR sequences
Theoretical Computer Science
Public-Key Cryptography Based on a Cubic Extension of the Lucas Functions
Fundamenta Informaticae - Cryptology in Progress: 10th Central European Conference on Cryptology, Będlewo Poland, 2010
Message transmission for GH-public key cryptosystem
Journal of Computational and Applied Mathematics
An overview of trace based public key cryptography over finite fields
Journal of Computational and Applied Mathematics
| Hi-index | 0.03 |
This paper will propose an efficient algorithm that utilizes the signed-digit representation to compute the kth term of a characteristic sequence generated by a linear feedback shift register of order 3 over GF(q). We will also propose an efficient algorithm to compute the (h-dk)th term of the characteristic sequence based on the knowledge of the kth term where k is unknown. Incorporating these results, we construct the ElGamal-like digital signature algorithm for the public-key cryptography based on the 3rd-order characteristic sequences which was proposed by Gong and Harn in 1999.