On the public citation graph
How to improve the nonlinearity of bijective S-boxes
0 signed · 88 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_39openalex-snapshot
A Recursive Construction Method of S-boxes Satisfying Strict Avalanche Criterion
inferredcites →https://doi.org/10.1007/3-540-46885-4_11openalex-snapshot
Non-linearity of Exponent Permutations
inferredcites →https://doi.org/10.1007/3-540-47555-9_8openalex-snapshot
On the construction of highly nonlinear permutations
inferredcites →https://doi.org/10.1007/3-540-48071-4_41openalex-snapshot
Provable Security Against Differential Cryptanalysis
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-48285-7_6openalex-snapshot
Differentially uniform mappings for cryptography
inferredcites →https://doi.org/10.1007/3-540-48285-7_7openalex-snapshot
On Almost Perfect Nonlinear Permutations
inferredcites →https://doi.org/10.1007/3-540-48658-5_35openalex-snapshot
Pitfalls in Designing Substitution Boxes
inferredcites →https://doi.org/10.1007/bfb0027923openalex-snapshot
On the security of self-synchronous ciphers
inferredcites →https://doi.org/10.1007/bfb0052334openalex-snapshot
New block encryption algorithm MISTY
inferredcites →https://doi.org/10.1007/bfb0053452openalex-snapshot
Relationships among nonlinearity criteria
inferredcites →https://doi.org/10.1049/el:19940157openalex-snapshot
Almost perfect nonlinear permutations
inferredcites →https://doi.org/10.1049/ip-e.1988.0044openalex-snapshot
Towards effective nonlinear cryptosystem design
inferredcites →https://doi.org/10.1049/ip-e.1989.0036openalex-snapshot
Error propagation property and application in cryptography
inferredcites →https://doi.org/10.1145/168588.168610openalex-snapshot
Systematic generation of cryptographically robust S-boxes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11496618_26openalex-snapshot
An Evolutionary Algorithm to Improve the Nonlinearity of Self-inverse S-Boxes
inferred← citeshttps://doi.org/10.1007/978-3-030-25283-0_11openalex-snapshot
Generation of 8-Bit S-Boxes Having Almost Optimal Cryptographic Properties Using Smaller 4-Bit S-Boxes and Finite Field Multiplication
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-71616-5_6openalex-snapshot
Simulation Model for Investigation of the Behaviour of an Artificial Immune Algorithm for Generation of S-Boxes with Good Cryptographic Properties
inferred← citeshttps://doi.org/10.1007/978-3-031-02472-6_4openalex-snapshot
Generation of Dynamical S-Boxes via Lag Time Chaotic Series for Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-319-29172-7_3openalex-snapshot
Cryptographically Strong S-Boxes Generated by Modified Immune Algorithm
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-540-79992-4_62openalex-snapshot
Cryptographically Strong S-Boxes Based on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-14403-5_63openalex-snapshot
Properties of Safe Cellular Automata-Based S-Boxes
inferred← citeshttps://doi.org/10.1007/978-3-642-16699-0_17openalex-snapshot
Application of Cellular Automata in Symmetric Key Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-23321-0_24openalex-snapshot
Improved Design of GPRS Wireless Security System Based on AES
inferred← citeshttps://doi.org/10.1007/978-3-642-27549-4_24openalex-snapshot
Dynamic Cellular Automata-Based S-Boxes
inferred← citeshttps://doi.org/10.1007/978-3-642-54525-2_20openalex-snapshot
A Novel Design of Chaos Based S-Box Using Difference Distribution Table (CD S-Box)
inferred← citeshttps://doi.org/10.1007/978-981-10-3223-3_33openalex-snapshot
Heuristic Approach for Nonlinear n × n (3 ≤ n ≤ 7) Substitution-Boxes
inferred← citeshttps://doi.org/10.1007/978-981-15-4032-5_35openalex-snapshot
Evolutionary Computing for Designing Cryptographic Primitives for Block Cipher: Challenges and Opportunities
inferred← citeshttps://doi.org/10.1007/bf03037656openalex-snapshot
The design of S-boxes by simulated annealing
inferred← citeshttps://doi.org/10.1007/s00034-017-0592-8openalex-snapshot
Programmable Cellular Automata-Based Low-Power Architecture to S-Box : An Application to WBAN
inferred← citeshttps://doi.org/10.1007/s00354-016-0302-2openalex-snapshot
Construction of Cryptographically Strong S-Boxes Inspired by Bee Waggle Dance
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/s00521-021-06260-8openalex-snapshot
Selective chaotic maps Tiki-Taka algorithm for the S-box generation and optimization
inferred← citeshttps://doi.org/10.1007/s10623-004-1700-xopenalex-snapshot
Nonlinearity of Some Invariant Boolean Functions
inferred← citeshttps://doi.org/10.1007/s10773-019-04188-3openalex-snapshot
Application Based Construction and Optimization of Substitution Boxes Over 2D Mixed Chaotic Maps
inferred← citeshttps://doi.org/10.1007/s10916-016-0622-2openalex-snapshot
Low Power S-Box Architecture for AES Algorithm using Programmable Second Order Reversible Cellular Automata: An Application to WBAN
inferred← citeshttps://doi.org/10.1007/s11042-019-07866-wopenalex-snapshot
A new construction of confusion component of block ciphers
inferred← citeshttps://doi.org/10.1007/s11277-018-5787-1openalex-snapshot
ABC Optimization Based Construction of Strong Substitution-Boxes
inferred← citeshttps://doi.org/10.1007/s12095-015-0170-5openalex-snapshot
Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties
inferred← citeshttps://doi.org/10.1007/s12652-021-03392-6openalex-snapshot
Evolving bijective S-Boxes using hybrid adaptive genetic algorithm with optimal cryptographic properties
inferred← citeshttps://doi.org/10.1007/s40998-018-0061-9openalex-snapshot
A Chaos-Based Substitution Box (S-Box) Design with Improved Differential Approximation Probability (DP)
inferred← citeshttps://doi.org/10.1016/j.asoc.2017.05.052openalex-snapshot
Designing bijective S-boxes using Algorithm Portfolios with limited time budgets
inferred← citeshttps://doi.org/10.1049/htl.2016.0033openalex-snapshot
Design of cryptographically secure AES like S‐Box using second‐order reversible cellular automata for wireless body area network applications
inferred← citeshttps://doi.org/10.1109/access.2020.3035163openalex-snapshot
Evolving Nonlinear S-Boxes With Improved Theoretical Resilience to Power Attacks
inferred← citeshttps://doi.org/10.1109/access.2021.3085861openalex-snapshot
Generating Cryptographic S-Boxes Using the Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/access.2021.3110761openalex-snapshot
A Framework for Fine-Grained Nonlinearity Optimization of Boolean and Vectorial Boolean Functions
inferred← citeshttps://doi.org/10.1109/cec.2003.1299870openalex-snapshot
Nature-inspired cryptography: past, present and future
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.2004.1331158openalex-snapshot
An effective evolutionary strategy for bijective S-boxes
inferred← citeshttps://doi.org/10.1109/cec.2007.4424934openalex-snapshot
Heuristic search for non-linear cryptanalytic approximations
inferred← citeshttps://doi.org/10.1109/cis.2007.51openalex-snapshot
An Effective Genetic Algorithm for Self-Inverse S-Boxes
inferred← citeshttps://doi.org/10.1109/cis.2007.86openalex-snapshot
Fuzzy Control System Based on Wavelet Analysis
inferred← citeshttps://doi.org/10.1109/icaccaf.2017.8344738openalex-snapshot
Comparative study of different cryptographic algorithms for data security in cloud computing
inferred← citeshttps://doi.org/10.1109/iccias.2006.295267openalex-snapshot
Utilizing Evolutionary Computation Methods for the Design of S-Boxes
inferred← citeshttps://doi.org/10.1109/iccsp.2017.8286361openalex-snapshot
FPGA implementation of hybrid linear cellular automata based encryption algorithm
inferred← citeshttps://doi.org/10.1109/iceie.2010.5559741openalex-snapshot
Design of S-boxes based on neural networks*
inferred← citeshttps://doi.org/10.1109/icitcs.2015.7292993openalex-snapshot
Linearity Test Framework for S-Box in Block Cipher
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/idaacs53288.2021.9660983openalex-snapshot
Comment on “Particle Swarm Optimization Based Highly Nonlinear Substitution-Boxes Generation for Security Applications”
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536378openalex-snapshot
Application of cellular automata to create S-box functions
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470699openalex-snapshot
CA-based generator of S-boxes for cryptography use
inferred← citeshttps://doi.org/10.1109/iwasid.2007.373730openalex-snapshot
AES Algorithm Implemented for PDA Secure Communication with Java
inferred← citeshttps://doi.org/10.1109/iwisa.2010.5473475openalex-snapshot
Optimization of S-Boxes by Evolving
inferred← citeshttps://doi.org/10.1109/picst51311.2020.9467982openalex-snapshot
Non-Binary Cryptographic Functions for Symmetric Ciphers
inferred← citeshttps://doi.org/10.1109/picst57299.2022.10238530openalex-snapshot
Research of Computational Complexity of Cost Functions in S-boxes Generation Problems
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.1142/s0218127415501278openalex-snapshot
A Method for Constructing Bijective S-Box with High Nonlinearity Based on Chaos and Optimization
inferred← citeshttps://doi.org/10.1145/2523514.2523525openalex-snapshot
S-box construction from non-permutation power functions
inferred← citeshttps://doi.org/10.1155/2014/701298openalex-snapshot
A Construction of Bent Functions of n + 2 Variables from a Bent Function of n Variables and Its Cyclic Shifts
inferred← citeshttps://doi.org/10.1155/2018/9389065openalex-snapshot
Sine‐Cosine Optimization‐Based Bijective Substitution‐Boxes Construction Using Enhanced Dynamics of Chaotic Map
inferred← citeshttps://doi.org/10.20868/upm.thesis.39054openalex-snapshot
Vector Boolean Functions: applications in symmetric cryptography
inferred← citeshttps://doi.org/10.2478/v10065-008-0022-4openalex-snapshot
Designing cryptographically strong S-boxes with the use of cellular automata
inferred← citeshttps://doi.org/10.30837/rt.2021.3.206.05openalex-snapshot
Investigation of heuristic search functions for nonlinear substitutions for symmetric cryptography
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/e20070525openalex-snapshot
A New Hyperchaotic System-Based Design for Efficient Bijective Substitution-Boxes
inferred← citeshttps://doi.org/10.3390/electronics12102338openalex-snapshot
Optimizing Hill Climbing Algorithm for S-Boxes Generation
inferred← citeshttps://doi.org/10.3390/math11020446openalex-snapshot
Enhancement of Non-Permutation Binomial Power Functions to Construct Cryptographically Strong S-Boxes
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.4213/mvk325openalex-snapshot
The change in linear and differential characteristics of substitution after the multiplication by transposition
inferred← citeshttps://doi.org/10.47836/mjms.16.4.04openalex-snapshot
A New Design of Substitution Box with Ideal Strict Avalanche Criterion
inferred← citeshttps://doi.org/10.70675/1755c2b0z58abz4edfz81d4zdcee38fd3e27openalex-snapshot
Contributions à l’analyse de canaux auxiliaires sans connaissance des clairs et chiffrés, et à la recherche de S-boxes compactes
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.