In most signature schemes based on a 3-pass identification scheme, the calculation of a signature consists of the following two steps, precomputation and actual signature generation. The former step can, in advance, be calculated, whereas the latter one cannot be done before being given a message for the signature. In this paper, we propose a fast signature scheme whose computational work for signature generation is much smaller than the previous. In the previous schemes are, multiplication is necessary for the signature generation. However, it is not necessary in ours. In our scheme, required is the computation of addition and taking a modulus. Consequently, we can realize the fast signature scheme by applying the following two steps: (1) The precomputetion is previously done. (2) When a signature is required, only the signature generation is executed.
展开▼
