An improved discrete logarithm-based multisignature scheme
Many researchers have investigated the Rivest, Shamir, and Adleman (RSA) and ElGamal algorithms for digital multisignatures. Computational and communicational costs increase rapidly after a series of signings; these methods are unsuitable for organizations with multiple geographic locations. Because these methods require many online tasks, problems such as theft, data falsification, and masquerading often occur. This study therefore proposes a digital multisignature scheme that decreases computational costs and achieves quick validation. Copyright (c) 2011 John Wiley & Sons, Ltd.
digital multisignature network security discrete logarithm cryptography