Mar 1, 2010 · Based on this problem, we design a new braid-based signature scheme. This scheme is efficient and provably secure in the random oracle model.
In this paper, the state of the art of braid cryptography is surveyed, and then a new cryptographic problem—conjugate adjoining problem related to braid groups ...
Based on this problem, we design a new braid-based signature scheme. This ... One-more matching conjugate problem and security of braid-based signatures.
“Conjugate adjoining problem in braid groups and new design of braid-based signatures” is a paper by Licheng Wang Lihua Wang Zhenfu Cao Yixian Yang Xinxin Niu ...
People also ask
What is the conjugacy problem in braid group?
Are braid groups infinite?
Is the braid group linear?
Some Results in Group-Based Cryptography · Conjugate adjoining problem in braid groups and new design of braid-based signatures · Group ring based ElGamal type ...
Conjugate adjoining problem in braid groups and new design of braid-based signatures. (2010) SCIENCE CHINA INFORMATION SCIENCES 1674-733X 1869-1919 53 524 ...
Conjugate adjoining problem in braid groups and new design of braid-based signatures. Article. Mar 2010. Licheng Wang · Lihua Wang · Zhenfu ...
Niu, ''Conjugate adjoining problem in braid groups and new design of braid-based signatures,'' Sci. China Inf. Sci., vol. 53, no. 3, pp. 524–536, 2010. [36] ...
Conjugate adjoining problem in braid groups and new design of braid-based signatures · Computer Science, Mathematics. Science China Information Sciences · 2010.
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. |