A constructive count of rotation symmetric functions

Information Processing Letters（2003）

引用 39|浏览0

暂无评分

摘要

In this paper we present a constructive detection of minimal monomials in the algebraic normal form of rotation symmetric Boolean functions (immune to circular translation of indices). This helps in constructing rotation symmetric Boolean functions by respecting the rules we present here.

查看译文

关键词

Cryptography,Rotation symmetric Boolean functions,Algebraic normal form,Combinatorial problems

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要