{"title":"Constructions of plateaued correctors with high correction order and good nonlinearity via Walsh spectral neutralization technique","authors":"Shuyu Luo, Weiqiong Wang, Qi Zhang, Zhenjie Song","doi":"10.1007/s10623-024-01497-5","DOIUrl":null,"url":null,"abstract":"<p>A corrector is a critical component of True Random Number Generators (TRNGs), serving as a post-processing function to reduce statistical weaknesses in raw random sequences. It is important to note that a <span>\\(\\textit{t}\\)</span>-resilient Boolean function is a <span>\\(\\textit{t}\\)</span>-corrector, while the converse is not necessarily true. Building upon the pioneering method introduced by Zhang in 2023 for constructing nonlinear correctors with correction order one greater than resiliency order, this paper presents for the first time two approaches for constructing nonlinear plateaued correctors with correction order at least two greater than resiliency order via Walsh spectral neutralization technique, and the resulting correctors have algebraic degree at least <span>\\(\\text {2}\\)</span>. The first approach yields <span>\\(\\textit{n}\\)</span>-variable plateaued correctors with correction order <span>\\(\\textit{n}-\\text {2}\\)</span> and resiliency order approximately <span>\\(\\textit{n}- \\text {log}_\\text {2} \\textit{n}\\)</span>. The nonlinearity and algebraic degree of the resulting correctors are also analyzed, demonstrating that they meet both Siegenthaler’s and Sarkar-Maitra’s bounds. Another approach based on Walsh spectral neutralization technique for constructing <span>\\(\\textit{n}\\)</span>-variable plateaued correctors is proposed. This approach facilitates the design of semi-bent correctors with algebraic degree <span>\\(\\lceil \\frac{\\textit{n}}{\\text {2}} \\rceil \\)</span>, correction order <span>\\(\\lfloor \\frac{\\textit{n}}{\\text {2}} \\rfloor -\\text {1}\\)</span> and resiliency order approximately <span>\\( \\frac{\\textit{n}}{\\text {4}} \\)</span>.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"2 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01497-5","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
A corrector is a critical component of True Random Number Generators (TRNGs), serving as a post-processing function to reduce statistical weaknesses in raw random sequences. It is important to note that a \(\textit{t}\)-resilient Boolean function is a \(\textit{t}\)-corrector, while the converse is not necessarily true. Building upon the pioneering method introduced by Zhang in 2023 for constructing nonlinear correctors with correction order one greater than resiliency order, this paper presents for the first time two approaches for constructing nonlinear plateaued correctors with correction order at least two greater than resiliency order via Walsh spectral neutralization technique, and the resulting correctors have algebraic degree at least \(\text {2}\). The first approach yields \(\textit{n}\)-variable plateaued correctors with correction order \(\textit{n}-\text {2}\) and resiliency order approximately \(\textit{n}- \text {log}_\text {2} \textit{n}\). The nonlinearity and algebraic degree of the resulting correctors are also analyzed, demonstrating that they meet both Siegenthaler’s and Sarkar-Maitra’s bounds. Another approach based on Walsh spectral neutralization technique for constructing \(\textit{n}\)-variable plateaued correctors is proposed. This approach facilitates the design of semi-bent correctors with algebraic degree \(\lceil \frac{\textit{n}}{\text {2}} \rceil \), correction order \(\lfloor \frac{\textit{n}}{\text {2}} \rfloor -\text {1}\) and resiliency order approximately \( \frac{\textit{n}}{\text {4}} \).
期刊介绍:
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.