Secure and Efficient Message Digest with the Braid Theory Algorithm for Digital Signatures (B-TADS)

Abstract

The recent Equifax security breach affecting over 140 million consumers has highlighted the urgency in providing more secure, robust, and efficient algorithms in all aspects of computer security. Digital signatures are one of the most important techniques used in modern information security. However, most digital signatures in use today are implemented by algorithms that are not secure due to the solvability of these mathematical problems in polynomial time. Our research addresses this issue by selecting an intractable algebraic problem from the braid group to provide a secure, fast, and effective technique for digital signatures