Abstract
The possibility of digital signatures is one of the advantages of asymmetric cryptographic systems. The processing effort, however, is still an obstacle to widespread use of digital signatures, particularly when using smart cards. A more attractive idea is to realize digital signatures with one-time signatures using (conventional) hash functions. In this paper different such procedures, known in theory, will be presented comprehensively and analysed as to their practicality. It is concluded that digital signatures cannot be performed significantly faster with one-time signatures using optimally implemented hash functions than with asymmetric algorithms.
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.
