Abstract
Facing the challenge of developing quantum computers, quantum-resistant digital signature algorithms have been developed based on hash functions and have received the attention of many scientists. This paper focuses on evaluating hash function-based quantum-resistant digital signature algorithms and their applicability in protecting transmitted information. Analyzing, synthesizing and comparing the strengths and limitations of the algorithms is the main research method of the paper. It also highlights the challenge of applying them in different fields such as banking, e-commerce, and government. The article is useful for those who are just starting to study quantum-resistant digital signatures, helping them get an overview of the field. It also assists regulators, governments and other organizations in making decisions and policies regarding digital signature security platforms.
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.
