Top | Introduction | Members | Activities | Call for Paper | Link | Japanese

    "Studies for fast signature schemes"

    On the calculation of signature, we can classify it into two types, such as precomputation and signature generation. While the former type can be calculated at any time, the latter type cannot be done without determination the message for the signature. In this study, we propose the fast signature schemes whose complexity for signature generation is small. The previous schemes are needed for multiplication in signature generation. However, our schemes do not need it and only use the addition and the modulus. Consequently, we can realize the fast signature schemes by applying the following two steps: (1) The precomputetion is calculated previously. (2) In the time of making signature, only the signature generation is done.

    [ back ]