In this paper, we propose two digital signature schemes based on a third order linear feedback shift register. One of them is a normal signature scheme for signing document and the other is with encryption for intended reciever. These two signature schemes are different from most of the signature schemes which are based on discrete logarithm problem, elliptic curves discrete logarithm problem, RSA or quadratic residues. The efficient computational algorithm for computing kth term of a sequence is also presented. The advantage of these two schemes is that the computation is carried out in the ground field and not in an extension field. We also show that the security of these two signature schemes is equivalent to that of Schnorr signature scheme and Signed-ElGamal encryption scheme respectively.
CITATION STYLE
Tan, C. H., Yi, X., & Siew, C. K. (2001). Signature schemes based on 3rd order shift registers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2119, pp. 445–459). Springer Verlag. https://doi.org/10.1007/3-540-47719-5_35
Mendeley helps you to discover research relevant for your work.