Cayley Hash Values of Brauer Messages and Some of Their Applications in the Solutions of Systems of Differential Equations

: Cayley hash values are deﬁned by paths of some oriented graphs (quivers) called Cayley graphs, whose vertices and arrows are given by elements of a group H . On the other hand, Brauer messages are obtained by concatenating words associated with multisets constituting some conﬁg-urations called Brauer conﬁgurations. These conﬁgurations deﬁne some oriented graphs named Brauer quivers which induce a particular class of bound quiver algebras named Brauer conﬁguration algebras. Elements of multisets in Brauer conﬁgurations can be seen as letters of the Brauer messages. This paper proves that each point ( x , y ) ∈ V = R \{ 0 } × R \{ 0 } has an associated Brauer conﬁguration algebra Λ B ( x , y ) induced by a Brauer conﬁguration B ( x , y ) . Additionally, the Brauer conﬁguration algebras associated with points in a subset of the form ( (cid:98) ( x ) (cid:99) , (cid:100) ( x ) (cid:101) ] × ( (cid:98) ( y ) (cid:99) , (cid:100) ( y ) (cid:101) ] ⊂ V have the same dimension. We give an analysis of Cayley hash values associated with Brauer messages M ( B ( x , y ) ) deﬁned by a semigroup generated by some appropriated matrices A 0 , A 1 , A 2 ∈ GL ( 2, R ) over a commutative ring R . As an application, we use Brauer messages M ( B ( x , y ) ) to construct explicit solutions for systems of linear and nonlinear differential equations of the form X (cid:48)(cid:48) ( t ) + MX ( t ) = 0 and X (cid:48) ( t ) − X 2 ( t ) N ( t ) = N ( t ) for some suitable square matrices, M and N ( t ) . Python routines to compute Cayley hash values of Brauer messages are also included.


Introduction
Hash functions are compression functions that are easy to compute.They are helpful tools in several cryptographic tasks.Ensuring data integrity and password authentication systems are some of the primary roles of hash functions.Data integrity provided by hash functions prevents undesirable data modification [1].
To date, it is believed that well-posed hash functions such as SHA256 are unbreakable by several attacks, including those conducted by a quantum computer.
The Cayley graph C H,s = (V, E) associated with a subset s of a multiplicative (semi)group H is a k-regular graph, whose set of vertices V are in bijective correspondence with the set H. In this case, if v g 1 , v g 2 ∈ V are vertices corresponding to the elements g 1 , g 2 ∈ H, then there is an arrow connecting v g 1 and v g 2 provided that there is an element s ∈ s, such that g −1 1 g 2 s −1 = 1, where 1 is the identity element of the group H.The idea behind the use of Cayley graphs in cryptography is to produce hash functions that are collision resistant.
The input to these functions gives directions for walking around the graph, and the output is the ending vertex of the walk [2].
On the other hand, Brauer messages were introduced by Espinosa et al. [3] in their research regarding some bound quiver algebras called Brauer configuration algebras by Green and Schroll [4].This paper provides Cayley hash values to some of these Brauer messages.
Brauer messages have applications in different science fields.For instance, they were used by Cañadas et al. in the graph energy theory to compute the trace norm of some matrices and in the war games theory to declare winners and losers in war games based on the behavior of a missile defense system (MDS) [5].Furthermore, mutations of Brauer messages can be used to give an algebraic interpretation of the Advanced Encryption Standard (AES) key schedule [6].

Motivations
This paper uses an interaction between cryptography, algebraic geometry, combinatorics, and the theory of representation of associative algebras to obtain applications of the theory of Brauer configuration algebras in cryptography and differential equations.
Relationships between algebraic geometry and Brauer configuration algebras are motivated by a recent paper published by Green and Schroll [7], who proved that each point in an affine variety has an associated suitable associative algebra and that all these algebras have the same dimension.As an interpretation of this result, we prove that, associated with each point in R * × R * , there is a suitable Brauer configuration algebra and that Brauer configuration algebras associated with points in a set of the form (m, m + 1] × (n, n + 1], m, n ∈ Z have the same dimension.The messages arising from these Brauer configurations (called Brauer messages) are used to provide solutions for linear and nonlinear systems of differential equations.We compute Cayley hash values of Brauer messages establishing for which integer numbers such hash values are collision-resistant.
Henceforth, we outline the main results presented in this paper and how previous works are used to obtain them.

