arXiv Analytics

Sign in

arXiv:2308.14725 [math.GR]AbstractReferencesReviewsResources

Applications of Finite non-Abelian Simple Groups to Cryptography in the Quantum Era

María Isabel González Vasco, Delaram Kahrobaei, Eilidh McKemmie

Published 2023-08-28Version 1

The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian simple groups to cryptography and discuss different scenarios in which this theory is clearly central, providing the relevant definitions to make the material accessible to both cryptographers and group theorists, in the hope of stimulating further interaction between these two (non-disjoint) communities. In particular, we look at constructions based on various group-theoretic factorization problems, review group theoretical hash functions, and discuss fully homomorphic encryption using simple groups. The Hidden Subgroup Problem is also briefly discussed in this context.

Related articles: Most relevant | Search more
arXiv:1603.04018 [math.GR] (Published 2016-03-13)
On finite $ca$-$\mathfrak F$ groups and their applications
arXiv:2407.10222 [math.GR] (Published 2024-07-14)
On closure operations in the space of subgroups and applications
arXiv:2407.07459 [math.GR] (Published 2024-07-10)
Retraction to a parabolic subgroup and applications