Abstract
He and Kiesler (1994) proposed two modified schemes to enhance the security of El Gamal's signature scheme (1985). They claimed to have remedied two technical problems of El Gamal's signature scheme, and the security of the second scheme is based on the difficulty of solving both factoring and discrete logarithms simultaneously. The paper shows that both modified schemes, in fact, do not solve the first technical problem. Besides, if one has the ability to solve the discrete logarithms, one can break the second modified signature scheme.
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 callMore From: IEE Proceedings - Computers and Digital Techniques
Disclaimer: 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.
