A parallel evolutionary approach to solving systems of equations in polycyclic groups
From MaRDI portal
Recommendations
- Length-based attacks in polycyclic groups
- Analysis of a certain polycyclic-group-based cryptosystem
- Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography
- An improved version of the AAG cryptographic protocol
- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
Cites work
- scientific article; zbMATH DE number 1617914 (Why is no real title available?)
- scientific article; zbMATH DE number 5380256 (Why is no real title available?)
- scientific article; zbMATH DE number 1759777 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups
- An algebraic method for public-key cryptography
- Analysis of a certain polycyclic-group-based cryptosystem
- Conjugacy problem for braid groups and Garside groups.
- Efficient collection in infinite polycyclic groups.
- Evolutionary algorithm solution of the multiple conjugacy search problem in groups, and its applications to cryptography
- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
- Length-based attacks in polycyclic groups
- Length-based cryptanalysis: the case of Thompson's group
- Probabilistic solutions of equations in the braid group.
- Random subgroups and analysis of the length-based and quotient attacks
- THE BRAID GROUP AND OTHER GROUPS
Cited in
(3)
This page was built for publication: A parallel evolutionary approach to solving systems of equations in polycyclic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338833)