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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Boolean functions are mathematical objects used in diverse domains and havebeen actively researched for several decades already. One domain where Booleanfunctions play an important role is cryptography. There, the plethora ofsettings one should consider and cryptographic properties that need to befulfilled makes the search for new Boolean functions still a very activedomain. There are several options to construct appropriate Boolean functions:algebraic constructions, random search, and metaheuristics. In this work, weconcentrate on metaheuristic approaches and examine the related works appearingin the last 25 years. To the best of our knowledge, this is the first surveywork on this topic. Additionally, we provide a new taxonomy of related worksand discuss the results obtained. Finally, we finish this survey with potentialfuture research directions.

A Survey of Metaheuristic Algorithms for the Design of Cryptographic Boolean Functions