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.
Caranti, A., & Dalla Volta, F. (2006). The round functions of cryptosystem PGM generate the symmetric group. DESIGNS, CODES AND CRYPTOGRAPHY, 38(1), 147-155 [10.1007/s10623-005-5667-z].
Citazione: | Caranti, A., & Dalla Volta, F. (2006). The round functions of cryptosystem PGM generate the symmetric group. DESIGNS, CODES AND CRYPTOGRAPHY, 38(1), 147-155 [10.1007/s10623-005-5667-z]. | |
Tipo: | Articolo in rivista - Articolo scientifico | |
Carattere della pubblicazione: | Scientifica | |
Titolo: | The round functions of cryptosystem PGM generate the symmetric group | |
Autori: | Caranti, A; Dalla Volta, F | |
Autori: | ||
Data di pubblicazione: | gen-2006 | |
Lingua: | English | |
Rivista: | DESIGNS, CODES AND CRYPTOGRAPHY | |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/s10623-005-5667-z | |
Appare nelle tipologie: | 01 - Articolo su rivista |