Contributions
We prove that each point (x, y) ∈ V = R\{0} × R\{0} is associated with a suitable Brauer configuration algebra.Properties of these algebras are also established.In particular, it is proved that their dimensions can be computed by enumerating suitable lattice paths.Similar conditions have their corresponding centers.
As an application, we interpret message specializations of these Brauer configurations as appropriated matrices with applications in Catalan combinatorics and differential equations.It is also proved that some of these matrices are solutions to some linear and nonlinear systems of differential equations of the form X (t) + 2 γ−1 X(t) = 0 and X (t) − X 2 (t)M e (α, γ, β)t = M e (α, γ, β)t, where M e (α, γ, β) is a matrix whose entries are given by appropriated Brauer messages.It is worth noting that finding explicit solutions to nonlinear differential equations is in general a cumbersome problem.
Cayley hash functions based on matrix semigroups are applied to some Brauer messages to prove that these hash families are collision resistant.
Python routines to compute Cayley hash values of Brauer messages associated with points in the plane are also introduced.
Figure 1 shows how previous works, mutations, and Brauer configuration algebras (BCAs) can be related to obtain the main results (targets of red arrows) presented in this paper.
In Section 2.1.1,we recall the main results regarding BCAs; Proposition 1 and Theorem 2 give formulas for the dimensions of these algebras and their centers.
Theorem 3 provides the properties of BCAs associated with points in the plane.Their dimensions and combinatorial data regarding indecomposable projective modules over these algebras are given.Theorem 4 describes arithmetic properties of specialized matrices given by mutations of Brauer configurations associated with the plane.
Corollary 1 provides explicit solutions of linear and nonlinear systems of differential equations.
Section 4 is devoted to Cayley hash functions.Theorem 5 gives Cayley hash values for appropriated matrix semigroups.These results allow to give Cayley hash values of Brauer messages.Corollary 2 proves that Sosnovski hash functions are collision-resistant when they are applied to Brauer messages.This paper is distributed as follows: Section 2 is devoted to recalling definitions and notation used throughout the document.In particular, we recall the notion of Brauer configuration algebra.In Section 3, we give our main results.We associate to each point (x, y) ∈ V an apropriated Brauer configuration algebra determining which of them have the same dimension.Mutations are defined for the variables associated with these algebras.Such mutations give rise to new classes of matrices with applications in combinatorics and differential equations.Section 4 is devoted to the values of Cayley hash functions associated with Brauer messages.Experimental data are given in Section 5. Concluding remarks and possible future works are described in Section 6. Appendix A gives Python routines to compute Brauer messsages, their Sosnovski hash values, and polygons of Brauer configurations associated with the plane.

Background and Related Work
In this section, we introduce some definitions and notation to be used throughout the paper.In particular, a brief overview regarding hash functions and Brauer configuration algebras is given [4].
Henceforth, the symbol F (C) denotes a field (the complex numbers field), and (x) ( (x) ) denotes the smallest (greatest) integer greater (less) than or equal to a real number x.In path algebras FQ, it is assumed that F is an algebraic closed field.

Related Work on Cayley Hash Functions
This section gives a background on hash functions, in particular, Cayley hash functions.Hash functions are easy-to-compute compression functions, as described before.Such functions are used in several contexts.For instance, they are helpful in password management systems.Servers that authenticate user passwords save a one-way hash associated with a unique password so that if an attacker steals the database, it may be unfeasible for the attacker to recover the original password as plaintext [1,8].
A hash family is a four-tuple (X , Y, K, H), If X = Y, and the hash function h is the identity, then h is said to be an unkeyed hash function [1,2].
A hash function is said to be secure if the following three problems are difficult to solve: Preimage Instance: A hash function h : X → Y and an element y ∈ Y.
Find: x ∈ X such that h(x) = y.

Second Preimage
Instance: A hash function h : X → Y and an element x ∈ X .Find: x ∈ X such that x = x and h(x ) = h(x).

