Rubik’s for cryptographers

Hard mathematical problems are at the core of security arguments in cryptography. In this paper, study mathematical generalizations of the famous Rubik’s cube puzzle, namely the factorization, representation and balance problems in non-Abelian groups