Subsets of groups in public-key cryptography
November 25, 2023 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
AndrΓ© Carvalho, AntΓ³nio Malheiro
arXiv ID
2311.15039
Category
math.GR
Cross-listed
cs.CR
Citations
2
Venue
arXiv.org
Last Checked
3 months ago
Abstract
We suggest the usage of algebraic subsets instead of subgroups in public-key cryptography. In particular, we present the subset version of two protocols introduced by Shpilrain and Ushakov with some examples in ascending HNN-extensions of free-abelian groups and discuss their resistance to length and distance based attacks. We also introduce several new group theoretic problems arising from this work.
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