Skip to Content

332 Results Found

  • Article
  • Open Access
1 Citations
2,746 Views
15 Pages

On Resilient Boolean and Vectorial Boolean Functions with High Nonlinearity

  • Luyang Li,
  • Linhui Wang,
  • Qinglan Zhao and
  • Dong Zheng

19 December 2022

Boolean functions and vectorial Boolean functions are the most important nonlinear components of stream ciphers. They should satisfy several criteria such as high nonlinearity, proper resiliency and so on to guarantee the security of the whole system...

(This article belongs to the Special Issue Advances in Algebraic Coding Theory and Cryptography)
  • Article
  • Open Access
1 Citations
2,410 Views
21 Pages

In several stream cipher designs, Boolean functions (BFs) play a crucial role as non-linear components, either serving as filtering functions or being used within the combining process. The overall strength of stream ciphers mainly depends on certain...

  • Article
  • Open Access
1 Citations
3,397 Views
16 Pages

Construction of Boolean Functions from Hermitian Codes

  • Guillermo Sosa-Gómez,
  • Octavio Paez-Osuna,
  • Omar Rojas,
  • Pedro Luis del Ángel Rodríguez and ,
  • Herbert Kanarek and
  • Evaristo José Madarro-Capó
  • + 1 author+ 0 author

11 March 2022

In 2005, Guillot published a method for the construction of Boolean functions using linear codes through the Maiorana–McFarland construction of Boolean functions. In this work, we present a construction using Hermitian codes, starting from the...

(This article belongs to the Special Issue Codes, Designs, Cryptography and Optimization, 2nd Edition)
  • Feature Paper
  • Article
  • Open Access
4 Citations
1,626 Views
23 Pages

A Quantum Algorithm for the Classification of Patterns of Boolean Functions

  • Theodore Andronikos,
  • Constantinos Bitsakos,
  • Konstantinos Nikas,
  • Georgios I. Goumas and
  • Nectarios Koziris

25 May 2025

This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their domain that ta...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
4 Citations
3,194 Views
10 Pages

A New Family of Boolean Functions with Good Cryptographic Properties

  • Guillermo Sosa-Gómez,
  • Octavio Paez-Osuna,
  • Omar Rojas and
  • Evaristo José Madarro-Capó

25 March 2021

In 2005, Philippe Guillot presented a new construction of Boolean functions using linear codes as an extension of the Maiorana–McFarland’s (MM) construction of bent functions. In this paper, we study a new family of Boolean functions with cryptograph...

  • Article
  • Open Access
11 Citations
2,245 Views
8 Pages

Boolean Functions Simplification Algorithm of O(n) Complexity

  • Şirzat Kahramanli and
  • Fatih Başçiftçi

1 December 2003

