Conjugate adjoining problem in braid groups and new design of braid-based signatures. (2010) SCIENCE CHINA INFORMATION SCIENCES 1674-733X 1869-1919 53 524 ...
We design an algorithm to solve the word problem and implement it on a multitape Turing machine. After a complexity analysis, we conclude with the following ...
Missing: adjoining | Show results with:adjoining
Dec 13, 2004 · Lee, New signature scheme using conjugacy problem, online http://eprint.iacr.org/2002/168/. [12] P. Dehornoy, A fast method for comparing ...
We survey some of the recently developed cryptographic schemes involving Artin's braid groups, as well as the attacks against these schemes. We also point out ...
Missing: adjoining | Show results with:adjoining
Various other signature protocols can be designed using the gap in the braid group. ... Under this restriction, we implement a new signature scheme based on braid ...
Missing: adjoining | Show results with:adjoining
Conjugate adjoining problem in braid groups and new design of braid-based signatures. Sci China Ser. F-Inf Sci, (3):(In presss), 2010. A Proof of Proposition ...
This is a major problem. For our own security we need to develop cryptosystems that we can prove are secure. Why the braid groups? The braid groups are subset ...
In this paper, by introducing an isomorphism from the Mihailova subgroup of F2×F2 to the Mihailova subgroups of a braid group, we give an explicit ...
We introduce the braid groups in their connection to knot theory and investigate several of their properties. Based on term rewriting systems, which we review, ...
Mar 29, 2022 · based on the root problem in braid groups is presented by Sibert, Dehornoy, ... A new approach to the conjugacy problem in Garside groups.
In response to a legal request submitted to Google, we have removed 1 result(s) from this page. If you wish, you may read more about the request at LumenDatabase.org. |