An Efficient Digital Multisignature Scheme

An efficient digital multisignature scheme is suggested which enhance the Kiesler-Harn's scheme. The suggested scheme has no bit expansion, in which every signer has the RSA modulus with the same bit length and the same most significant b bits pattern. In addition, the new algorithm has no limitations in signing order and in fact is more efficient than the Kiesler-Harn's multisignature algorithm