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

The authors construct a set \(S\) of permutations in \(\mathrm{PGL}(2, q)\), \(q\) an odd power of 2, with the property that for every two pairs of points of the projective line \(\mathrm{PG}(1, q)\) there are precisely \(q-1\) permutations from \(S\) that map one of the pairs into the other. This has an interesting application for the construction of perfect 2-fold secrecy cryptocodes in the sense of \textit{D. R. Stinson} [J. Cryptology 2, No. 1, 23--49 (1990; Zbl 0701.94006)].