Collision
Instance: A hash function h : X → Y and an element x ∈ X .Find: x, x ∈ X such that x = x and h(x ) = h(x).
Hash functions are used to construct a short fingerprint or digest the message of some data.If an attacker alters the data, then the fingerprint will no longer be valid.One of the most used methods to construct iterated hash functions is the Merkle-Damgård scheme, which builds hash functions from a compression function.Rivest introduced, in 1990, the first scheme of this type named MD4.Soon afterwads, Rivest himself proposed an improved version of MD4 called MD5.
Collisions in the compression function of MD4 and MD5 were discovered in the 1990s.The family of secured hash algorithms (SHAs) was proposed as a standard by NIST in 1993.SHA-0 was adopted as FIPS 180.Each of these hash algorithms was an improvement of the earlier versions to prevent previously found attacks.
It was shown in 1998 that SHA-0 allows collisions in approximately 2 61 steps, whereas the first collision for SHA-1 was found in 2017.SHA-2 includes the four hash functions known as SHA-224, SHA-256, SHA-384, and SHA-512, according to the sizes of the corresponding fingerprints.It is worth pointing out that currently SHA-256, which outputs 256 bits fingerprints, is the most used hash function.It is the basis of many password authentication systems.
According to the National Academy of Sciences, Engineering, and Medicine [8] (NAE), although, nowadays it is believed to be essentially impossible to break a hash function such as SHA-256, password hashing is at higher risk due to the size of all 10-character passwords being only about 2 66 passwords, and thus prone to an attack based on a quantum computer.
Possible attacks on the currently used hash functions have encouraged the use of provably secure hash functions, whose security is based on the difficulty of solving a known hard problem.
Cayley hash functions based on the Cayley graph of certain (semi)groups are examples of these types of schemes, whose security follows from the hardness of the expander graph problem associated with a (semi)group.
In 1991, Zémor [9] introduced hash function schemes based on matrix products in the special linear group Sl(F p ), where p is a fixed prime number.Zémor himself and Tillich [10] broke such schemes.Furthermore, they introduced the group Sl(F 2 n ) to increase the security of the original hash functions [11].In this setting, F 2 n is a field.
Due to the popularity of the hash functions introduced by Zémor and Tillich, several proposals in the same line were proposed by Petit and Lubotzki et al., who introduced Cayley hash functions based on Ramanujan graphs, in particular LPS hash functions [12][13][14][15].
The Tillich-Zémor hash function hashes each bit of a given message individually.
In this case, the matrices have the form , where ), F 2 is the two-element field, (p(x)) is the ideal generated by an irreducible polynomial of degree n, and α is a root of p(x).For instance, the message It is worth noting that the Tillich-Zémor hash function was successfully attacked by Grass et al. [16], who obtained collisions using the Euclidean algorithm for polynomials.Afterwards, Petit and Quisquater [17] introduced an extended form of Grass et al.'s algorithm to provide a second preimage algorithm.Grassl et al. also ran Grover's algorithm on a quantum computer to study the strength of the cryptographic system AES [18].
Mullan and Tsaban [19] introduced a general attack for the Tillich-Zémor scheme.It runs with polynomial time o( √ q) to find collisions for an arbitrary q.It does not work for bit strings of length n > 100.
Other pairs of matrices such as in the Tillich-Zémor scheme have been proposed by Bromber et al. and Sosnovki, who introduced a semigroup platform corresponding to the hash functions f (x) = 2x + 1 and g(x) = 3x + 1 modulo a prime p > 3 (the corresponding associated matrices have the form A = 2 1 0 1 and B = 3 1 0 1 ).In this case, the input string hash function can have an arbitrary length, and the output has the size 2log(p).
In this paper, we applied Sosnovski hash functions to Brauer messages to investigate their collision-resistant property.

Background and Related Work on Brauer Configuration Algebras
Brauer configuration algebras (BCAs) were introduced by Green and Schroll [4] to generalize research on tame algebras.Soon afterwards, Cañadas et al. used these algebras and their associated messages to obtain applications in cryptography, cibersecurity, and the graph energy theory [3,5,6,20,21].
It is worth pointing out that Espinosa [3] introduced in his doctoral dissertation the notion of the message of a Brauer configuration as the element of a word algebra.He used Brauer messages to give formulas for the number of perfect matchings of a snake graph and the number of homological ideals associated with a Nakayama algebra.On the other hand, Cañadas et al. introduced mutations of Brauer configurations to give an algebraic description of the cryptosystem AES [6].
In this paper, we associate Brauer configuration algebras with points in the plane, establishing which points have associated Brauer configuration algebras with the same dimension.

