Investigation of metabelian platform groups for protocols based on (simultaneous) conjugacy search problem
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.
Authors
- Delaram Kahrobaei (ORCID: https://orcid.org/0000-0001-5467-7832)
- Carmine Monetta (ORCID: https://orcid.org/0000-0002-5426-1260)
- Martina Vigorito (ORCID: https://orcid.org/0009-0002-6266-7364)
- Maria Tota (ORCID: https://orcid.org/0000-0002-0430-7515)
- Ludovic Perret
Institutions
- Queens College, CUNY (US)
- The Graduate Center, CUNY (US)
- Centre National de la Recherche Scientifique (FR)
- University of Salerno (IT)
- City University of New York (US)
- Sorbonne Université (FR)
- CS Communication & Systèmes (France) (FR)
- LIP6 (FR)
- University of York (GB)
- New York University (US)
Publication Details
- Journal
- Journal of Mathematical Cryptology
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1515/jmc-2023-0036
- Citations
- 1
- Primary Topic
- DNA and Biological Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.81
Funders
- City University of New York
- Istituto Nazionale di Alta Matematica "Francesco Severi"
- European Commission
- Agence Nationale de la Recherche
- Centre National de la Recherche Scientifique
- Università degli Studi di Salerno
- Institut Henri Poincaré
- Sorbonne Université
- Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni
- Office of Naval Research