On the public citation graph
Heuristic design of cryptographically strong balanced Boolean functions
0 signed · 141 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-38424-3_1openalex-snapshot
Differential Cryptanalysis of DES-like Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-46877-3_14openalex-snapshot
Propagation Characteristics of Boolean Functions
inferredcites →https://doi.org/10.1007/3-540-48285-7_16openalex-snapshot
On Constructions and Nonlinearity of Correlation Immune Functions
inferredcites →https://doi.org/10.1007/3-540-48285-7_33openalex-snapshot
Linear Cryptanalysis Method for DES Cipher
inferredcites →https://doi.org/10.1007/3-540-48329-2_5openalex-snapshot
Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics
inferredcites →https://doi.org/10.1007/3-540-60590-8_5openalex-snapshot
Construction of bent functions and balanced Boolean functions with high nonlinearity
inferredcites →https://doi.org/10.1007/bf00630563openalex-snapshot
Differential cryptanalysis of DES-like cryptosystems
inferredcites →https://doi.org/10.1007/bfb0028471openalex-snapshot
An effective genetic algorithm for finding highly nonlinear boolean functions
inferredcites →https://doi.org/10.1016/s0020-0190(98)00009-xopenalex-snapshot
Global avalanche characteristics and nonlinearity of balanced Boolean functions
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1080/0161-119391867746openalex-snapshot
USE OF A GENETIC ALGORITHM IN THE CRYPTANALYSIS OF SIMPLE SUBSTITUTION CIPHERS
inferredcites →https://doi.org/10.1080/0161-119391867863openalex-snapshot
THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSIS
inferredcites →https://doi.org/10.1080/0161-119391867999openalex-snapshot
CRYPTANALYSIS OF KNAPSACK CIPHERS USING GENETIC ALGORITHMS
inferredcites →https://doi.org/10.1080/0161-119691884807openalex-snapshot
COMBINATORIAL OPTIMIZATION AND THE KNAPSACK CIPHER
inferredcites →https://doi.org/10.1080/0161-119791885850openalex-snapshot
A PARALLEL GENETIC ALGORITHM FOR CRYPTANALYSIS OF THE POLYALPHABETIC SUBSTITUTION CIPHER
inferredcites →https://doi.org/10.1109/18.568715openalex-snapshot
On the norm and covering radius of the first-order Reed-Muller codes
inferredcites →https://doi.org/10.1109/18.6037openalex-snapshot
A spectral characterization of correlation-immune combining functions
inferredcites →https://doi.org/10.1109/tit.1983.1056679openalex-snapshot
The covering radius of the(2^{15}, 16)Reed-Muller code is at least 16276
inferredcites →https://doi.org/10.1109/tit.1984.1056949openalex-snapshot
Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10718964_20openalex-snapshot
Two-Stage Optimisation in the Design of Boolean Functions
inferred← citeshttps://doi.org/10.1007/11523468_27openalex-snapshot
Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties
inferred← citeshttps://doi.org/10.1007/3-540-36231-2_20openalex-snapshot
Evolving Boolean Functions Satisfying Multiple Criteria
inferred← citeshttps://doi.org/10.1007/3-540-45067-x_43openalex-snapshot
New Constructions for Resilient and Highly Nonlinear Boolean Functions
inferred← citeshttps://doi.org/10.1007/3-540-45450-0_29openalex-snapshot
A Brief Outline of Research on Correlation Immune Functions
inferred← citeshttps://doi.org/10.1007/3-540-46665-7_3openalex-snapshot
Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_13openalex-snapshot
Highly Nonlinear Resilient Functions Optimizing Siegenthaler’s Inequality
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_1openalex-snapshot
Boolean Function Design Using Hill Climbing Methods
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_2openalex-snapshot
Enumeration of Correlation Immune Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-0-387-36503-9_12openalex-snapshot
Random Generation of S-Boxes for Block Ciphers
inferred← citeshttps://doi.org/10.1007/978-0-387-73137-7_19openalex-snapshot
Strong Boolean Functions with Compact ANF Representation
inferred← citeshttps://doi.org/10.1007/978-3-030-16670-0_17openalex-snapshot
Hyper-bent Boolean Functions and Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-98795-4_1openalex-snapshot
Artificial Intelligence for the Design of Symmetric Cryptographic Primitives
inferred← citeshttps://doi.org/10.1007/978-3-031-19493-1_30openalex-snapshot
Studying Special Operators for the Application of Evolutionary Algorithms in the Seek of Optimal Boolean Functions for Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-21094-5_17openalex-snapshot
The Influence of Local Search on Genetic Algorithms with Balanced Representations
inferred← citeshttps://doi.org/10.1007/978-3-031-36115-9_27openalex-snapshot
Heuristic Search for Nonlinear Substitutions for Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-36115-9_29openalex-snapshot
New Cost Function for S-boxes Generation by Simulated Annealing Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-031-83490-5_2openalex-snapshot
From Block Designs to Codes to Crypto and Back Again
inferred← citeshttps://doi.org/10.1007/978-3-031-90062-4_4openalex-snapshot
The More the Merrier: On Evolving Five-Valued Spectra Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-10762-2_80openalex-snapshot
Evolving DPA-Resistant Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-16501-1_16openalex-snapshot
Evolutionary Methods for the Construction of Cryptographic Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-25645-0_21openalex-snapshot
Evolving Highly Nonlinear Balanced Boolean Functions with Improved Resistance to DPA Attacks
inferred← citeshttps://doi.org/10.1007/978-3-319-26841-5_3openalex-snapshot
A Genetic Algorithm for Evolving Plateaued Cryptographic Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-26841-5_6openalex-snapshot
Evolutionary Approach for Finding Correlation Immune Boolean Functions of Order t with Minimal Hamming Weight
inferred← citeshttps://doi.org/10.1007/978-3-319-54669-8_13openalex-snapshot
PRNGs for Masking Applications and Their Mapping to Evolvable Hardware
inferred← citeshttps://doi.org/10.1007/978-3-319-99253-2_10openalex-snapshot
Evolutionary Search of Binary Orthogonal Arrays
inferred← citeshttps://doi.org/10.1007/978-3-540-24582-7_9openalex-snapshot
Improved Cost Function in the Design of Boolean Functions Satisfying Multiple Criteria
inferred← citeshttps://doi.org/10.1007/978-3-540-47942-0_22openalex-snapshot
Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes
inferred← citeshttps://doi.org/10.1007/978-3-540-77272-9_7openalex-snapshot
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
inferred← citeshttps://doi.org/10.1007/978-3-642-17401-8_11openalex-snapshot
Near-Collisions for the Reduced Round Versions of Some Second Round SHA-3 Compression Functions Using Hill Climbing
inferred← citeshttps://doi.org/10.1007/978-81-322-0487-9_45openalex-snapshot
Design of Boolean Functions Satisfying Multiple Criteria by NSGA-II
inferred← citeshttps://doi.org/10.1007/978-81-322-1771-8_71openalex-snapshot
Applications of Genetic Algorithms in Cryptology
inferred← citeshttps://doi.org/10.1007/978-981-10-3322-3_11openalex-snapshot
Introducing Biasedness in NSGA-II to Construct Boolean Function Having Best Trade-Off Among Its Properties
inferred← citeshttps://doi.org/10.1007/978-981-10-5687-1_75openalex-snapshot
Dynamic 9 × 9 Substitution-Boxes Using Chaos-Based Heuristic Search
inferred← citeshttps://doi.org/10.1007/978-981-33-4299-6_46openalex-snapshot
BSAT: A New Tool for Analyzing Cryptographic Strength of Boolean Function and S-Box of Symmetric Cryptosystem
inferred← citeshttps://doi.org/10.1007/bf02828644openalex-snapshot
Evolutionary design of boolean functions
inferred← citeshttps://doi.org/10.1007/bf03037656openalex-snapshot
The design of S-boxes by simulated annealing
inferred← citeshttps://doi.org/10.1007/s00500-023-09334-yopenalex-snapshot
Optimized simulated annealing for efficient generation of highly nonlinear S-boxes
inferred← citeshttps://doi.org/10.1007/s11047-022-09885-3openalex-snapshot
Heuristic search of (semi-)bent functions based on cellular automata
inferred← citeshttps://doi.org/10.1007/s11424-019-7263-8openalex-snapshot
A Note on Rotation Symmetric S-boxes
inferred← citeshttps://doi.org/10.1007/s12065-020-00538-xopenalex-snapshot
An improved hybrid genetic algorithm to construct balanced Boolean function with optimal cryptographic properties
inferred← citeshttps://doi.org/10.1007/s12095-023-00662-2openalex-snapshot
A survey of metaheuristic algorithms for the design of cryptographic Boolean functions
inferred← citeshttps://doi.org/10.1007/s13198-012-0089-6openalex-snapshot
An evolutionary approach to construct cryptographically strong Boolean functions
inferred← citeshttps://doi.org/10.1007/s44443-025-00007-4openalex-snapshot
Pseudorandom number generators based on neural networks: a review
inferred← citeshttps://doi.org/10.1016/j.asoc.2015.10.066openalex-snapshot
Cryptographic Boolean functions: One output, many design criteria
inferred← citeshttps://doi.org/10.1016/j.asoc.2021.107327openalex-snapshot
Toward more efficient heuristic construction of Boolean functions
inferred← citeshttps://doi.org/10.1016/j.engappai.2016.11.002openalex-snapshot
Immunological algorithms paradigm for construction of Boolean functions with good cryptographic properties
inferred← citeshttps://doi.org/10.1016/j.jisa.2017.01.001openalex-snapshot
Affine Boolean classification in secret image sharing for progressive quality access control
inferred← citeshttps://doi.org/10.1016/j.physleta.2019.126214openalex-snapshot
Quantum computing cryptography: Finding cryptographic Boolean functions with quantum annealing by a 2000 qubit D-wave quantum computer
inferred← citeshttps://doi.org/10.1016/j.swevo.2020.100646openalex-snapshot
Balanced crossover operators in Genetic Algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00319-5openalex-snapshot
Connections among nonlinearity, avalanche and correlation immunity
inferred← citeshttps://doi.org/10.1017/cbo9780511780448.011openalex-snapshot
Boolean Functions for Cryptography and Error-Correcting Codes
inferred← citeshttps://doi.org/10.1023/b:mahu.0000040543.22350.a0openalex-snapshot
Generating cryptographically strong Boolean functions using partial information
inferred← citeshttps://doi.org/10.1063/1.4990350openalex-snapshot
Proposed method to construct Boolean functions with maximum possible annihilator immunity
inferred← citeshttps://doi.org/10.1080/23311916.2022.2080623openalex-snapshot
Design of substitution nodes (S-Boxes) of a block cipher intended for preliminary encryption of confidential information
inferred← citeshttps://doi.org/10.1109/candarw53999.2021.00046openalex-snapshot
Tip the Balance: Improving Exploration of Balanced Crossover Operators by Adaptive Bias
inferred← citeshttps://doi.org/10.1109/cec.2003.1299870openalex-snapshot
Nature-inspired cryptography: past, present and future
inferred← citeshttps://doi.org/10.1109/cec.2003.1299872openalex-snapshot
Pseudorandom number generators based on evolutionary algorithm
inferred← citeshttps://doi.org/10.1109/cec.2003.1299939openalex-snapshot
New concepts in evolutionary search for boolean functions in cryptology
inferred← citeshttps://doi.org/10.1109/cec.2003.1299941openalex-snapshot
Almost Boolean functions: the design of Boolean functions by spectral inversion
inferred← citeshttps://doi.org/10.1109/cec.2004.1331076openalex-snapshot
Searching for cost functions
inferred← citeshttps://doi.org/10.1109/cec.2004.1331078openalex-snapshot
The design of s-boxes by simulated annealing
inferred← citeshttps://doi.org/10.1109/cec.2007.4424934openalex-snapshot
Heuristic search for non-linear cryptanalytic approximations
inferred← citeshttps://doi.org/10.1109/cec.2016.7744197openalex-snapshot
Maximal nonlinearity in balanced boolean functions with even number of inputs, revisited
inferred← citeshttps://doi.org/10.1109/cec.2018.8477677openalex-snapshot
Evolving Bent Quaternary Functions
inferred← citeshttps://doi.org/10.1109/cec55065.2022.9870427openalex-snapshot
Evolutionary Construction of Perfectly Balanced Boolean Functions
inferred← citeshttps://doi.org/10.1109/eeite69609.2026.11679807openalex-snapshot
Rapid Evolutionary Construction of Boolean Functions Using JIT-Optimized Genetic Algorithms
inferred← citeshttps://doi.org/10.1109/hst.2013.6581571openalex-snapshot
Design and implementation of rotation symmetric S-boxes with high nonlinearity and high DPA resilience
inferred← citeshttps://doi.org/10.1109/iadcc.2014.6779525openalex-snapshot
Generation of Boolean functions using Genetic Algorithm for cryptographic applications
inferred← citeshttps://doi.org/10.1109/icnc.2010.5584026openalex-snapshot
Improved hill-climbing methods in the design of bijective S-boxes
inferred← citeshttps://doi.org/10.1109/intelcct.2017.8324014openalex-snapshot
Annihilator immunity of a bent function
inferred← citeshttps://doi.org/10.1109/iseasp.2017.7976987openalex-snapshot
To get optimal bound of annihilator immunity by heuristic technique
inferred← citeshttps://doi.org/10.1109/isit.2019.8849385openalex-snapshot
Searching for Highly Nonlinear DPA-Resistant Balanced Boolean Functions in the Rotation Symmetric Class
inferred← citeshttps://doi.org/10.1109/itng.2009.102openalex-snapshot
The Design of Boolean Functions by Modified Hill Climbing Method
inferred← citeshttps://doi.org/10.1109/iwisa.2010.5473475openalex-snapshot
Optimization of S-Boxes by Evolving
inferred← citeshttps://doi.org/10.1109/picst57299.2022.10238674openalex-snapshot
Optimization of the PCF Cost Function for the Generation of Highly Nonlinear S-boxes
inferred← citeshttps://doi.org/10.1109/tc.2016.2569410openalex-snapshot
Construction of Rotation Symmetric S-Boxes with High Nonlinearity and Improved DPA Resistivity
inferred← citeshttps://doi.org/10.1109/tencon.2018.8650309openalex-snapshot
Analysis of Cost function using Genetic algorithm to construct balanced Boolean function
inferred← citeshttps://doi.org/10.1109/tit.2007.894696openalex-snapshot
Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class
inferred← citeshttps://doi.org/10.1109/tit.2009.2032736openalex-snapshot
Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
inferred← citeshttps://doi.org/10.1109/ukrmico52950.2021.9716660openalex-snapshot
Research of the Particle Swarm Method for Generating Nonlinear Substitutions
inferred← citeshttps://doi.org/10.1111/j.0824-7935.2004.00245.xopenalex-snapshot
Almost Boolean Functions: The Design of Boolean Functions by Spectral Inversion
inferred← citeshttps://doi.org/10.1111/j.0824-7935.2004.00246.xopenalex-snapshot
New Concepts in Evolutionary Search for Boolean Functions in Cryptology
inferred← citeshttps://doi.org/10.1137/16m1107826openalex-snapshot
Generalized Lexicographic MultiObjective Combinatorial Optimization. Application to Cryptography
inferred← citeshttps://doi.org/10.1145/1276958.1277112openalex-snapshot
An evolutionary multiobjective approach to design highly non-linear Boolean functions
inferred← citeshttps://doi.org/10.1145/2464576.2464671openalex-snapshot
Evolving cryptographically sound boolean functions
inferred← citeshttps://doi.org/10.1145/2556315.2556319openalex-snapshot
On using genetic algorithms for intrinsic side-channel resistance
inferred← citeshttps://doi.org/10.1145/2739480.2754764openalex-snapshot
Correlation Immunity of Boolean Functions
inferred← citeshttps://doi.org/10.1145/2739482.2764674openalex-snapshot
Heuristic Search by Particle Swarm Optimization of Boolean Functions for Cryptographic Applications
inferred← citeshttps://doi.org/10.1145/2908812.2908915openalex-snapshot
Evolving Algebraic Constructions for Designing Bent Boolean Functions
inferred← citeshttps://doi.org/10.1145/2908961.2927003openalex-snapshot
Evolutionary Computation and Cryptology
inferred← citeshttps://doi.org/10.1145/3067695.3067725openalex-snapshot
Evolutionary computation and cryptology
inferred← citeshttps://doi.org/10.1145/3067695.3084220openalex-snapshot
Designing bent boolean functions with parallelized linear genetic programming
inferred← citeshttps://doi.org/10.1145/3071178.3071284openalex-snapshot
Evolutionary algorithms for the design of orthogonal latin squares based on cellular automata
inferred← citeshttps://doi.org/10.1145/3319619.3322027openalex-snapshot
Does constraining the search space of GA always help?
inferred← citeshttps://doi.org/10.1145/3377929.3389886openalex-snapshot
Evolutionary computation and machine learning in cryptology
inferred← citeshttps://doi.org/10.1145/3449639.3459362openalex-snapshot
Evolutionary algorithms-assisted construction of cryptographic boolean functions
inferred← citeshttps://doi.org/10.1145/3449726.3461420openalex-snapshot
Evolutionary computation and machine learning in cryptology
inferred← citeshttps://doi.org/10.1145/3520304.3534087openalex-snapshot
Evolutionary computation and machine learning in security
inferred← citeshttps://doi.org/10.1145/3583133.3596355openalex-snapshot
A Search for Nonlinear Balanced Boolean Functions by Leveraging Phenotypic Properties
inferred← citeshttps://doi.org/10.1145/3703935.3704040openalex-snapshot
Construction and analysis of low-transparency RSBFs based on the idea of PSO algorithm
inferred← citeshttps://doi.org/10.1155/2013/270424openalex-snapshot
Classification of Boolean Functions Where Affine Functions Are Uniformly Distributed
inferred← citeshttps://doi.org/10.1155/2022/8188533openalex-snapshot
Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms
inferred← citeshttps://doi.org/10.1162/evco_a_00190openalex-snapshot
Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography
inferred← citeshttps://doi.org/10.1631/jzus.2005.a0358openalex-snapshot
On the construction of cryptographically strong boolean functions with desirable trade-off
inferred← citeshttps://doi.org/10.2298/fuee1103341sopenalex-snapshot
BDD based construction of resilient functions
inferred← citeshttps://doi.org/10.26636/jtit.2006.3.384openalex-snapshot
Random generation of Boolean functions with high degree of correlation immunity
inferred← citeshttps://doi.org/10.30837/rt.2021.3.206.06openalex-snapshot
Optimization of local search algorithm parameters for generating nonlinear substitutions
inferred← citeshttps://doi.org/10.3390/a16110499openalex-snapshot
Discovering Non-Linear Boolean Functions by Evolving Walsh Transforms with Genetic Programming
inferred← citeshttps://doi.org/10.3390/computers12080159openalex-snapshot
Genetic Approach to Improve Cryptographic Properties of Balanced Boolean Functions Using Bent Functions
inferred← citeshttps://doi.org/10.3390/cryptography9030056openalex-snapshot
Novel Approach to Degree, Balancedness, and Affine Equivalence of Boolean Functions and Construction of a Special Class of Non-Quadratic Balanced Boolean Functions
inferred← citeshttps://doi.org/10.3390/e22091052openalex-snapshot
Metaheuristics in the Optimization of Cryptographic Boolean Functions
inferred← citeshttps://doi.org/10.37055/sbn/135230openalex-snapshot
CRYPTANALYSIS USING NATURE-INSPIRED ALGORITHMS
inferred← citeshttps://doi.org/10.48550/arxiv.2111.13047openalex-snapshot
Deriving Smaller Orthogonal Arrays from Bigger Ones with Genetic Algorithm
inferred← citeshttps://doi.org/10.5120/ijca2016909333openalex-snapshot
Contravening Esotery: Cryptanalysis of Knapsack Cipher using Genetic Algorithms
inferred← citeshttps://doi.org/10.70675/2be63f9cz0af5z4e60z9b28z9a002fd1a49copenalex-snapshot
Cellular automata, boolean functions and combinatorial designs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.