conference paper
Progress in Cryptology – AFRICACRYPT 2018
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRThis paper shows that a Boolean function f is s-plateaued if and only if the associated Cayley graph is a complete bipartite graph between the support of f and its complement (hence the graph is strongly regular of parameters e = 0, d = 2(n+s−2)/2). (Semantic Scholar)