Transitive Signature Scheme from LFSR

摘要

Linear feedback sequence register (LFSR) is a useful cryptographic primitive which is widely implemented in many cryptosystems to represent finite field elements with the counterparts of minimal polynomials. In this paper, an efficient transitive signature scheme from LFSR (LFSR-TS) is considered. First, two derived LFSR sequence operations are designed for LFSR-TS, which are not proposed prior to the current work. Next, the security of LFSR-TS is proven to be existentially unforgeable against the adaptive chosen-message attack in the standard model, which only requires the assumption of the discrete logarithm problem (DLP). Finally, the comparison of performances is presented amongst LFSR-TS and some related schemes.