Abstract:
Today blind signatures scheme are important
techniques and can be used in many e-commerce
services, such as electronic voting and cash payment
system.Privacy is one of the basic rights for individuals
and institutions that need to preserve their
confidentiality.The performance of blind signature
scheme is based on operation of scalar multiplication
method. In this paper, we present the comparison of
multiplication methods such asbinary double and adds,
ternary expansion, Montgomery ladder and nonadjacent
algorithm. The security of proposed blind
signature scheme is based on solving the problem of
elliptic curve discrete logarithm problem (ECDLP) and
it can satisfy the requirements blind signature.The
proposed scheme desired to reduce time consuming
problem by using efficient multiplication
method.Althoughmontgomery ladder algorithm is more
efficient than the other algorithms, double and add
algorithm is more compatible with the proposed
system.
