On the public citation graph
An effective genetic algorithm for finding highly nonlinear boolean functions
0 signed · 81 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-46885-4_53openalex-snapshot
Nonlinearity Criteria for Cryptographic Functions
inferredcites →https://doi.org/10.1007/bf00190799openalex-snapshot
Methods and instruments for designing S-boxes
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-119691884807openalex-snapshot
COMBINATORIAL OPTIMIZATION AND THE KNAPSACK CIPHER
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
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/11844297_86openalex-snapshot
Lamar: A New Pseudorandom Number Generator Evolved by Means of Genetic Programming
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-44706-7_21openalex-snapshot
Efficient Methods for Generating MARS-Like S-Boxes
inferred← citeshttps://doi.org/10.1007/3-540-45110-2_100openalex-snapshot
Secret Agents Leave Big Footprints: How to Plant a Cryptographic Trapdoor, and Why You Might Not Get Away with It
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-48970-3_1openalex-snapshot
Boolean Function Design Using Hill Climbing Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-16670-0_15openalex-snapshot
Comparison of Genetic Programming Methods on Design of Cryptographic Boolean Functions
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-41579-2_24openalex-snapshot
Parallel Steepest Ascent Hill-Climbing for High Nonlinear Boolean and Vectorial Boolean Functions (S-Boxes)
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-33017-9_21openalex-snapshot
Weightwise Perfectly Balanced Functions and Nonlinearity
inferred← citeshttps://doi.org/10.1007/978-3-031-70085-9_27openalex-snapshot
Discovering Rotation Symmetric Self-dual Bent Functions with Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-89991-1_2openalex-snapshot
A Systematic Evaluation of Evolving Highly Nonlinear Boolean Functions in Odd Sizes
inferred← citeshttps://doi.org/10.1007/978-3-319-56549-1_26openalex-snapshot
Applications of Soft Computing in Cryptology
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-77272-9_7openalex-snapshot
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
inferred← citeshttps://doi.org/10.1007/978-3-642-25566-3_23openalex-snapshot
Designing Stream Cipher Systems Using Genetic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-35404-5_21openalex-snapshot
Improvement in Non-linearity of Carlet-Feng Infinite Class of Boolean Functions
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/bf03037654openalex-snapshot
Evolutionary Computation in computer security and cryptography
inferred← citeshttps://doi.org/10.1007/bfb0054148openalex-snapshot
Heuristic design of cryptographically strong balanced Boolean functions
inferred← citeshttps://doi.org/10.1007/s00034-024-02969-8openalex-snapshot
Miniaturization of Insertable Cardiac Monitor: ECG Signal Processing Based on Stochastic Computing
inferred← citeshttps://doi.org/10.1007/s10710-023-09476-wopenalex-snapshot
Semantic mutation operator for a fast and efficient design of bent Boolean functions
inferred← citeshttps://doi.org/10.1007/s10710-025-09526-5openalex-snapshot
A systematic study on the design of odd-sized highly nonlinear boolean functions via evolutionary algorithms
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/b978-0-12-802318-1.00007-8openalex-snapshot
Bent Functions with a Small Number of Variables
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.1080/18756891.2011.9727842openalex-snapshot
On the Application of Evolutionary Computation Techniques in Designing Stream Cipher Systems
inferred← citeshttps://doi.org/10.1109/access.2021.3087139openalex-snapshot
Human Behaviour Based Optimization Supported With Self-Organizing Maps for Solving the S-Box Design Problem
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.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/cec48606.2020.9185517openalex-snapshot
Evolving Cryptographic Boolean Functions with Minimal Multiplicative Complexity
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/icnc.2010.5584026openalex-snapshot
Improved hill-climbing methods in the design of bijective S-boxes
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/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.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.1145/1276958.1277112openalex-snapshot
An evolutionary multiobjective approach to design highly non-linear Boolean functions
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.3084220openalex-snapshot
Designing bent boolean functions with parallelized linear genetic programming
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/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.30837/rt.2018.4.195.15openalex-snapshot
Heuristic methods for gradient search of cryptographic Boolean functions
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/e22091052openalex-snapshot
Metaheuristics in the Optimization of Cryptographic Boolean Functions
inferred← citeshttps://doi.org/10.4018/978-1-4666-9426-2.ch002openalex-snapshot
Computational Intelligence in Cryptology
inferred← citeshttps://doi.org/10.4018/978-1-5225-1759-7.ch065openalex-snapshot
Computational Intelligence in Cryptology
inferred← citeshttps://doi.org/10.4213/mvk227openalex-snapshot
Spectral-linear and spectral-differential methods for generating S-boxes having almost optimal cryptographic parameters
inferred← citeshttps://doi.org/10.47839/ijc.18.3.1519openalex-snapshot
HEURISTIC METHODS FOR THE DESIGN OF CRYPTOGRAPHIC BOOLEAN FUNCTIONS
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.