The round functions of cryptosystem PGM generate the symmetric group

From MaRDI portal
Publication:2491264



Abstract: S. S. Magliveras et al. have described symmetric and public key cryptosystems based on logarithmic signatures (also known as group bases) for finite permutation groups. In this paper we show that if G is a nontrivial finite group which is not cyclic of order a prime, or the square of a prime, then the round (or encryption) functions of these systems, that are the permutations of G induced by the exact-transversal logarithmic signatures (also known as transversal group bases), generate the full symmetric group on G. This answers a question of S. S. Magliveras, D.R. Stinson and Tran van Trung.












This page was built for publication: The round functions of cryptosystem PGM generate the symmetric group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491264)