Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography

DOI10.1023/A:1008337029047zbMath0936.94009OpenAlexW1534088294MaRDI QIDQ1299908

Paul Camion, Anne Canteaut

Publication date: 22 May 2000

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008337029047

zbMATH Keywords

orthogonal arrayscorrelation-immune functionsresilient functionsmultipermutations

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix ⋮ Complementary information set codes over \(\mathrm{GF}(p)\) ⋮ \(t\)-resilient functions and the partial exposure problem ⋮ Some classes of balanced functions over finite fields with a small value of the linear characteristic ⋮ New characterizations for the multi-output correlation-immune Boolean functions ⋮ On extended algebraic immunity ⋮ A quantum algorithm for testing and learning resiliency of a Boolean function ⋮ \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays ⋮ CIS codes over ${\mathbb F}_4$ ⋮ On the constructions and nonlinearity of binary vector-output correlation-immune functions

This page was built for publication: Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography