A Discussion of a Cryptographical Scheme Based in F-Critical Sets of a Latin Square

This communication provides a discussion of a scheme originally proposed by Falcón in a paper entitled “Latin squares associated to principal autotopisms of long cycles. Applications in cryptography”. Falcón outlines the protocol for a cryptographical scheme that uses the F-critical sets associated with a particular Latin square to generate access levels for participants of the scheme. Accompanying the scheme is an example, which applies the protocol to a particular Latin square of order six. Exploration of the example itself, revealed some interesting observations about both the structure of the Latin square itself and the autotopisms associated with the Latin square. These observations give rise to necessary conditions for the generation of the F-critical sets associated with certain autotopisms of the given Latin square. The communication culminates with a table which outlines the various access levels for the given Latin square in accordance with the scheme detailed by Falcón.


Introduction and Preliminaries
A Latin square of order n is an n×n array comprising of n distinct elements, such that each element occurs exactly once in each row and column [1,2]. A partial Latin square is an n×n array with all entries of the array belonging to the set {0,1,. . .,n − 1}. There can be blank entries within a partial Latin square, but each element of the set {0,1,. . .,n − 1} must only occur once in each row and column [3]. Partial Latin squares can be considered substructures of Latin squares, as such; a partial Latin square can be completed to form a Latin square by replacing the blank entries of the partial Latin square with elements of the set {0,1,. . .,n − 1} in such a way that each element in the set only occurs once in each row and column [3]. A partial Latin square is said to be uniquely completable if it only has one possible completion [3]. We consider two mechanisms by which a partial Latin square P can be (uniquely) completed to a Latin square L. A triple (i, j; k) ∈ P denotes an entry within a partial Latin square such that i is the row component, j is the column component and k denotes the symbol in the cell (i, j). A triple (i, j; k) in a partial Latin square P is forced if the cell (i, j) is the only empty cell in either the i th row or j th column and the symbol k is the only symbol not appearing in the respective row or column. Similarly a triple is forced if the symbol k appears in every row and column of L except the i th row and j th column [4].
The second mechanism considered is applying autotopisms to the set of triples of a partial Latin square P to generate a Latin square L, on occasion this may additionally require the application of forced moves. Before defining an autotopism, it is important to define the notion of a quasigroup; a set S is a quasigroup if there exists a binary operator * such that ∀a, b ∈ S a * x = b and y * a = b have exactly one solution. The multiplication table of a quasigroup forms a Latin square [1,2]. An autotopism is formally defined [1,2,5]; Definition 1. Let (B, ·) and (C, * ) be two quasigroups. An isotopism is an ordered triple of row, column and symbol permutations, θ=(α, β, γ) that maps (B, ·) onto (C, * ), providing that ∀i, j ∈ B, i, j denote a pair of row and column coordinates (α(i)) * (β(j)) = γ(i·j). An autotopism is an isotopism that maps a quasigroup onto itself.
Let Atop(L) denote the set of all autotopisms associated with a Latin square L. Atop(L) constitutes a group under the composition of permutations; this is know as the autotopism group of L [4]. As stated in [4], each autotopism θ = (α, β, γ) ∈ Atop(L) generates a subgroup of Atop(L), denoted θ . This may be extended to the set generated by θ 1 , .., θ q ∈ Atop(L), which will also form a subgroup of Atop(L), denoted θ 1 , . . . , θ p .
As in [4], let Ent(P) denote the set of non-empty cells of a partial Latin square P. Further, [4] defines the θ-orbit of a triple (i, j; k) ∈ Ent(L), for some autotopism θ = (α, β, γ) ∈ Atop(L), as the set This idea can be extended to F-orbits [4]. For a collection of autotopisms F ⊆ Atop(L), the F-orbit of a triple (i, j; k) ∈ Ent(L) is the set We are interested in using F-orbits to determine F-critical sets. A critical set is formally defined [5]: L is the only Latin square of order n which has the symbol k in the cell (i, j) for each (i, j; k) ∈ C.

