Cryptanalysis of protocols using (Simultaneous) Conjugacy Search Problem in certain Metabelian Platform Groups
September 25, 2023 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Delaram Kahrobaei, Carmine Monetta, Ludovic Perret, Maria Tota, Martina Vigorito
arXiv ID
2309.13928
Category
math.GR
Cross-listed
cs.CR
Citations
0
Venue
arXiv.org
Last Checked
3 months ago
Abstract
There are many group-based cryptosystems in which the security relies on the difficulty of solving Conjugacy Search Problem (CSP) and Simultaneous Conjugacy Search Problem (SCSP) in their underlying platform groups. In this paper we give a cryptanalysis of these systems which use certain semidirect product of abelian groups.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.GR
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
A Practical Cryptanalysis of the Algebraic Eraser
R.I.P.
π»
Ghosted
A note on some algebraic trapdoors for block ciphers
R.I.P.
π»
Ghosted
Regular subgroups with large intersection
R.I.P.
π»
Ghosted
On the primitivity of PRESENT and other lightweight ciphers
R.I.P.
π»
Ghosted
Solving the Conjugacy Decision Problem via Machine Learning
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted