Factoring products of braids via Garside normal form

DOI10.1007/978-3-030-17259-6_22OpenAlexW2932988897MaRDI QIDQ2289449FDOQ2289449

Authors: Simon-Philipp Merz, Christophe Petit 

Publication date: 28 January 2020

Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/60776961/Factoring_Braids.pdf

Recommendations

• An attack on the Walnut digital signature algorithm
• A practical cryptanalysis of \({\mathrm {walnutdsa}^{\mathrm {TM}}}\)
• A Practical Attack on Some Braid Group Based Cryptographic Primitives
• Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
• Braid Group Cryptography

zbMATH Keywords

decomposition algorithmbraid groups

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (4)

• Normal forms in braid groups with respect to some Gröbner-Shirshov basis
• A practical cryptanalysis of \({\mathrm {walnutdsa}^{\mathrm {TM}}}\)
• Attack on Kayawood protocol: uncloaking private keys
• An improvement of the Diffie-Hellman noncommutative protocol

This page was built for publication: Factoring products of braids via Garside normal form

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