scientific article; zbMATH DE number 5380256
From MaRDI portal
Publication:3545319
Recommendations
- Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
- Concordance group and stable commutator length in braid groups
- Computer aided discovery of a fast algorithm for testing conjugacy in braid groups
- A new approach to the word and conjugacy problems in the braid groups
- Conjugacy of braids
- scientific article; zbMATH DE number 2081063
- A fast algorithm to the conjugacy problem on generic braids.
- scientific article; zbMATH DE number 2209669
- Braid group cohomologies and algorithm complexity
- A new algorithm for solving the word problem in braid groups
Cited in
(18)- Evolution of group-theoretic cryptology attacks using hyper-heuristics
- Exponentially generic subsets of groups
- Attack on Kayawood protocol: uncloaking private keys
- Probabilistic solutions of equations in the braid group.
- Affine braid groups: a better platform than braid groups for cryptology?
- Ironwood meta key agreement and authentication protocol
- Towards generating secure keys for braid cryptography
- Representation attacks on the Braid Diffie-Hellman public key encryption
- The conjugacy search problem in public key cryptography: unnecessary and insufficient
- Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
- Random equations in nilpotent groups.
- Combinatorial group theory and public key cryptography
- A weak key test for braid based cryptography.
- A parallel evolutionary approach to solving systems of equations in polycyclic groups
- A nonlinear decomposition attack
- Authenticated commutator key agreement protocol
- The status of polycyclic group-based cryptography: a survey and open problems
- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
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 Q3545319)
