Factoring products of braids via Garside normal form

DOI10.1007/978-3-030-17259-6_22MaRDI QIDQ2289449OpenAlexFDO

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

zbMATH Keywords

decomposition algorithmbraid groups

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cited in

(4)

• A practical cryptanalysis of \({\mathrm {walnutdsa}^{\mathrm {TM}}}\)
• Attack on Kayawood protocol: uncloaking private keys
• Normal forms in braid groups with respect to some Gröbner-Shirshov basis
• 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)