2.
No proper subset of C has property 1.
Furthermore, we define a partial Latin square P to be F-completable to a Latin square L, with F ⊆ Atop(P), if there exists a partial Latin square Q that is completable to L such that; We can say that P is uniquely F-completable if L is unique, and moreover, P is an F-critical set of the Latin square L if no proper subset of Ent(P) is F-completable to L [4].
The paper by Falcón [6], on which this communication is based, looks at building a secret sharing scheme using F-critical sets.
A secret sharing scheme is a cryptographical scheme in which k participants are each given a part of a secret key K, called a share [7]. In secret sharing schemes, certain shares may be combined to generate the original secret key K. These are referred to as authorised groups. All unauthorised groups will be unable to recover the secret key K [6]. The access structure Γ defines the set of authorised groups of shares [6]. Throughout this communication, the term access level will be used to refer to each minimal authorised group.
A previous secret sharing scheme based on critical sets in Latin squares was proposed by Cooper et al [8]. In this secret sharing scheme, a particular Latin square K of order n is chosen as the secret key. The k shares distributed to participants in this scheme are triples of Ent(K). The access structure for this scheme is the set Γ = {S | Ent(C) ⊆ Ent(S) ⊆ Ent(K), where C is a critical set of K}.
The scheme proposed by Falcón, seeks to extend the scheme proposed by Cooper et al. to F-critical sets of Latin squares. The secret key for the scheme proposed in [6] is also a Latin square K. However, in this scheme there are two types of shares that may be distributed to the k participants of the scheme; a group of the shares will be autotopisms θ ∈ F, such that F ⊆ Atop(K) and the remaining shares will be triples T i ∈ Ent(K). Formally, the access structure for the scheme is then the set Γ = {S | Ent(C) ⊆ Ent(S) ⊆ Ent(K), where C is an F-critical set of K}.
Below, an overview of the scheme proposed in [6] is given: Overview of the secret sharing scheme: • A Latin Square K of order n is selected as the key for the scheme. The order n of the Latin Square K is made public, whilst K is kept private. • A set of T triples, where Ent(T) ⊂ Ent(K) is selected, along with a collection of F autotopisms associated with K.

•
The triples of Ent(T) and autotopisms in F associated with K are distributed to the k participants in the secret sharing scheme in such a way that when a group of t participants come together, the union of whose shares form an F-critical set of K. They are thus able to combine their shares in order to find the key K.
In [6], Falcón provides an example to accompany the scheme, which demonstrates how the secret sharing scheme may be applied to a particular Latin square of order 6. The example is detailed below. The k participants in the scheme will be assigned autotopisms belonging to F and triples belonging to a partial Latin square T, where Ent(T) ⊂ Ent(K). In this example, the set F consists of the four autotopisms F={θ 1 ,θ 2 ,θ 3 ,θ 4 } associated with the Latin square K. These are defined; The autotopisms and T triples are assigned to participants within the scheme in accordance with Table 1, where Table 1 provides examples of access levels for the autotopisms and T triples given in Example 1. Note that m in Table 1 denotes the number of shares within each access level. There has also been a change in notation from the original example in [6]; the notation . . . has been used in Table 1 in place of the notation {. . . }. This is to highlight more clearly that the autotopisms in each access level will generate a subgroup of Atop(K). To give an example of how these access levels work; take the set of shares θ 3 and T\{T 1 , T 11 }. Table 1, shown above, states that the union of F-orbits for each triple in the set T\{T 1 , T 11 }, should form an F-critical set, when F is the subgroup of autotopisms generated by θ 3 . The autotopisms within this subgroup are; This subgroup of Atop(K) will generate the following F-orbits for the shares T\{T 1 , T 11 }; Let q 1 =Ent(Q 1 ) be a partial Latin square, where; Observe that the partial Latin square q 1 is uniquely completable, hence applying the subgroup of Atop(K) generated by θ 3 to the set of triples T\{T 1 , T 11 } will give a uniquely F-completable set. Notice that the removal of any F-orbit of Ent(Q 1 ) will generate a partial Latin square q 1 =Ent(Q 1 ) that is not uniquely completable to K. This demonstrates that F-orbits of T\{T 1 , T 11 } under the autotopism θ 3 form an F-critical set. As the set is a minimal collection of shares that combine to generate the secret key K, it is an access level for the scheme.