Path Algebras
In this section, we give a brief discussion on quivers, path algebras, and their ideals based on the work of Assem et al. [22].
A quiver or directed graph Q = (Q 0 , Q 1 ) is a quadruple consisting of two sets: Q 0 (whose elements are called points or vertices) and Q 1 (whose elements are called arrows) and two maps s, t : Q 1 → Q 0 which associate to each arrow α ∈ Q 1 , its source s(α) ∈ Q 0 , and its target t(α) ∈ Q 0 , respectively.If F is an algebraically closed field, then we let FQ denote the path algebra associated with the quiver Q, whose underlying F-vector space has as its basis the set of all paths of length l ≥ 0 in Q, such that the product of two basis vectors is given by the usual concatenation of paths.
The following Figure 2 shows a quiver Q with four vertices a 1 , a 2 , a 3 , and a 4 and three arrows α 1 , α 2 , and α 3 .Note that, Q 1 = {α 1 , α 2 , α 3 } is the set of paths of length 1, whereas The basis B of the algebra FQ associated with the quiver Q shown in Figure 2 is B = {e a 1 , e a 2 , e a 3 , e a 4 , α 1 , α 2 , α 3 , α 1 α 2 , α 1 α 3 }, where {e a 1 , e a 2 , e a 3 , e a 4 } is the set of primitive idempotents, with e 2 a i = e a i and e a i e a j = 0 if i = j.Let Q be a finite and connected quiver.The two-sided ideal R Q of the path algebra FQ generated (as an ideal) by the arrows of Q is called the arrow ideal of FQ.A two-sided ideal I of FQ is said to be admissible if there exists m ≥ 2 such that R m Q ⊆ I ⊆ R 2 Q .If I is an admissible ideal of FQ, the pair (Q, I) is said to be a bound quiver.The quotient algebra FQ/I is said to be the algebra of the bound quiver (Q, I) or, simply, a bound quiver algebra.
Let Q be a quiver.A relation in Q with coefficients in F is an F-linear combination of paths of length, with at least two having the same source and target.
If (ρ j ) j∈J is a set of relations for a quiver Q such that the ideal they generate ρ j | j ∈ J is admissible, we say that the quiver Q is bound by the relation (ρ j ) j∈J or by the relations Henceforth, we let rad Λ denote the radical of a path algebra Λ = FQ, which is the intersection of all maximal ideals.Actually, if I is an admissible ideal of Λ, it holds that rad(FQ/I) = R Q /I.
If ≺ is an admissible well-ordering on the set of paths, i.e., ≺ is a well-ordering such that 1.
If a, b, u, v ∈ Q, where uav and ubv are both nonzero a ≺ uav or a = uav.
Then, the tip Tip(x) = w of an element x ∈ FQ is the maximal path w with respect to ≺ such that w has a nonzero coefficient in x when it is written as a linear combination of the elements of a fixed basis of FQ.Tip(X) = {Tip(x) | x ∈ X} is the set of tips of elements in X [7].
Let I be an ideal in a path algebra FQ and let G ⊂ I.If Tip(G) = Tip(I) , then G is a Gröbner basis for I with respect to ≺.

Brauer Configuration Algebras
In this section, we briefly discuss the main results regarding Brauer configuration algebras [4].
A Brauer configuration algebra Λ B (or simply Λ if no confusion arises) is induced by a Brauer configuration B = (B 0 , B 1 , µ, O), consisting of a pair of finite sets B 0 and B 1 , a function µ : B 0 → N + (N + denote the set of positive integers), and an orientation O. O is a choice for each vertex δ ∈ B 0 of a cyclic ordering of the polygons in which δ occurs as a vertex including repetitions (see [4] for more details).For instance, if a vertex δ ∈ B 0 occurs in polygons V i i , V i 2 , . . ., V i m for suitable indices, then the cyclic order is obtained by linearly ordering the list, say where, is the chosen ordering at vertex δ, then the same ordering can be represented by any cyclic permutation.The sequence (1) is said to be the successor sequence at vertex δ, denoted S δ , which is unique up to permutations.Note that Green and Schroll [4] mentioned that different orientation choices are typically associated to nonisomorphic Brauer configuration algebras.Henceforth, in this paper, if a vertex δ = δ belongs to some polygons V j 1 , V j 2 , . . .V j k ordered according to the already defined cyclic ordering associated with the vertex δ, then we assume that up to permutations the cyclic ordering associated with the vertex δ is built, taking into account that polygons V j 1 , V j 2 , . . .V j k inherit the order given by the successor sequence S δ .• If V denotes the underlying set defined by a polygon V (repetitions are not allowed in V), then If δ ∈ B 0 , then the valency val(δ) of δ is given by the identity If δ ∈ B 0 is such that µ(δ)val(δ) = 1, then δ is said to be truncated (it occurs once in just one polygon).Otherwise, δ is a nontruncated vertex.A Brauer configuration without truncated vertices is said to be reduced.
Algorithm 1 is a short version of an algorithm defined by Cañadas et al. in [5] to build a Brauer configuration algebra.
The following results describe the structure of Brauer configuration algebras [4,23].
Algorithm 1: Construction of a Brauer configuration algebra 1.
Output The Brauer configuration algebra For each covering V i < V j in a successor sequence S δ , define an arrow For each path defined by a successor sequence S δ , construct a special cycle Define the path algebra FQ B . 5.
The admissible ideal I B is generated by relations of the following types: (a) Identify special cycles associated with nontruncated vertices in the same Products of the form ab ∈ FQ B with a induced by a covering in a special cycle C δ 1 and b induced by another special cycle C δ 2 (with δ 1 = δ 2 ) belong to I B .

6.
Λ B = FQ B /I B is a Brauer configuration algebra with a basis consisting of classes of special cycles and classes of prefixes of special cycles.
There is a bijection between the set of indecomposable projective Λ B -modules and the polygons of B.Moreover, if P V is an indecomposable Λ B -module induced by a polygon V with r nontruncated vertices, then rad I is admissible, and Λ B is multiserial and symmetric.

