scientific article; zbMATH DE number 2081063

MaRDI QIDQ4474170zbMATH OpenFDO

Authors Jae Choon Cha, Ki Hyoung Ko, Sang-Jin Lee, Jae Woo Han, Jung Hee Cheon

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2248/22480144.htm

zbMATH Keywords

Artin presentationcryptanalysisbraid groupband-generator presentation

Mathematics Subject Classification ID

Cryptography (94A60) Braid groups; Artin groups (20F36) General topics in the theory of algorithms (68W01)

Recommendations

• Braid group cohomologies and algorithm complexity
• A new algorithm for solving the word problem in braid groups
• On braid groups
• scientific article; zbMATH DE number 2209669
• Constructing representations of braid groups
• scientific article; zbMATH DE number 4078810
• Computer aided discovery of a fast algorithm for testing conjugacy in braid groups
• scientific article; zbMATH DE number 5380259
• Braids and Galois groups
• Zöpfe und Galoissche Gruppen.

Cited in

(19)

• Entity authentication schemes using braid word reduction
• Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
• scientific article; zbMATH DE number 5380259 (Why is no real title available?)
• Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
• New public key cryptosystems from combinatorial group theory
• Rewriting system of certain semigroups with three generators
• Groups with two generators having unsolvable word problem and presentations of Mihailova subgroups of braid groups
• Non-associative public-key cryptography
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• CBraid
• Transitive Signatures from Braid Groups
• scientific article; zbMATH DE number 5380256 (Why is no real title available?)
• Properties of certain semigroups and their potential as platforms for cryptosystems
• Representation attacks on the Braid Diffie-Hellman public key encryption
• The conjugacy search problem in public key cryptography: unnecessary and insufficient
• Cryptanalysis of a key exchange protocol based on the endomorphisms ring \(\mathrm{End}(\mathbb Z_p\times\mathbb Z_{p^2})\)
• An improvement of the Diffie-Hellman noncommutative protocol
• A weak key test for braid based cryptography.
• Towards generating secure keys for braid cryptography

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474170)