Investigation of metabelian platform groups for protocols based on (simultaneous) conjugacy search problem
Authors:
Open Access
- 1 January 2025
- journal article
- research article
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 19 (1)
Abstract
There are many group-based cryptosystems in which the security is related to the conjugacy search problem or the simultaneous conjugacy search problem in their underlying platform groups. In this article, we show that some metabelian groups do not provide strong security for these cryptosystems and so they cannot be chosen as platform groups.Keywords
This publication has 16 references indexed in Scilit:
- Applications of Group Theory in Cryptography2024
- Group-based Cryptography in the Quantum EraNotices of the American Mathematical Society, 2023
- A closer look at the multilinear cryptography using nilpotent groupsInternational Journal of Computer Mathematics: Computer Systems Theory, 2021
- Multilinear cryptography using nilpotent groups2020
- ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPSGlasgow Mathematical Journal, 2018
- Solving the Conjugacy Decision Problem via Machine LearningExperimental Mathematics, 2018
- Non-commutative digital signaturesGroups - Complexity - Cryptology, 2012
- NIS05-6: A Non-Commutative Generalization of ElGamal Key Exchange using Polycyclic Groups2006
- New Public-Key Cryptosystem Using Braid Groups2000
- Conjugacy problem in Metabelian groupsMathematical Notes, 1982