Two efficient RSA digital multisignature and blind multisignature schemes

In this paper we examine the techniques of adjusting the RSA algorithm to allow multisignatures being simply applied by many users. The proposed algorithms will be suitable for employ in organizations. However, general uses might be the signing of cheques for electronic funds transfer where two or more organization representatives are needed to sign the cheque. The algorithms suggested in this paper are not restricted to RSA scheme. It means that every encryption algorithm e with the multiplicative ability e(k(1)) * e(k(2)) = e(k(1) * k(2)) will work. For concreteness, however, we will employ RSA widely in this paper.