English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Rotation symmetric Boolean functions (RSBFs) are nowadays studied a lot because of its easy operations and good performance in cryptosystem. This paper constructs a new class of odd-variable RSBFs with optimal algebraic immunity (AI). The nonlinearity of the new function, <inline-formula> <tex-math notation="LaTeX">$2^{n-1}-\binom {n-1}{k}+2^{k-4}(k-3)(k-2)$ </tex-math></inline-formula>, is the highest among all existing RSBFs with optimal AI and known nonlinearity, and its algebraic degree is also almost highest. Besides, the class of functions have almost optimal fast algebraic immunity (FAI) at least for <inline-formula> <tex-math notation="LaTeX">$n < 17$ </tex-math></inline-formula>, which is actually the highest possible value for the designated number of variables.

Constructing Higher Nonlinear Odd-Variable RSBFs With Optimal AI and Almost Optimal FAI