加载中…
A complete mapping of a finite group is a permutation of such that is also a permutation of . Complete mappings have applications in cryptography, particularly in the design of round functions for cryptographic systems. The study of their parity has led to the question of which finite groups admit complete mappings of both parities. A useful approach to this question is to construct complete mappings stabilizing suitable subgroups, in particular Sylow -subgroups. We show that, for every , every prime power , and every , the group admits a complete mapping stabilizing a Sylow -subgroup if and only if .

生成讲解博客的中文版本

生成AI智能校验的中文版本