Some highly symmetric authentication perpendicular arrays
A set S of permutations of k objects is μ-uniform, t-homogeneous if for every pair A, B of t-subsets of the ground set, there are exactly μ permutations in S mapping A onto B. Arithmetical conditions and symmetries are discussed. We describe the character-theoretic method which is useful if S is con...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
1991
|
| In: |
Designs, codes and cryptography
Year: 1991, Volume: 1, Issue: 4, Pages: 307-319 |
| ISSN: | 1573-7586 |
| DOI: | 10.1007/BF00124606 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1007/BF00124606
|
| Author Notes: | Jürgen Bierbrauer, Tran Van Trung |
| Summary: | A set S of permutations of k objects is μ-uniform, t-homogeneous if for every pair A, B of t-subsets of the ground set, there are exactly μ permutations in S mapping A onto B. Arithmetical conditions and symmetries are discussed. We describe the character-theoretic method which is useful if S is contained in a permutation group. A main result is the construction of a 2-uniform, 2-homogeneous set of permutations on 6 objects and of a 3-uniform, 3-homogeneous set of permutations on 9 objects. These are contained in the simple permutation groups PSL2(5) and PSL2(8), respectively. The result is useful in the framework of theoretical secrecy and authentication (see Stinson 1990, Bierbrauer and Tran 1991). |
|---|---|
| Item Description: | Gesehen am 26.06.2023 |
| Physical Description: | Online Resource |
| ISSN: | 1573-7586 |
| DOI: | 10.1007/BF00124606 |