{"id":4250,"date":"2026-11-19T23:08:10","date_gmt":"2026-11-19T23:08:10","guid":{"rendered":"https:\/\/smartcryptosecurity.com\/?p=4250"},"modified":"2026-11-19T23:08:10","modified_gmt":"2026-11-19T23:08:10","slug":"new-cryptographic-research-refines-modular-walsh-rigidity-for-boolean-functions-of-degree-up-to-four","status":"publish","type":"post","link":"https:\/\/smartcryptosecurity.com\/?p=4250","title":{"rendered":"New Cryptographic Research Refines Modular Walsh Rigidity for Boolean Functions of Degree Up to Four"},"content":{"rendered":"<p>A team of researchers has released a new study offering deeper insights into the mathematical properties of Boolean functions, addressing a long-standing challenge in cryptographic theory. The paper, titled &quot;Modular Walsh rigidity for Boolean functions of degree at most four&quot; (Paper 2026\/2900), was authored by Filipe Martins Vono and Andr\u00e9 Oliveira Naufel de Toledo, both representing the Centro Universit\u00e1rio de Belo Horizonte (UniBH) in Belo Horizonte, Brazil, alongside Val\u00e9ria Gonzaga Santos of the American Global Tech University (AGTU). <\/p>\n<p>The newly published work focuses on the behavior of Boolean functions and introduces refined bounds that determine when specific functions can be classified as &quot;bent&quot;\u2014a critical property in cryptography linked to high nonlinearity and resistance to linear cryptanalysis. By examining the structural constraints of Walsh coefficients under modular arithmetic, the researchers have improved upon previous analytical boundaries, offering a more precise mathematical tool for evaluating high-variable functions.<\/p>\n<h2>Understanding Boolean Functions and Bentness in Cryptography<\/h2>\n<p>In the realm of symmetric cryptography, Boolean functions play a foundational role in the design of stream ciphers, block ciphers, and hash functions. These functions take multiple binary inputs and produce a single binary output. To ensure cryptographic security, designers often rely on bent functions\u2014functions that exhibit maximum possible distance from all affine functions, a characteristic known as maximal nonlinearity. <\/p>\n<p>Because bent functions provide optimal resistance against linear attacks, identifying and constructing them across varying numbers of variables is an ongoing area of research. However, verifying whether a function is bent can become computationally difficult as the number of variables increases. Analytical criteria, such as those involving the Walsh transform\u2014a mathematical tool used to analyze the frequency components of Boolean functions\u2014are essential for classifying these properties without exhaustive computation.<\/p>\n<p>The new research paper investigates a specific category of functions: those with a algebraic degree of at most four. The authors explore how the Walsh coefficients of these functions behave when evaluated modulo an odd integer, a concept referred to in the study as modular Walsh rigidity.<\/p>\n<h2>Refining the Mathematical Bounds and Generalizations<\/h2>\n<p>The core breakthrough detailed in the paper centers on refining the sufficient conditions required to prove that a low-degree Boolean function is bent. In sixteen variables, the authors note a specific baseline: a Boolean function of degree at most four is guaranteed to be bent as soon as every one of its Walsh coefficients is congruent to $4$ or $5$ modulo $9$.<\/p>\n<p>Building upon this specific instance, the researchers generalized the principle for broader applications. Let $m$ be an integer greater than or equal to $4$, and let $M$ equal $2^m$. The authors prove that a function of degree at most four on $4m$ variables is bent under a specific set of modular conditions. Specifically, this classification holds true if all of its Walsh coefficients are congruent to $pm M^2$ modulo a single odd integer $p$ that is greater than or equal to $9M\/16$. The study notes that the sign of this congruence may vary depending on the frequency.<\/p>\n<p>This theoretical advancement improves upon an earlier sufficient bound, which required $p$ to be greater than $7M\/12$. By tightening this boundary, the new research accommodates critical edge cases, successfully including the endpoint where $M = 16$ and $p = 9$. <\/p>\n<p>To achieve these results, the research team employed a combination of advanced mathematical techniques. The proof incorporates an analysis of the degrees of the low binary digits within the normalized spectrum, examines low-weight Reed-Muller words, and applies rigorous bounds on groups of Fourier coefficients. These methods allow the authors to establish structural rigidity within the polynomial representations of the functions, bridging the gap between spectral properties and algebraic degree constraints.<\/p>\n<h2>Practical Implications for High-Variable Subspaces<\/h2>\n<p>Beyond theoretical proofs, the study demonstrates a practical application of its findings concerning high-dimensional spaces. As a concrete demonstration of the theorem&#8217;s utility, the authors apply their framework to a large-scale construction.<\/p>\n<p>According to the paper, a rotation-symmetric bent function of degree at most four in $888$ variables retains its bent property when restricted to a $24$-variable subspace. This specific subspace is obtained by repeating a designated block $37$ times. Such findings illustrate how modular rigidity principles can help verify the preservation of cryptographic properties across lower-dimensional slices of excessively large systems, an approach that can simplify analysis in complex cryptographic designs.<\/p>\n<p>The complete research paper, along with its formal abstract and associated bibliographic data, has been made publicly available through the Cryptology ePrint Archive under paper identifier 2026\/2900, providing researchers and cryptographers worldwide with access to the full mathematical proofs and technical formulations.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>A team of researchers has released a new study offering deeper insights into the mathematical&#8230;<\/p>\n","protected":false},"author":5,"featured_media":4249,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[676],"tags":[678,2742,1002,607,3372,514,3268,677,1647,1842,214,3371,3370],"class_list":["post-4250","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-cryptography-math","tag-algorithms","tag-boolean","tag-cryptographic","tag-cryptography","tag-degree","tag-four","tag-functions","tag-math","tag-modular","tag-refines","tag-research","tag-rigidity","tag-walsh"],"_links":{"self":[{"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=\/wp\/v2\/posts\/4250","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=4250"}],"version-history":[{"count":0,"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=\/wp\/v2\/posts\/4250\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=\/wp\/v2\/media\/4249"}],"wp:attachment":[{"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4250"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4250"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/smartcryptosecurity.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4250"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}