Abstract
ABSTRACTMany 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 © 2011 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
