Strong external difference families in abelian and non-abelian groups
Abstract
Strong external difference families (SEDFs) have applications to cryptography and are rich combinatorial structures in their own right. We extend the definition of SEDF from abelian groups to all finite groups, and introduce the concept of equivalence. We prove new recursive constructions for SEDFs and generalized SEDFs (GSEDFs) in cyclic groups, and present the first family of non-abelian SEDFs. We prove there exist at least two non-equivalent (k2 + 1,2,k,1)-SEDFs for every k > 2, and begin the task of enumerating SEDFs, via a computational approach which yields complete results for all groups up to order 24.
Citation
Huczynska , S , Jefferson , C & Nepšinská , S 2021 , ' Strong external difference families in abelian and non-abelian groups ' , Cryptography and Communications , vol. 13 , no. 2 , pp. 331–341 . https://doi.org/10.1007/s12095-021-00473-3
Publication
Cryptography and Communications
Status
Peer reviewed
ISSN
1936-2447Type
Journal article
Description
The second author is supported by a Royal Society University Research Fellowship.Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.