Interesting Observations about Uniquely Completable Partial Latin Squares and the Applications of These Observations to the Example
The Applications of These Observations to the Example in [6], In this section, we will consider further substructures of Latin squares and demonstrate how the existence of these substructures within a Latin square L informs how the F-critical sets of L may be constructed.

Definition 3. [9]
A Latin subsquare of a Latin square is an m × m submatrix of (not necessarily adjacent) entries that is itself a Latin square. Note that a Latin subsquare has order at least 2. Definition 4. [9] An intercalate of order 2 is a Latin subsquare of order 2.

Example 2.
Observe that the four quadrants of the Latin square K given in the example in [6] form four Latin subsquares of order 3, which will form a set S = {S (0,0) , Proof. Let L be a Latin square of order n ≥ 2. Removing the triple (i, j; k) from L will generate a partial Latin square P in which the cell (i, j) is empty, but all other cells within P are non-empty. Hence, P is a uniquely completable to the Latin square L and P ⊂ L.
The empty partial Latin square P of order n ≥ 2 is not uniquely completable to any Latin square of order n.
Therefore, every Latin square L of order n contains a non-empty partial Latin square P that is uniquely completable to L and a partial Latin square that is not uniquely completable to L. Therefore, there exists a minimal partial Latin square P * that is uniquely completable to L, such that every subset of P * is not uniquely completable to L. Hence, every Latin square of order n ≥ 2 contains a critical set.

Corollary 1.
For each Latin subsquare Q of order m ≥ 2 there exists a partial Latin square A such that A is not uniquely completable to Q.

Proof.
A Latin subsquare Q is a Latin square of order m within a Latin square of order n. By Lemma 1, as Q has order m ≥ 2, it has a critical set and hence there will be some partial Latin square A such that A is not uniquely completable to Q. Lemma 2. Let Q be a Latin subsquare of order m ≥ 2 contained within a Latin square L and let A be a partial Latin square that is not uniquely completable to the Latin subsquare Q. If a partial Latin square P contains A and no other elements of Ent(Q), then P will not be uniquely completable to L.
Proof. By Corollary 1, every Latin subsquare Q of order m, where |m| ≥ 2, contains a partial Latin square A, where A is not uniquely completable to Q. Note, when Q is an intercalate, A is the empty partial Latin square. Let P denote a partial Latin square, such that P ⊂ L. If a partial Latin square P contains A and no other triples in Ent(Q), then the partial Latin square P will not force the entries of the Latin subsquare Q. As Q ⊂ L and the triples of Q are not forced from the triples of P, then P is not uniquely completable to L.
Although Lemma 2 does not imply that a partial Latin square P will always be uniquely completable to a Latin square L if it contains a critical set of each Latin subsquare Q ∈ L, it does imply that if this condition is not met, then P will not be uniquely completable to L.
To relate this to F-critical sets in the example in [6]; if the F-orbits for some partial Latin square P do not intersect with the critical sets of each Latin subsquare within S (i,j) , I (i,j) ∈ K, then the partial Latin square P will not be an F-critical set of K. Example 3 details the more specific implications of Lemma 2 to the example in [6].

Example 3.
In [4], it was demonstrated that the critical sets of Latin squares of order 3 either consist of two triples (i 1 , j 1 ; k 1 ) and (i 2 , j 2 ; k 2 ), where i 1 = i 2 , j 1 = j 2 and k 1 = k 2 , or a critical set of a Latin square of order 3 consists of a set of three triples such that each pair of triples in this set share exactly one common i th , j th or k th component. The key observation here is that critical sets of Latin squares of order 3 must contain entries in at least two distinct rows, two distinct columns and the critical sets contain two sets of distinct symbols. By Lemma 2, a partial Latin square P is not uniquely completable to the Latin square K if it does not contain a critical set of each Latin subsquare in K. This implies that if a partial Latin square P does not contain an entry in at least two distinct rows and columns of each order 3 Latin subsquare S i,j ∈ K, or if each of the Latin subsquare S i,j in P does not contain at least two distinct symbols, then P will not be uniquely completable to K.
Furthermore, the Latin square K contains nine intercalates, each denoted by I (i,j) for i, j ≤ 2. Since order 2 Latin squares have a critical set of size 1, if a partial Latin square does not contain at least one entry in each intercalate I (i,j) ∈ K, then P will not be uniquely completable to K.

Interesting Observations about the Autotopisms θ 1 ,θ 2 ,θ 3 and θ 4 in the Example
Interesting Observations about the Autotopisms θ 1 ,θ 2 ,θ 3 and θ 4 in the Example in [6]. Each individual autotopism θ ⊆ Atop(L) for some Latin square L will act differently on the triples of L. The actions of individual autotopisms on a Latin square L is important in determining the structure of F-critical sets of L. It is therefore worth examining the actions of the individual autotopisms θ 1 ,θ 2 ,θ 3 ,θ 4 ⊆ Atop(K), where K is the Latin square in example [6], to determine the structure of each F-critical set associated with each subgroup of autotopisms in the group Atop(K).

Example 4.
The autotopisms θ 1 and θ 2 permute the elements of some Latin subsquare of order 3 S i ∈ S to two other triples within the same Latin subsquare S (i,j) . Both θ 1 and θ 2 map each triple T in some intercalate I (i,j) to some intercalate I (i ,j ) , where I (i,j) = I (i ,j ) .
The autotopisms θ 3 and θ 4 permute the sets {0,3}, {1,4} and {2,5}. They map triples of an intercalate I (i,j) to another triple within the same intercalate, and map triples in a particular Latin subsquare S (i,j) of order three to some Latin subsquare S (i ,j ) of order three, where i = i and j = j .

Discussion of Example
Ref [6]. Not all autotopisms listed in example [6] are members of the autotopism group Atop(K). Further to this, there are some minor errors in the access levels listed in Table 1 in Section 1. Lemma 2 and the observations about the autotopisms discussed in Section 3, make it possible to modify to the example. Each amendment will be discussed in detail within this section.

Discussion
Regarding the Autotopisms θ 1 and θ 2 Discussion Regarding the Autotopisms θ 1 and θ 2 in [6]. The first two modifications are changes to some of the autotopisms associated with the Latin square K in [6]. Two of the autotopisms, θ 1 and θ 2 , are not associated with the Latin square K. By definition, applying an autotopism to a Latin square that it is associated with should generate another element of that Latin square. However, applying the autotopisms θ 1 and θ 2 to any of the 11 chosen shares from the set {T 1 ,...,T 11 } does not generate another element of K. To demonstrate this, θ 1 and θ 2 are applied to the share T 1 ; Observe, applying θ 1 and θ 2 to T 1 does not generate elements of the original Latin square, L. Hence, these autotopisms are not associated with Atop(K). It is believed that the intended autotopisms for θ 1 and θ 2 should be; From this point in the communication, when θ 1 and θ 2 are referred to, they refer to the autotopisms θ 1 and θ 2 given above and not the autotopisms given in [6].
All subsequent suggested amendments focus on the access levels.

Discussion
Regarding the Access Level for the Autotopisms in the Subgroup θ 4 Discussion Regarding the Access Level for the Autotopisms in the Subgroup θ 4 in [6]. The access level generated by the autotopism subgroup θ 4 was mis-recorded in [6]. According to the example in [6], combining the subgroup of Atop(K), θ 4 , with all triples in the set T\{T 9 } should generate a uniquely completable partial Latin square. However, combining θ 4 with the stated triples generates the following F-orbits; The union of these F-orbits gives the partial Latin square P 1 , where; P 1 = * 1 * * 4 * * 2 0 * 5 3 * 0 1 * 3 4 3 4 5 0 1 2 * * * * * * 5 * 4 2 * 1 This partial Latin square P 1 is not uniquely completable as it only uniquely completes to the partial Latin square P 2 , where; Since there are no entries in the intercalate I (1,0) , by Lemma 2, P 2 is not uniquely completable to L. In order for the partial Latin square P 1 to be uniquely completable to L, the share T 9 needs to be included within this access level so that there is an entry in the intercalate I (1,0) .
It is also worth noting that F-critical sets are supposed to be minimal. As T 1 and T 6 are both members of the intercalate I (0,1) and similarly T 4 and T 11 both belong to the intercalate I (2,2) , this set is not minimal. By removing one element of each set {T 1 , T 6 } and {T 4 , T 11 }, the access level becomes an F-critical set comprising of nine triples from the set T and the autotopism θ 4 ; giving ten individual shares in total. An example of a viable F-critical set is to take the F-orbits of the triples {T 1 , T 2 , T 3 , T 4 , T 5 , T 7 , T 8 , T 9 , T 10 }, where F is the subgroup of Atop(K) generated by the autotopism θ 4 .

Discussion
Regarding the Access Level for the Autotopisms in the Subgroup θ 3 , θ 4 Discussion Regarding the Access Level for the Autotopisms in the Subgroup θ 3 , θ 4 in [6]. Access levels can also be generated by F-orbits, where F is a subgroup of the Atop(K) generated by more than one autotopism. The first access level to be generated by a set of multiple autotopisms, is the access level generated by the F-orbits of the subgroup of autotopisms θ 3 , θ 4 . This subgroup consists of the following non-trivial autotopisms; The example in [6] (see Table 1 in Section 1) suggests that applying this subgroup of Atop(K) to the set of triples {T 2 ,T 3 ,T 4 ,T 5 ,T 6 ,T 7 ,T 8 ,T 10 } will generate an F-critical set. However, when F is the subgroup of Atop(K) generated by θ 3 , θ 4 , the F-orbits of the set of triples {T 2 ,T 3 ,T 4 ,T 5 ,T 6 ,T 7 ,T 8 ,T 10 } forms a partial Latin square that is not uniquely completable, as the F-orbits do not contain an entry in the intercalate I (1,0) . As above, if the triple T 9 is included within the set of triples for this access level, then the resultant partial Latin square is uniquely completable to the Latin square K. However, adding T 9 to this set means that this access level consists of nine triples from the set T and both autotopisms θ 3 and θ 4 . This gives a total of eleven shares. As previously shown, the F-orbits of the triples {T 2 ,T 3 ,T 4 ,T 5 ,T 6 ,T 7 ,T 8 ,T 9 ,T 10 } under the subgroup of Atop(K), θ 4 , form an F-critical set of size 10. Hence, the autotopisms θ 3 , θ 4 will generate a uniquely F-completable set that is not minimal, and therefore not an F-critical set. Therefore, the autotopisms θ 3 and θ 4 cannot be used in combination to generate an access level for this scheme.
There are multiple F-critical sets that may be formed using this subgroup of Atop(K). As discussed in Section 3, each autotopism within the autotopism group Atop(K) has a unique action. When multiple autotopisms are combined in an F-critical set, each autotopism generated by the union of any subgroup of autotopisms will also take on a unique action. Observe that in combination, the subgroup of Atop(K) generated by autotopisms θ 3 , θ 4 takes a triple T i ∈ I (i,j) and maps it to every other triple within the same intercalate. The autotopism subgroup generated by θ 2 maps each T i = (i , j ; k ) ∈ S (i,j) to all other triples in the i th row of the Latin subsquare S (i,j) . This means that the combined action of the autotopism subgroup generated by θ 2 , θ 3 , θ 4 takes a triple T i ∈ K and maps T i = (i , j ; k ) to all triples in i th and i + 3 mod 6 row of K. Hence, any F-critical set under the subgroup of autotopisms θ 2 , θ 3 , θ 4 must contain 3 triples, with one triple in either the 0 th or 3 rd row, one triple in either the 1 st or 4 th row and finally one triple in either the 2 nd or 5 th row. This ensures that the F-orbits contain a critical set of each intercalate I (i,j) and each Latin subsquare S (i,j) . Therefore, exactly one entry must be chosen from each of the following three sets; {T 1 ,T 6 ,T 7 ,T 8 }, {T 2 ,T 3 ,T 9 } and {T 4 ,T 5 ,T 10 ,T 11 }, as each individual set contains all entries of the i th and i + 3 th rows, where i ≤ 2.

Discussion
Regarding the Access Level for for the Autotopisms in the Subgroup θ 1 , θ 2 , θ 4 Discussion Regarding the Access Level for for the Autotopisms in the Subgroup θ 1 , θ 2 , θ 4 in [6]. This access level uses the subgroup of Atop(K) generated by θ 1 , θ 2 , θ 4 . As θ 1 and θ 2 are both autotopisms based upon length 3 cycles, and θ 4 is an autotopism based upon length 2 cycle; this subgroup of Atop(K) will consist of 17 non-trivial autotopisms. Example 4 states that autotopism θ 1 maps a triple T i ∈ S (i,j) , where T i = (i, j; k) to the other two triples in the i th row of the Latin subsquare S (i,j) ∈ S, while the autotopism θ 2 maps each triple T i ∈ S (i,j) to the other two triples in the j th column of the Latin subsquare S (i,j) ∈ S and the autotopism θ 4 maps a triple T i ∈ I (i,j) , where I (i,j) ∈ I, to the triple I (i,j+3) mod 6. This means that the subgroup of autotopisms generated by θ 1 , θ 2 and θ 4 will map a triple T i ∈ S (i,j) , for S (i,j) ∈ S to all other triples in the Latin subsquare S (i,j) , as well as all triples in the Latin subsquare S (i,j+3) mod 6 ∈ S The access level in the example in [6] suggests that this subgroup of Atop(K) should be combined with the triples {T 1 ,T 2 } and from here it should be possible to generate the Latin square L. However, when F is generated by θ 1 , θ 2 , θ 4 , Orb F (T 1 ) ∪ Orb F (T 2 ) is the partial Latin square P 4 , where: P 4 = 0 1 2 3 4 5 1 2 0 4 5 3 2 0 1 5 3 4 * * * * * * * * * * * * * * * * * * The entries of the Latin subsquares S (3,0) and S (3,3) are missing from the partial Latin square P 4 , hence by Lemma 2, P 4 is not uniquely completable to K. To amend this access level, either T 1 or T 2 should be removed and replaced with a triple from the set {T 6 , T 7 , T 8 , T 9 , T 10 , T 11 }.
There are multiple pairs of F-orbits that constitute an F-critical set when F is the subgroup of Atop(K) generated by θ 1 , θ 2 , θ 4 . As an F-orbit of a triple T i under these autotopisms will span two adjacent Latin subsquares S (i,j) and S (i,j+3) mod 6, when T i ∈ S (i,j) each F-orbit contains a critical set of each intercalate I (i,j) ∈ I. Therefore, a second F-orbit is only required to ensure that the union of F-orbits contains a critical set of the Latin subsquares S (i+3,j) mod 6 and S (i+3,j+3) mod 6. Hence, any two triples T i , T j ∈ T, where T i = T j will generate an F-critical set under the autotopisms θ 1 ,θ 2 and θ 4 providing that if T i is a triple in some Latin subsquare S (i,j) ∈ S, then the triple T j is either in the Latin subsquare S (i+3,j) or the Latin subsquare S (i+3,j+3) . All triples in the set {T 1 , T 2 , T 3 , T 4 , T 5 } belong either to the Latin subsquare S (0,0) or the Latin subsquare S (0, 3) , while triples in the set {T 6 , T 7 , T 8 , T 9 , T 10 , T 11 } belong either to the Latin subsquare S (3,0) or the Latin subsquare S (3,3) . Therefore, if T i ∈ {T 1 , T 2 , T 3 , T 4 , T 5 } and T j ∈ {T 6 , T 7 , T 8 , T 9 , T 10 , T 11 } then the union of the F-orbits Orb F (T i ) ∪ Orb F (T j ) will be an F-critical set, when F is generated by θ 1 , θ 2 , θ 4 . 4.6. Discussion Regarding the Access Level for the Autotopisms in the Subgroup θ 1 , θ 3 Discussion Regarding the Access Level for the Autotopisms in the Subgroup θ 1 , θ 3 in [6]. Whereas other access levels given in the example in [6] contain too little information, the access level specified for the subgroup of Atop(K) generated by θ 1 , θ 3 gives too much information.
The subgroup θ 1 , θ 3 consists of 5 non-trivial autotopisms, these are autotopisms denoted by; θ 1 , θ 1 θ 1 , θ 3 , θ 1 θ 3 and θ 1 θ 1 θ 3 . The example suggests that the F-orbits, where F is generated θ 1 , θ 3 , for the triples {T 2 ,T 3 ,T 4 ,T 6 ,T 9 } should be an F-critical set. However, the union F-orbits of these triples is the partial Latin square P 5 , where; Observe that P 5 is uniquely completable to L, however, access levels are supposed to provide the minimal amount of information required to generate the original key. Note that if either one of the shares T 3 or T 6 were to be removed from this access level, then one is still able to generate a uniquely F-completable partial Latin square, hence the specified set of triples is not an F-critical set when F is generated by θ 1 , θ 3 . To amend this, each access level should be defined in such a way that only one triple from the set {T 3 , T 6 } is included.

Summary of Findings
The above subsections discuss amendments to particular errors in the example in [6]. Following this, it is possible to generalise sets of triples of T that can be combined with each possible subgroup of the autotopism group Atop(K) generated by some collection of the autotopisms θ 1 , θ 2 , θ 3 and θ 4 . Using the results discussed in Sections 2 and 3, it is possible to generalise combinations of triples that form F-critical sets under the subgroups of Atop(K) defined by the autotopisms θ 1 , θ 2 , θ 3 and θ 4 . Table A1 in Appendix A details the combinations of triples that will generate a F-critical set when combined with the autotopisms stated in the same row of the table. Reasoning behind the constructions of certain F-critical sets in Table A1 in Appendix A is outlined in Section 4. Table A2 in Appendix A provides an example of an F-critical set for each subgroup of autotopisms generated by elements of the set {θ 1 , θ 2 , θ 3 , θ 4 }.

Conclusions
In this correspondence, minor errors in the original definitions of the F-critical sets detailed within the paper [6] are amended. The importance of Lemma 2 in determining both critical sets and F-critical sets within a Latin square is highlighted.
Lemma 2 states that if a partial Latin square P does not contain a critical set for each Latin subsquare Q ∈ L, where L is a Latin square, P is not be uniquely completable to L. Further, let a partial Latin square P ⊂ L, where L is a Latin square and let F denote a subgroup of the autotopism group of L. If the F-orbits of a partial Latin square P, do not contain a critical set for each Latin subsquare Q ∈ L, then the combination of these triples and autotopisms do not form an F-critical set. Lemma 2 can therefore be used to eliminate several partial Latin squares that are not F-critical sets of a Latin square L.
If a partial Latin square P satisfies Lemma 2, this does not guarantee that P is uniquely completable to a Latin square L; however, Lemma 2 does provide a necessary condition, that if not met, means a partial Latin square P is not uniquely completable. Lemma 2 can then be applied to all partial Latin squares P of order n. In other words, by looking at all Latin subsquares of order m within a Latin square L of order n, where m < n, one can ascertain the critical sets of each Latin subsquare Q within L. Each partial Latin square P that is uniquely completable to L then contains some combination of critical sets of Latin subsquares of L, hence by determining the Latin subsquares of L, the problem of generating the critical sets of L is reduced in size. This approach may similarly be applied to θ-critical sets or F-critical sets.
Further work is needed to determine necessary conditions for ensuring that a partial Latin square P is a critical set of a Latin square L, but by the application of Lemma 2, it may be possible for larger Latin squares of order n to be analysed.   Table A1 details the newly defined access levels, generated by results in this communication. Note that m the number of individual shares in each access level. Observe, that the access level defined by the autotopisms θ 3 , θ 4 has been removed from Table A1, as it is shown that these autotopisms cannot form an F-critical set. Table A2 gives specific examples of F-critical sets for the Latin square K under the autotopisms {θ 1 , θ 2 , θ 3 , θ 4 }. Each F-critical set is constructed in accordance with the specifications of Table A1.