Construction of Boolean Functions Based on Partial Walsh Spectral

In deep learning as a service, user data flows through the client and cloud, which inevitably pose a risk of being attacked. Block cipher algorithms are widely used to encrypt large datasets and protect plaintext from attackers. Boolean functions acting as nonlinear components in block ciphers play a crucial role in ensuring security. This paper explores how to construct Boolean functions given some known partial Walsh spectrum. We propose a method for constructing all Boolean functions that satisfy the given conditions based on partial Walsh spectrum.Compared to exhaustive search, this method significantly reduces computational complexity. A construction example of a 5-variable Boolean function verifies the correctness of this method. Furthermore, this paper investigates the impact of random conditions on the number of constructed Boolean functions.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/icnlp65360.2025.11108647
Primary Topic
Advanced Algorithms and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Construction of Boolean Functions Based on Partial Walsh Spectral

Shilei Li, Dong Zheng, Haohan Zhang
Advanced Algorithms and Applications
article

Construction of Boolean Functions Based on Partial Walsh Spectral

Shilei Li, Dong Zheng, Haohan Zhang
article en

Abstract

In deep learning as a service, user data flows through the client and cloud, which inevitably pose a risk of being attacked. Block cipher algorithms are widely used to encrypt large datasets and protect plaintext from attackers. Boolean functions acting as nonlinear components in block ciphers play a crucial role in ensuring security. This paper explores how to construct Boolean functions given some known partial Walsh spectrum. We propose a method for constructing all Boolean functions that satisfy the given conditions based on partial Walsh spectrum.Compared to exhaustive search, this method significantly reduces computational complexity. A construction example of a 5-variable Boolean function verifies the correctness of this method. Furthermore, this paper investigates the impact of random conditions on the number of constructed Boolean functions.

Xi’an University of Posts and Telecommunications (CN)
Openalex Percentile: Top 75%
Advanced Algorithms and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.