Abstract
Braid group is a new considerable public key cryptography platform for the quantum computer ages, but almost all current intractable braid problems used for public key cryptosystems are flawy. The security of a braid public key cryptosystem can't depend only on the hardness of conjugacy problems. By taking advantage of the non-conjugate transformation and multiple variant equations on braid groups, two intractable problems are proposed, and the hardness of these problems comes from the enlarged amount of variants. A new related public key algorithm and the analysis of its correctness, security, efficiency and parameter choice are subsequently presented. The new algorithm can resist current known attacks, and the ideal to combine some simple problems to a multiple variant difficult one is constructive for designing new public key algorithms.
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.
