Cryptanalysis of some nonabelian group-based key exchange protocols
From MaRDI portal
Cites work
- A cryptosystem based on double generalized discrete logarithm problem
- A family of polycyclic groups over which the uniform conjugacy problem is NP-complete.
- A linear algebra attack to group-ring-based key exchange protocols
- A linear decomposition attack
- A Practical Attack on Some Braid Group Based Cryptographic Primitives
- An algebraic method for public-key cryptography
- Applications of group theory in cryptography. Post-quantum group-based cryptography
- Collection from the left
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography
- Cryptanalysis via algebraic spans
- Discrete logarithms for finite groups
- Efficient collection in infinite polycyclic groups.
- Group-based cryptography
- Group-based key exchange protocol based on complete decomposition search problem
- scientific article; zbMATH DE number 3979149 (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 1409225 (Why is no real title available?)
- Investigation of metabelian platform groups for protocols based on (simultaneous) conjugacy search problem
- Linear and sublinear time algorithms for basis of abelian groups
- ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Public Key Cryptography - PKC 2006
- Public key cryptography based on semigroup actions
- The status of polycyclic group-based cryptography: a survey and open problems
This page was built for publication: Cryptanalysis of some nonabelian group-based key exchange protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7266805)