3.
The number of summands in the rad P V /soc P V of an indecomposable projective Λ B -module P V with rad 2 P V = 0 equals the number of nontruncated vertices of the polygon V counting repetitions.4.
Proposition 1 and Theorem 2 give formulas for the dimensions dim F Λ B and dim F Z(Λ B ) of a Brauer configuration algebra Λ and its center Z(Λ B ) [4,23].Proposition 1 ([4], Proposition 3.13).Let Λ B be a Brauer configuration algebra associated with the Brauer configuration B and let C = {C 1 , . . ., C t } be a full set of equivalence class representatives of special cycles.Assume that for i = 1, . . ., t, C i is a special δ i -cycle where δ i is a nontruncated vertex in B. Then, where |Q 0 | denotes the number of vertices of Q, |C i | denotes the number of arrows in the δ i -cycle C i , and n i = µ(δ i ).
Theorem 2 (Theorem 4.9, [23]).Let Λ B = FQ/I be the Brauer configuration algebra associated with the connected and reduced Brauer configuration B. Then, where

The Message of a Brauer Configuration
The notion of the message of a Brauer configuration and labeled Brauer configurations were introduced by Espinosa et al. [3] to define suitable specializations of some Brauer configuration algebras.According to them, since polygons in a Brauer configuration B = (B 0 , B 1 , µ, O) are multisets, it is possible to assume that any polygon U ∈ B 1 is given by a word w(U) of the form where for each i, The message is in fact an algebra of words element W B associated with a fixed Brauer configuration, such that for a given field F the word algebra W B consists of formal sums of words with the form ∑ = ε is the empty word, and 1w(U) = w(U) for any U ∈ B 1 .The product in this case is given by the usual word concatenation.The formal product (or word product) is said to be the message of the Brauer configuration B.
If R is a ring, then a specialization of a reduced Brauer configuration B = (B 0 , B 1 , µ, O) is a Brauer configuration B e = (B e 0 , B e 1 , µ e , O e ) endowed with a suitable map e : B 0 → R, such that µ e (e(δ)) = µ(δ), for any vertex δ ∈ B 0 . (5) The orientation O e is defined by the orientation O, in such a way that if is a successor sequence associated with a vertex δ ∈ B 0 (see (1)), then, for some is contained in the successor sequence S e(δ) associated with e(δ) ∈ B e 0 .M(B e ) = ∝ U∈B e 1 w e (U) (∝ is a suitable operation associated with the specialization ring) is the specialized message of the Brauer configuration B provided that, in such a case, each word can be interpreted by a product of the specialization ring elements.
A Brauer configuration B = (B 0 , B 1 , µ, O) is said to be S-labeled (or simply labeled, if no confusion arises) by an integer sequence S = {n 1 , n 2 , . . ., n |Γ 1 | } if each polygon U i j is labeled by an integer number n j , 1 ≤ j ≤ |B 1 |.In such a case, we often write For each vertex δ ∈ B 0 , a corresponding cyclic ordering of labeled polygons where δ occurs is defined.One advantage of labeling Brauer configurations is that the set S can be used to systematically define the orientation associated with each vertex or obtain the polygons recursively [3].
It is worth noticing that any finite set can be used to label Brauer configurations.In this paper, we use finite well-ordered sets of lattice paths to label Brauer configurations.

Main Results
In this section, we give properties of Brauer configuration algebras Λ B(x,y) associated with points (x, y) ∈ V.
If (x, y) ∈ {(r, s) ∈ R 2 | r > 0, s > 0} = D, then (x, y) defines a path P connecting P 0 = (x, y) with (0, 0).Internal vertices P i are such that; An arrow α ∈ P connecting vertices ( (x) − i, y), ( (x) − (i + 1), y) (( (x) , y − i), ( (x) , y − (i + 1))) is labeled by a symbol x (y).The same is assumed if the arrow α connects points ( (x) , y) and ( (x) , (y) ) and ((x, (y) ) and ( (x) , (y) )).Since, it is easy to see that there are ( (x) + (y) ( ) = c(x, y) of such paths, we endowed this set with a linear order .We let L (x,y) denote such a set of paths, whose elements L are ordered in the form: A labeled (by the set L (x,y) ) Brauer configuration B(x, y) is associated with each point (r, s) ∈ D in such a way that: y s is the word associated with each polygon P i .(8) Successor sequences S x and S y have the forms: ) (1) ) (1) The following Figure 3 shows a Brauer quiver Q B (r,s) induced by a Brauer configuration B (r,s) , with (r) + (s) = 4.For all possible values of i, j, and k, the admissible ideal I B (r,s) is generated by relations of the form: , where C x (C y ) is a special cycle associated with vertex x (y), and a is the first arrow of a special cycle C r , r ∈ {x, y}.
The following result gives the structure of Brauer configuration algebras Λ B (r,s) = FQ B (r,s) /I B (r,s) induced by Brauer configurations of type B (r,s) .Theorem 3.For r, s ∈ D, it holds that: 1.
The Brauer configuration algebra Λ B (r,s) is reduced and connected.

