Results on rotation symmetric polynomials over \(GF(p)\)

DOI10.1016/j.ins.2007.03.031zbMath1154.94009OpenAlexW2087025247MaRDI QIDQ2465983

Yuan Li

Publication date: 11 January 2008

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2007.03.031

zbMATH Keywords

Möbius functionfinite fieldscryptographypolynomialsBoolean functionEuler functionrotation symmetryprinciple of inclusion and exclusion

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Boolean functions (06E30)

Related Items (5)

Constructing 1-resilient rotation symmetric functions over \(\mathbb{F}_p\) with \(q\) variables through special orthogonal arrays ⋮ Transitive q-Ary Functions over Finite Fields or Finite Sets: Counts, Properties and Applications ⋮ On the number of rotation symmetric functions over \(\mathrm{GF}(p)\) ⋮ Counting rotation symmetric functions using Polya's theorem ⋮ Enumeration of Homogeneous Rotation Symmetric Functions over F p

Cites Work

• Unnamed Item
• A constructive count of rotation symmetric functions
• Generalized bent functions and their properties
• Rotation Symmetric Boolean Functions –; Count and Cryptographic Properties
• Resilient functions over finite fields
• Fast Software Encryption

This page was built for publication: Results on rotation symmetric polynomials over \(GF(p)\)