Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes

DOI10.1007/BF00157618zbMath0824.05014MaRDI QIDQ1182412

Tran van Trung, Juergen Bierbrauer

Publication date: 28 June 1992

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

permutationsfinite permutation groupsprojective lineperfect 2-fold secrecy cryptocodes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60) Combinatorial aspects of finite geometries (05B25) Finite geometry and special incidence structures (51E99) Permutation groups (20B99)

Related Items (6)

Some highly symmetric authentication perpendicular arrays ⋮ Monotypical uniformly homogeneous sets of permutations ⋮ Large sets with multiplicity ⋮ The uniformly 3-homogeneous subsets of PGL\((2,q)\) ⋮ On the construction of authentication and secrecy codes ⋮ Halving \(\text{PSL}(2,q)\)

Cites Work

• A construction for authentication/secrecy codes from 3-homogeneous permutation groups
• The combinatorics of authentication and secrecy codes
• Some highly symmetric authentication perpendicular arrays

This page was built for publication: Halving \(\mathrm{PGL}(2,2^f)\), \(f\) odd: a series of cryptocodes