2.
Λ B(r,r) has length grading induced by the path algebra FQ B(r,r) .

1.
Since each polygon contains vertices x and y, it follows that the Brauer configuration Since µ (r,r) val(x) = µ (r,r) val(y) = r( 2r r ), the result holds as a direct consequence of Proposition 2.

3.
Each polygon P i has r vertices denoted by x and s vertices denoted by y.Thus, P i has r + s nontruncated vertices, counting repetitions.4.
Remark 1. Similar results as those presented in Theorem 3 can be obtained in the other quadrants of V = R * × R * by building sets L (r,s) connecting consecutive vertices in an appropriated fashion.

Mutation and Frozen Regions in the Plane
Let f 2 ⊂ D be a line segment containing points (n, k), (x 1 , 0), (0, x 1 ) ∈ (Z × Z) ∩ D, with x 1 = n + k.Let f 1 be a differentiable increasingly monotone curve on the interval [0, x 0 ] with f 1 (x 0 ) = 0, and f 1 (0) = y 0 , x 0 , and y 0 are real numbers such that 0 ≤ x 0 ≤ x 1 , and 0 ≤ y 0 ≤ x 1 , thus, 0 ≤ f 1 ≤ f 2 .These inequalities define a region R f 1 r (R m ) bounded by the coordinate axes f 1 and f 2 (bounded by the coordinate axes and f 1 ).R f 1 r is said to be a frozen (mutation) region.Figure 4 shows regions R f 1 r and R m .We let R( Mutation and frozen regions allow defining a new labeling for sets L (x,y) of paths associated with Brauer configurations of type (8).Such a labeling is defined as follows: • Arrows α = a → b ∈ L (x,y) are labeled with symbols x (horizontal arrows), y (vertical arrows), and z (y mutations).
Where, Int X (bd(X)) denotes the interior (boundary) of a set X endowed with the usual topology of R 2 .

•
The labeling of an arrow α = a y Figure 5 shows an example of this kind of labeling with Figure 5. Example of a labeling with mutations associated with a region R(− 2 3 x + 2 (0 ≤ x ≤ 3), 49  4 The Brauer configuration B(( is defined as follows: • • The successor sequences S x , S y , and S m at vertices x, y, and m have the following forms: 2 3 ) (2)   < (U ) (2) . . 2 3 (  Figure 7 shows the Brauer quiver induced by the Brauer configuration B(( √ 3, √ 3), f 1 , f 2 ).
The admissible ideal is generated by the following relations (together with those related to special cycles) for all possible values of i, j, and h: , and s m γ m h .
Remark 2. Henceforth, we consider the specialization e : B 0 ((x, y), f 1 , f 2 ) → C, with e(x) = e(y) = 1 and e(m) = e iφ for some fixed φ, 0 ≤ φ ≤ 2π associated with the Brauer configuration (8) and its mutation.A specialized word is given by a product over C of the x, y, and m specializations, whereas a message M(B((x, y), f 1 , f 2 ) of the Brauer configuration B((x, y), f 1 , f 2 ) is the sum over C of the specialized words.

3.
The identity is a direct consequence of property 1.Note that If we proceed by induction, assuming that the assertion is true for any matrix It follows from the identity C m = M e (1, 2m + 1, m), where C m = 1 m+1 ( 2m m+1 ) is the mth Catalan number.

6.
By construction, we note that if R e α 0 (C e γ 0 ) is the α 0 th row (γ 0 th column of M e (α, γ, β))., then the inner product The following Corollary 1 uses the properties given in Theorem 4 to obtain explicit solutions of some linear and nonlinear systems of differential equations.
cos(M e (α, γ, β)t) is a solution of the linear system of differential equations 2. tg(M e (α, γ, β)t) is a solution of the nonlinear system of differential equations Proof.It suffices to note that where Sh(x) (Ch(x)) denote the usual hyperbolic sine (cosine) function.

Cayley Hash Values of Brauer Messages Associated with the Plane
In this section, we compute and analyze Cayley hash values of Brauer messages M e (B(r, s), f 1 α , f 2 γ ).Cayley hash functions are examples of provably secure hash functions.The following Algorithm 2 allows building a hash function from an expander Cayley graph: Algorithm 2: Construction of a Cayley hash

•
Fix a finite (semi)group H with a set of generators s with the same size as the text alphabet A.

•
Choose an injective function f : A → s.

•
The hash function of the text or word x 1 x 2 . . .x k is the (semi)group element Remark 3. Note that, under these circumstances, message specializations e : B 0 ((x, y), f 1 , f 2 ) → C, as those defined in Remark 2 with e(x) = i and e(m) = −i, are nothing but Cayley hash functions if f 1 = f 2 .In such a case, we assume that H is the group of nth roots of unity for n > 1 fixed.
As an example of the setting posed in Remark 3. We assume n = 4, H = {1, −1, i, −i}, and s = {i = e(x), −i = e(m)}.Thus, up to permutation M e (B(2, 1), −x Figure 9 shows the Cayley graph defined in Remark 3. Labels of the arrows are given by the set s = {i, −i}, i.e., the arrow a b → c denotes the identity ab = c.

•
Consider the matrices A 0 = 2 1 0 1 and The associated linear function has the form L(x) = rx + s.

•
The hash value has the form (r + s, s).
According to Sosnovski [2], a binary text is associated with a directed path P in the Cayley graph generated by f 0 and f 1 (the initial vertex s(P) of P is given by the identity).Her algorithm hashes a string with a time complexity of at most 2n multiplications and 2n additions in F p .In Z p , each addition (multiplication) requires O(log p) (O(log 2 p)) bit operations.Thus, if p ≈ 2 m for m fixed, then the number of bit operations to evaluate a hash value of an n bit string is O(m 2 n).
The family of hash functions has the following properties: • Variable size input and fixed output size.

•
The Cayley graphs of the semigroup have relatively large girth.
In this paper, we compute the Sosnovski hash function to the Brauer messages To perform this, we apply the assignment In other words, we obtain specialized Brauer messages For i > 1, the Sosnovski-Brauer hash H(M i ) = h i of a matrix M i is recursively obtained by applying the following procedure: It is worth pointing out that the multiplication of two of these matrices takes O(2 2,3728596 ).Thus, constructing H i requires O(2 2,3728596(i+1) ) bit operations, which can be reduced by using Theorem 5 and Sosnovki [2] arguments regarding the complexity of her hash function.
The following algorithm allows obtaining any block B i j from the seeds B i−1 0 and B i 0 .Henceforth, all the products are assumed to be computed modulo a fixed prime number p.
Python gives the complexity and execution time of the algorithm proposed as O(2 n ) and 1.3 × (0.97) n seconds, respectively, if H i consists of n, 2 × 2 matrices, bearing in mind that choosing an orientation O (r,s) associated with a Brauer configuration B (r,s) at a point (r, s) has complexity O((( r+s s )) 2 ).Such an orientation gives the appropriate matrix multiplication sequence.For instance, for modulo 2 127 − 1, we have that The following Theorem 5 gives formulas for some Sosnovski hash functions associated with arbitrary products of the matrices A 0 , A 1 , and A 2 (all the operations are assumed to be computed modulo a fixed prime number p). Then, ) = (a 11 + a 12 + a 12 , a 12 + a 12 ), Proof.It suffices noting that for k ≥ 1: ), ). ( Remark 4. We recall that Cassaigne et al. [24] proved that if A = a 0 The following result proves that the Sosnovski function is collision-resistant for any Brauer message M i , i ≥ 1. Proof.The result holds as a direct consequence of the results described in Remark 4.

Experimental Data
This section gives some experimental results obtained by running Python routines in an Acer Predator Helios (intel core i7, 11th generation).We give execution times for Sosnovski and Tillich-Zémor hash values of Brauer messages associated with points in V = R * × R * .Figure 10 shows the number of bits of the compressed Brauer messages.Tables 2 and 3 give matrices H i , 1 ≤ i ≤ 3 (see Algorithms 4 and 5), which are hash values of Brauer messages in the sense of Tillich-Zémor (for x = 1) and Sosnovski, respectively.These tables also show the number of collisions between these messages for the prime numbers considered by Sosnovski for her experimental data.Routine 4 in the appendix gives these values for arbitrary prime numbers and any matrix H i .
Matrix A j h i −j is in the jth position of the block B i j,k .4.
Define B i j = B i j,1 B i j,2 . . .B i j,2 i mod p.
Algorithm 5: Building blocks B i j .1. Define For 1 ≤ j ≤ i, B i j is obtained by replacing any occurrence of A 1 ∈ B i 0 in positions {0, 1, 2, . . ., j} for A 2 .
Tables 4 and 5 give the execution time to compute Tillich-Zémor and Sosnovski hash values of the Brauer messages.Figure 10 shows how Brauer messages are compressed by Sosnovski hash values.Figure 11 shows a comparison between execution times to compute Sosnovski and Tillich-Zémor hash values of the Brauer messages h 3 , h 4 , and h 5 for prime numbers (2 127 − 1) to (2 257 − 1053) given in Tables 4 and 5.

Discussion
Brauer messages associated with regions without mutations are nothing but bit strings, so the Sosnovski algorithm can be applied to obtain their corresponding hash values without increasing the algorithm's execution time.On the other hand, the complexity of such an algorithm is exponential, and the execution time increases for Brauer messages associated with mutation regions.
Note that the hash values of Brauer messages associated with mutation regions obtained via Sosnovski matrices and their conjugates require fixing an orientation associated with a Brauer configuration B (r,s) at a point (r, s).To choose such an orientation O (r,s) has complexity O((( r+s s )) 2 ).

Concluding Remarks and Future Work
Brauer configuration algebras can be associated to each point (x, y) ∈ R * × R * .Their dimensions can be computed by using appropriated binomial numbers.The same computations allow giving formulas for their centers.It is worth pointing out that suitable specializations allow obtaining matrices with applications in several scientific fields.For instance, such matrices give solutions to linear and no-linear differential equation systems.The specialized matrices give rise to elements in appropriated semigroups, which we call Brauer messages.The Sosnovski hash values of these messages are collision-resistant for large enough prime numbers.However, the execution time for giving such hashes is exponential when applied to Brauer messages with mutations.

Future Work
The following investigations are interesting tasks to be addressed in the future.

1.
To introduce new classes of matrices defined by specializations of variables associated with general bounded regions.2.
To give explicit solutions for new classes of systems of differential equations by using specialized Brauer messages.3.
To investigate hash values of Brauer messages associated with more general groups and semigroups.For instance, there is no up-to-date hash function based on generators of any of the Thompson groups.These approaches would decrease the complexity and execution time when computing hash values of Brauer messages arising from mutation regions. [

Figure 1 .
Figure 1.This graph shows how the background relates to the main results presented in this paper.

Figure 3 .
Figure 3. Example of a Brauer quiver associated with a Brauer configuration B (r,s) .The symbol c x i

Figure 9 .
Figure 9. Example of a Cayley graph associated with the 4th unity roots, with s = {i, −i}.It is worth pointing out that Tillich and Zémor introduced hash functions associated with the special group Sl(2, R) with R = Z 2 [x]/(p(x)) ∼ = Z n 2 , where p(x) is an irreducible polynomial of degree n over Z 2 .A 0 = x 1 1 0 and A 1 = x x + 1 1 1 are the generators of the Tillich-Zémor hash function.In such a case, if M = m 1 m 2 . . .m k ∈ {0, 1} * , then the corresponding Tillich-Zémor hash function H : {0, 1} * → Sl(2, R) assigns the matrix product A m 1 A m 2 . . .A m k mod p(x), m i ∈ {0, 1} to the message M = m 1 m 2 . . .m k ∈ {0, 1} * .The Tillich-Zémor ideas were generalized by Sosnovski[2], who introduced the semigroup generated by the linear functions f 0 (x) = 2x + 1 and f 1 (x) = 3x + 1 over the field Z p with p > 3. Her algorithm (Algorithm 3) goes as follows: b ∈ Q\{−1, 0, 1}.Then, the semigroup generated by A and B is free if |a| + |b| ≤ 1.Additionally, there is a prime p for which ν p (a)andν p (b) > 0, where ν z is the p-adic value of the number z.Such a result proves that two words in the semigroup generated by matrices A = a b 0 c and B = a b 0 c are different if A and B do not commute.

Corollary 2 .
Let cll(h n ) be the number of collisions associated with the Sosnovski hash values of Brauer messages for a fixed positive integer n.Then, Lim n→∞ cll(h n ) = 0.

Figure 10 .
Figure 10.The specialized Brauer message given by a product of (i + 1)2 i .Sosnovski matrices are compressed by f (i) = 225.7621855345912+ 0.04323899371069182 bits.

Figure 11 .
Figure 11.Execution time of the Tillich-Zémor and Sosnovski hash values of the Brauer messages h 3 − h 5 .
• Elements of B 0 (B 1 ) are called vertices (polygons).Polygons are labeled multisets consisting of vertices.
• If V ∈ B 1 , then |V| > 1 (i.e., each polygon contains more than one vertex).• and µ(δ) > 1}.Let Λ B be the Brauer configuration algebra associated with a connected Brauer configuration B. The algebra Λ B has a length grading induced from the path algebra FQ if and only if there is an N ∈ Z >0 such that for each nontruncated vertex δ

Table 1 .
Specialized messages of type M e (B((r, s), y

Table 2 .
Matrices H i , 1 ≤ i ≤ 3 give Tillich-Zémor hash values of Brauer messages M i .

Table 3 .
Matrices H i , 1 ≤ i ≤ 3 are used to compute hash values h i (see Algorithm 4).

Table 4 .
Execution time to compute Tillich-Zémor hash values of Brauer messages.

Table 5 .
Execution time to compute Sosnovski hash values of Brauer messsages.