A weak key test for braid based cryptography.

DOI10.1007/s10623-005-5382-9zbMath1159.94366MaRDI QIDQ2491313

Samuel Maffre

Publication date: 29 May 2006

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-005-5382-9

zbMATH Keywords

braid groups; cryptanalysis; conjugacy problem; random generator; weak key test

Mathematics Subject Classification ID

94A60: Cryptography

20F36: Braid groups; Artin groups

Related Items

Towards generating secure keys for braid cryptography, New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups, Conjugacy systems based on nonabelian factorization problems and their applications in cryptography, Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography

Uses Software

• CBraid

Cites Work

• A fast method for comparing braids
• About the effective classification of conjugacy classes of braids
• A note on words in braid monoids
• Conjugacy problem for braid groups and Garside groups.
• Entity authentication schemes using braid word reduction
• Theory of braids
• ALGORITHMS FOR POSITIVE BRAIDS
• A Practical Attack on Some Braid Group Based Cryptographic Primitives
• Advances in Cryptology - CRYPTO 2003
• THE BRAID GROUP AND OTHER GROUPS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item