The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Neste artigo, propomos um novo esquema de assinatura digital baseado em um registrador de deslocamento de realimentação linear de terceira ordem para assinatura de documentos. Este esquema de assinatura é diferente da maioria dos esquemas de assinatura baseados em problema de logaritmo discreto, problema de logaritmo discreto de curvas elípticas, RSA ou resíduos quadráticos. Um algoritmo eficiente para computação kO termo de uma sequência também é apresentado. A vantagem deste esquema é que o cálculo é mais eficiente que o esquema de Schnorr. Mostramos também que a segurança do esquema de assinatura proposto é equivalente à do esquema de assinatura de Schnorr.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Chik-How TAN, Xun YI, Chee-Kheong SIEW, "New Signature Schemes Based on 3rd Order Shift Registers" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 1, pp. 102-109, January 2002, doi: .
Abstract: In this paper, we propose a new digital signature scheme based on a third order linear feedback shift register for signing documents. This signature scheme is different from most of the signature schemes that are based on discrete logarithm problem, elliptic curves discrete logarithm problem, RSA or quadratic residues. An efficient algorithm for computing kth term of a sequence is also presented. The advantage of this scheme is that the computation is efficient than Schnorr scheme. We also show that the security of the proposed signature scheme is equivalent to that of Schnorr signature scheme.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_1_102/_p
Copiar
@ARTICLE{e85-a_1_102,
author={Chik-How TAN, Xun YI, Chee-Kheong SIEW, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={New Signature Schemes Based on 3rd Order Shift Registers},
year={2002},
volume={E85-A},
number={1},
pages={102-109},
abstract={In this paper, we propose a new digital signature scheme based on a third order linear feedback shift register for signing documents. This signature scheme is different from most of the signature schemes that are based on discrete logarithm problem, elliptic curves discrete logarithm problem, RSA or quadratic residues. An efficient algorithm for computing kth term of a sequence is also presented. The advantage of this scheme is that the computation is efficient than Schnorr scheme. We also show that the security of the proposed signature scheme is equivalent to that of Schnorr signature scheme.},
keywords={},
doi={},
ISSN={},
month={January},}
Copiar
TY - JOUR
TI - New Signature Schemes Based on 3rd Order Shift Registers
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 102
EP - 109
AU - Chik-How TAN
AU - Xun YI
AU - Chee-Kheong SIEW
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2002
AB - In this paper, we propose a new digital signature scheme based on a third order linear feedback shift register for signing documents. This signature scheme is different from most of the signature schemes that are based on discrete logarithm problem, elliptic curves discrete logarithm problem, RSA or quadratic residues. An efficient algorithm for computing kth term of a sequence is also presented. The advantage of this scheme is that the computation is efficient than Schnorr scheme. We also show that the security of the proposed signature scheme is equivalent to that of Schnorr signature scheme.
ER -