A Parallel Approach in Computing Correlation Immunity up to Six Variables

DOI10.1142/S0129054116500131zbMath1401.94153MaRDI QIDQ3186055

Carole J. Etherington, Eric Bach, Pantelimon Stănică, Jon T. Butler, Matthew W. Anderson

Publication date: 8 August 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

symmetric functionsreconfigurable computingcorrelation immunityrotation symmetric functionscryptographic Boolean functions

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (1)

Baby-step giant-step algorithms for the symmetric group

Cites Work

• Balancing the \(n\)-cube: A census of colorings
• On ``bent functions
• Asymptotic enumeration of correlation-immune Boolean functions
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Improved Asymptotic Formulas for Counting Correlation Immune Boolean Functions
• An asymptotic formula for the number of correlation-immune of order k Boolean functions
• Bounds on orthogonal arrays and resilient functions
• A local limit theorem for the distribution of a part of the spectrum of a random binary function
• Equivalence Classes of Boolean Functions for First-Order Correlation

This page was built for publication: A Parallel Approach in Computing Correlation Immunity up to Six Variables