The minimization of Boolean functions allows designers to make use of fewer components, thus reducing the cost of particular system. All procedures for reducing either two-level or multilevel Boolean networks into prime and irredundant form have O(2n...

  • Article
  • Open Access
7 Citations
3,522 Views
8 Pages

17 January 2021

One of the fastest known general techniques for computing permanents is Ryser’s formula. On this note, we show that this formula over Sylvester Hadamard matrices of order 2m, Hm, can be carried out by enumerating m-variable Boolean functions wi...

(This article belongs to the Special Issue Codes, Designs, Cryptography and Optimization)
  • Article
  • Open Access
7 Citations
3,175 Views
17 Pages

3 February 2021

We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all n-bit partial Boolean functions that depend on n bits and ca...

(This article belongs to the Special Issue Exploring the NP-Complexity of Nature: Critical Phenomena, Chaos, Fractals, Graphs, Boson Sampling, Quantum Computing and More)
  • Article
  • Open Access
2,855 Views
10 Pages

A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions

  • Modjtaba Ghorbani,
  • Matthias Dehmer,
  • Vahid Taghvayi-Yazdelli and
  • Frank Emmert-Streib

3 April 2019

In this paper, we present four product operations to construct cryptographic boolean functions from smaller ones with predictable Walsh spectrum. A lot of cryptographic properties of boolean functions can be presented by their Walsh spectrum. In our...

  • Article
  • Open Access
2 Citations
2,473 Views
14 Pages

Recently, balanced Boolean functions with an even number n of variables achieving very good autocorrelation properties have been obtained for 12≤n≤26. These functions attain the maximum absolute value in the autocorrelation spectra (without con...

(This article belongs to the Special Issue Using New Technologies on Cyber Security Solutions)
  • Article
  • Open Access
2 Citations
3,191 Views
16 Pages

BooLSPLG: A Library with Parallel Algorithms for Boolean Functions and S-Boxes for GPU

  • Dushan Bikov,
  • Iliya Bouyukliev and
  • Mariya Dzhumalieva-Stoeva

14 April 2023

In this paper, we present a library with sequential and parallel functions for computing some of the most important cryptographic characteristics of Boolean and vectorial Boolean functions. The library implements algorithms to calculate the nonlinear...

(This article belongs to the Special Issue Theory and Application of Algebraic Combinatorics)
  • Article
  • Open Access
11 Citations
4,833 Views
25 Pages

Metaheuristics in the Optimization of Cryptographic Boolean Functions

  • Isaac López-López,
  • Guillermo Sosa-Gómez,
  • Carlos Segura,
  • Diego Oliva and
  • Omar Rojas

21 September 2020

Generating Boolean Functions (BFs) with high nonlinearity is a complex task that is usually addresses through algebraic constructions. Metaheuristics have also been applied extensively to this task. However, metaheuristics have not been able to attai...

(This article belongs to the Special Issue Entropy in Soft Computing and Machine Learning Algorithms)
  • Article
  • Open Access
5 Citations
3,683 Views
23 Pages

27 October 2023

Stream ciphers usually rely on highly secure Boolean functions to ensure safe communication within unsafe channels. However, discovering secure Boolean functions is a non-trivial optimization problem that has been addressed by many optimization techn...

(This article belongs to the Special Issue Algorithms for Natural Computing Models)
  • Feature Paper
  • Article
  • Open Access
2 Citations
4,388 Views
17 Pages

22 January 2022

We review and compare three algebraic methods to compute the nonlinearity of Boolean functions. Two of them are based on Gröbner basis techniques: the first one is defined over the binary field, while the second one over the rationals. The third...

(This article belongs to the Special Issue The Advances in Algebraic Coding Theory)
  • Article
  • Open Access
7 Citations
3,480 Views
14 Pages

On the Periodic Structure of Parallel Dynamical Systems on Generalized Independent Boolean Functions

  • Juan A. Aledo,
  • Ali Barzanouni,
  • Ghazaleh Malekbala,
  • Leila Sharifan and
  • Jose C. Valverde

3 July 2020

In this paper, based on previous results on AND-OR parallel dynamical systems over directed graphs, we give a more general pattern of local functions that also provides fixed point systems. Moreover, by considering independent sets, this pattern is a...

(This article belongs to the Special Issue Boolean Networks Models in Science and Engineering)
  • Article
  • Open Access
2 Citations
1,180 Views
29 Pages

Probabilistic Links Between Quantum Classification of Patterns of Boolean Functions and Hamming Distance

  • Theodore Andronikos,
  • Constantinos Bitsakos,
  • Konstantinos Nikas,
  • Georgios I. Goumas and
  • Nectarios Koziris

1 January 2026

This article investigates the probabilistic relationship between quantum classification of Boolean functions and their Hamming distance. By integrating concepts from quantum computing, information theory, and combinatorics, we explore how Hamming dis...

  • Article
  • Open Access
2,094 Views
14 Pages

LBF-MI: Limited Boolean Functions and Mutual Information to Infer a Gene Regulatory Network from Time-Series Gene Expression Data

  • Shohag Barman,
  • Fahmid Al Farid,
  • Hira Lal Gope,
  • Md. Ferdous Bin Hafiz and ,
  • Niaz Ashraf Khan,
  • Sabbir Ahmad and
  • Sarina Mansor
  • + 2 authors+ 0 author

27 November 2024

Background: In the realm of system biology, it is a challenging endeavor to infer a gene regulatory network from time-series gene expression data. Numerous Boolean network inference techniques have emerged for reconstructing a gene regulatory network...

(This article belongs to the Section Bioinformatics)
  • Article
  • Open Access
21 Citations
3,843 Views
23 Pages

A Novel Strong S-Box Design Using Quantum Crossover and Chaotic Boolean Functions for Symmetric Cryptosystems

  • Haitham Alsaif,
  • Ramzi Guesmi,
  • Anwar Kalghoum,
  • Badr M. Alshammari and
  • Tawfik Guesmi

30 March 2023

In this paper, we propose a new method for drawing a cryptographically strong substitution box using the Lorenz system and quantum genetic algorithm techniques. We used the chaotic function to generate an initial random sequence of bits and the quant...

(This article belongs to the Section A: Computer Science)
  • Article
  • Open Access
483 Views
11 Pages

Oblivious Transfer (OT) extension, in particular, the construction of Ishai, Kilian, Nissim, and Petrank (CRYPTO 2003) requires a hash function H that is correlation-robust(CR). All practical instantiations model H as a random oracle or an ideal ciph...

  • Article
  • Open Access
8 Citations
4,340 Views
18 Pages

Random Networks with Quantum Boolean Functions

  • Mario Franco,
  • Octavio Zapata,
  • David A. Rosenblueth and
  • Carlos Gershenson

7 April 2021

We propose quantum Boolean networks, which can be classified as deterministic reversible asynchronous Boolean networks. This model is based on the previously developed concept of quantum Boolean functions. A quantum Boolean network is a Boolean netwo...

(This article belongs to the Special Issue Boolean Networks Models in Science and Engineering)
  • Article
  • Open Access
5 Citations
2,075 Views
12 Pages

30 October 2022

This paper studies the robust stabilization of impulsive Boolean control networks (IBCNs) with function perturbation. A Boolean control network (BCN) with a state-dependent impulsive sequence is converted to an equivalent BCN by the semi-tensor produ...

(This article belongs to the Special Issue Control Problem of Nonlinear Systems with Applications)
  • Article
  • Open Access
5 Citations
5,234 Views
23 Pages

Substitution boxes (S-Boxes) are the core components of modern block ciphers, responsible for introducing the essential nonlinearity that protects against attacks like linear and differential cryptanalysis. For an 8-bit S-Box, the highest possible no...

  • Article
  • Open Access
2 Citations
2,409 Views
17 Pages

22 February 2024

Vectorial Boolean functions and codes are closely related and interconnected. On the one hand, various requirements of binary linear codes are needed for their theoretical interests but, more importantly, for their practical applications (such as few...

(This article belongs to the Special Issue Discrete Math in Coding Theory)
  • Article
  • Open Access
2 Citations
3,934 Views
16 Pages

10 September 2018

Let X n be a memoryless uniform Bernoulli source and Y n be the output of it through a binary symmetric channel. Courtade and Kumar conjectured that the Boolean function f : { 0 , 1 } n → { 0 , 1 } that maximizes th...

(This article belongs to the Special Issue The 20th Anniversary of Entropy - Recent Advances in Entropy and Information-Theoretic Concepts and Their Applications)
  • Article
  • Open Access
3 Citations
1,478 Views
13 Pages

19 July 2024

This paper investigates the one-bit function perturbation (OBFP) impact on the robust set stability of Boolean networks with disturbances (DBNs). Firstly, the dynamics of these networks are converted into the algebraic forms utilizing the semi-tensor...

  • Article
  • Open Access
1,022 Views
16 Pages

Estimating the Number of Junta Variables for Optimizing Boolean Functions in Quantum Memories

  • Abdulaziz Alotaibi,
  • Samar AbdelAzim,
  • Sattam Saleem Alharbi and
  • Mohamed Darwish

25 October 2025

Optimizing Boolean function components to have the minimum number of inputs in order to reduce the memory space required during these functions in computing devices is a significant demand. This paper proposes a quantum computation approach based on...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
3 Citations
2,998 Views
13 Pages

24 June 2020

Boolean networks are discrete dynamical systems comprised of coupled Boolean functions. An important parameter that characterizes such systems is the Lyapunov exponent, which measures the state stability of the system to small perturbations. We consi...

(This article belongs to the Special Issue Boolean Networks Models in Science and Engineering)
  • Article
  • Open Access
9 Citations
4,458 Views
14 Pages

16 October 2020

In this work, we solve the problem of the coexistence of periodic orbits in homogeneous Boolean graph dynamical systems that are induced by a maxterm or a minterm (Boolean) function, with a direct underlying dependency graph. Specifically, we show th...

(This article belongs to the Special Issue Boolean Networks Models in Science and Engineering)
  • Article
  • Open Access
1 Citations
2,125 Views
14 Pages

Generating Bent Functions and Dynamic Filters: A Novel Equivalence-Based Approach

  • Joseph Nelson,
  • Chungath Srinivasan,
  • Anand R. Nair and
  • Lakshmy Koduvayur Viswanathan

8 November 2024

Boolean functions are fundamental building blocks in both discrete mathematics and computer science, with applications spanning from cryptography to coding theory. Bent functions, a subset of Boolean functions with maximal nonlinearity, are particula...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
268 Views
12 Pages

4 September 2026

Plateaued Boolean functions play an important role in sequence design and cryptography due to their favorable properties such as high nonlinearity, resilience and low additive autocorrelation. In this paper, by modifying the support of certain quadra...

(This article belongs to the Special Issue Mathematical Foundations in Public Key Cryptography and Privacy Computing)
  • Article
  • Open Access
4 Citations
2,248 Views
16 Pages

Resiliency and Nonlinearity Profiles of Some Cryptographic Functions

  • Deep Singh,
  • Amit Paul,
  • Neerendra Kumar,
  • Veronika Stoffová and
  • Chaman Verma

27 November 2022

Boolean functions are important in terms of their cryptographic and combinatorial properties for different kinds of cryptosystems. The nonlinearity and resiliency of cryptographic functions are crucial criteria with respect to protection of ciphers f...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
1 Citations
3,033 Views
22 Pages

Modelling Biological Systems: A New Algorithm for the Inference of Boolean Networks

  • Mario Rubio-Chavarría,
  • Cristina Santamaría,
  • Belén García-Mora and
  • Gregorio Rubio

13 February 2021

Biological systems are commonly constituted by a high number of interacting agents. This great dimensionality hinders biological modelling due to the high computational cost. Therefore, new modelling methods are needed to reduce computation time whil...

  • Article
  • Open Access
2 Citations
1,183 Views
33 Pages

Quantum Classification Outside the Promised Class

  • Theodore Andronikos,
  • Constantinos Bitsakos,
  • Konstantinos Nikas,
  • Georgios I. Goumas and
  • Nectarios Koziris

This paper studies the important problem of quantum classification of Boolean functions from an entirely novel perspective. Typically, quantum classification algorithms allow us to classify functions with a probability of 1.0, if we are promised that...

  • Article
  • Open Access
2,113 Views
12 Pages

7 November 2024

Prior to the discovery of an APN permutation in six dimension it was conjectured that such functions do not exist in even dimension, as none had been found at that time. However, finding APN permutations in even dimension ≥8 remains a significant...

(This article belongs to the Section A: Algebra and Logic)
  • Article
  • Open Access
189 Views
15 Pages

26 October 2026

A classical Boolean specification need not be one-to-one, whereas every reversible quantum network must preserve distinctions between basis states. SAT-Embed-Q handles this mismatch by first constructing a partial reversible embedding from output-pre...

(This article belongs to the Section Quantum Computing and Information Processing)
  • Article
  • Open Access
10 Citations
2,526 Views
11 Pages

28 February 2023

The FLIP cipher was proposed at Eurocrypt 2016 for the purpose of meliorating the efficiency of fully homomorphic cryptosystems. Weightwise perfectly balanced Boolean functions meet the balancedness requirement of the filter function in FLIP ciphers,...

(This article belongs to the Special Issue Frontiers in Network Security and Cryptography)
  • Article
  • Open Access
11 Citations
2,340 Views
8 Pages

16 June 2022

Many of the applied algorithms that have been developed for solving a system of logical equations or the Boolean satisfiability problem have solved the problem in the Boolean domain. However, other approaches have recently been developed and improved...

  • Article
  • Open Access
2,291 Views
21 Pages

An Extended Analysis of the Correlation Extraction Algorithm in the Context of Linear Cryptanalysis

  • Christoph Graebnitz,
  • Valentin Pickel,
  • Holger Eble,
  • Frank Morgner and ,
  • Hannes Hattenbach and
  • Marian Margraf
  • + 1 author+ 0 author

22 December 2024

In cryptography, techniques and tools developed in the subfield of linear cryptanalysis have previously successfully been used to allow attackers to break many sophisticated cryptographic ciphers. Since these linear cryptanalytic techniques require e...

(This article belongs to the Special Issue Quantum Computing: A Taxonomy, Systematic Review, and Future Directions)
  • Article
  • Open Access
2 Citations
7,092 Views
10 Pages

Any Monotone Function Is Realized by Interlocked Polygons

  • Erik D. Demaine,
  • Martin L. Demaine and
  • Ryuhei Uehara

19 March 2012

Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that...

(This article belongs to the Special Issue Puzzle/Game Algorithms)
  • Article
  • Open Access
828 Views
9 Pages

23 March 2025

This article delves into some properties of free and Boolean multiplicative convolutions, in connection with the theory of Cauchy–Stieltjes kernel (CSK) families and their respective variance functions (VFs). Consider K−(μ)={Qmμ(ds)...

(This article belongs to the Section D1: Probability and Statistics)
  • Article
  • Open Access
456 Views
25 Pages

Finite-n Estimate of Dedekind Numbers Using Layer-Ratio Monte Carlo

  • Tian-Shun Chen,
  • Hao Feng,
  • Haozhe Wang,
  • Chian-Shu Chen and
  • Kilar Zhang

11 September 2026

Dedekind’s problem counts monotone Boolean functions, equivalently downsets of a Boolean lattice. We recast this enumeration as a finite layer-ratio reconstruction problem for the Whitney numbers of the ranked ideal lattice. An exact adjacent-l...

(This article belongs to the Special Issue Research on Field Theory in Mathematical Physics)
  • Article
  • Open Access
1 Citations
3,737 Views
31 Pages

8 July 2021

Patterns found among both living systems, such as fish scales, bones, and tree rings, and non-living systems, such as terrestrial and extraterrestrial dunes, microstructures of alloys, and geological seismic profiles, are comprised of anisotropic lay...

(This article belongs to the Special Issue New Trends on Pattern Recognition and Computer Vision, Applications and Systems)
  • Article
  • Open Access
3 Citations
3,458 Views
12 Pages

A Secure Random Number Generator with Immunity and Propagation Characteristics for Cryptography Functions

  • Rahul Saha,
  • Ganesan Geetha,
  • Gulshan Kumar,
  • William J. Buchanan and
  • Tai-hoon Kim

31 August 2021

Cryptographic algorithms and functions should possess some of the important functional requirements such as: non-linearity, resiliency, propagation and immunity. Several previous studies were executed to analyze these characteristics of the cryptogra...

(This article belongs to the Special Issue Analytics, Privacy and Security for IoT and Big Data)
  • Article
  • Open Access
222 Views
14 Pages

29 September 2026

This paper addresses the set stabilization problem of probabilistic Boolean control networks (PBCNs) via a self-triggered control strategy. Firstly, the algebraic representation of the considered PBCNs is established by employing the semi-tensor prod...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
1 Citations
1,138 Views
17 Pages

12 September 2024

This paper develops a parameter tuning method for solving the set restabilization problem of perturbed Boolean control networks (BCNs). First, the absorbable attractor, which we previously proposed, is recalled. Based on the relationship between attr...

(This article belongs to the Section Systems & Control Engineering)
  • Article
  • Open Access
2 Citations
2,923 Views
16 Pages

12 April 2022

Soft nanomaterials like aerogels are subject to thermal fluctuations, so that their structure randomly fluctuates with time. Neutron elastic and inelastic scattering experiments provide unique structural and dynamic information on such systems with n...

(This article belongs to the Section Gel Processing and Engineering)
  • Proceeding Paper
  • Open Access
2 Citations
2,519 Views
16 Pages

20 November 2017

A method for synthesizing quantum gates is presented based on interpolation methods applied to operators in Hilbert space. Starting from the diagonal forms of specific generating seed operators with non-degenerate eigenvalue spectrum one obtains for...

(This article belongs to the Proceedings of The 4th International Electronic Conference on Entropy and Its Applications)
  • Article
  • Open Access
2,779 Views
16 Pages

Dictionary Encoding Based on Tagged Sentential Decision Diagrams

  • Deyuan Zhong,
  • Liangda Fang and
  • Quanlong Guan

18 January 2024

Encoding a dictionary into another representation means that all the words can be stored in the dictionary in a more efficient way. In this way, we can complete common operations in dictionaries, such as (1) searching for a word in the dictionary, (2...

  • Article
  • Open Access
7 Citations
2,608 Views
17 Pages

Optimisation Challenge for a Superconducting Adiabatic Neural Network That Implements XOR and OR Boolean Functions

  • Dmitrii S. Pashin,
  • Marina V. Bastrakova,
  • Dmitrii A. Rybin,
  • Igor. I. Soloviev and ,
  • Nikolay V. Klenov and
  • Andrey E. Schegolev
  • + 1 author+ 0 author

In this article, we consider designs of simple analog artificial neural networks based on adiabatic Josephson cells with a sigmoid activation function. A new approach based on the gradient descent method is developed to adjust the circuit parameters,...

(This article belongs to the Special Issue Neuromorphic Devices: Materials, Structures and Bionic Applications)
  • Article
  • Open Access
4 Citations
2,984 Views
18 Pages

19 September 2022

Quadrature amplitude modulation (QAM) constellation and Golay complementary sequences (GCSs) are usually applied in orthogonal frequency division multiplexing (OFDM) systems to obtain a higher data rate and a lower peak-to-mean envelope power ratio (...

(This article belongs to the Special Issue Technologies of Highly Efficient Telecommunication Systems and Devices)

of 7