Are there any cryptographic algorithms or primitives that have been developed and studied that make use of non-commutative or non-associative algebraic structures such as quaternion integers or octonion integers? It seems to me that many of these structures can preserve the things that make them useful to cryptography (the trapdoor nature of multiplication for example) while removing some of the tools used to attack it (symmetries exploited in commutativity and associativity.)
There are several structures that are non-commutative and non-associative that have many features of unique factorization domains, such as Hurwitz quaternions and the 'Cayley' integers studied by Conway and Smith; It wouldn't surprise me to learn there are other structures that have similar properties that are close enough to the integers we're familiar with yet with broken symmetries that make them more resistant to cryptanalytic attacks.
The most obvious utility I can think of is using quaternion or octonion based unique factorization domains in RSA, but many cryptographic systems that use objects like integers I can see being extended to alternative structures. The downside I can see is some hidden congruence relation that is able to be exploited that doesn't exist in the integers. Are there cryptosystems that use such alternatives to the integers?