Abstract
The use of more than one hard problem in the design of cryptographic protocols to enhance security has already been proposed. To this end, a way to embed the discrete logarithm problem as well as the factorisation problem in the signing process in the original El Gamal signature scheme has been described. It is shown that the described modification does not enhance the security of the original 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.
