On the public citation graph

An analysis of a class of algorithms for S-box construction

https://doi.org/10.1007/bf02318546
0 signed · 41 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1949.tb00928.xopenalex-snapshot
Communication Theory of Secrecy Systems*
inferredcites →https://doi.org/10.1007/0-387-34799-2_31openalex-snapshot
The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition
inferredcites →https://doi.org/10.1007/3-540-39466-4_18openalex-snapshot
Are Big S-Boxes Best?
inferredcites →https://doi.org/10.1007/3-540-39799-x_41openalex-snapshot
On the Design of S-Boxes
inferredcites →https://doi.org/10.1007/3-540-46416-6_30openalex-snapshot
An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks
inferredcites →https://doi.org/10.1007/3-540-46416-6_32openalex-snapshot
Perfect nonlinear S-boxes
inferredcites →https://doi.org/10.1007/3-540-46877-3_14openalex-snapshot
Propagation Characteristics of Boolean Functions
inferredcites →https://doi.org/10.1007/978-1-4612-4800-2openalex-snapshot
Probabilistic Analysis of Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-82865-2openalex-snapshot
Analysis and Design of Stream Ciphers
inferredcites →https://doi.org/10.1007/978-3-642-99970-3openalex-snapshot
Analytic Inequalities
inferredcites →https://doi.org/10.1007/978-3-663-12191-6openalex-snapshot
Fundamentals of the Average Case Analysis of Particular Algorithms
inferredcites →https://doi.org/10.1007/978-3-7091-2640-0_1openalex-snapshot
Elements of Cryptology
inferredcites →https://doi.org/10.1007/bf00190799openalex-snapshot
Methods and instruments for designing S-boxes
inferredcites →https://doi.org/10.1007/bf00203967openalex-snapshot
The structured design of cryptographically good s-boxes
inferredcites →https://doi.org/10.1007/bfb0030364openalex-snapshot
LOKI — A cryptographic primitive for authentication and secrecy applications
inferredcites →https://doi.org/10.1016/0097-3165(76)90024-8openalex-snapshot
On “bent” functions
inferredcites →https://doi.org/10.1016/0306-4573(81)90053-4openalex-snapshot
Coding and information theory
inferredcites →https://doi.org/10.1049/ip-a-1.1988.0054openalex-snapshot
Glass and its history of service
inferredcites →https://doi.org/10.1049/ip-e.1988.0044openalex-snapshot
Towards effective nonlinear cryptosystem design
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1080/0161-118491858746openalex-snapshot
LUCIFER, A CRYPTOGRAPHIC ALGORITHM
inferredcites →https://doi.org/10.1090/s0002-9947-1952-0045327-5openalex-snapshot
On the application of the Borel-Cantelli lemma
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/proc.1975.10005openalex-snapshot
Some cryptographic techniques for machine-to-machine data communications
inferredcites →https://doi.org/10.1109/tc.1979.1675242openalex-snapshot
Structured Design of Substitution-Permutation Encryption Networks
inferredcites →https://doi.org/10.1109/tit.1984.1056949openalex-snapshot
Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
inferredcites →https://doi.org/10.2307/2324448openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119183471.refsopenalex-snapshot
References
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-1-4419-8530-9_29openalex-snapshot
Generating Bent Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-17342-4openalex-snapshot
The Block Cipher Companion
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_7openalex-snapshot
The Design of Cryptographic S-Boxes Using CSPs
inferred← citeshttps://doi.org/10.1007/s11277-019-06474-zopenalex-snapshot
Steps Towards Redesigning Cryptosystems by a Non-associative Algebra of IP-Loops
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/dessert.2018.8409146openalex-snapshot
Evaluation of Algebraic Immunity of modern block ciphers
inferred← citeshttps://doi.org/10.1109/picst51311.2020.9467982openalex-snapshot
Non-Binary Cryptographic Functions for Symmetric Ciphers
inferred← citeshttps://doi.org/10.1145/988952.989019openalex-snapshot
Power-efficient ASIC synthesis of cryptographic sboxes
inferred← citeshttps://doi.org/10.12988/ijcms.2007.07148openalex-snapshot
A structure for fast data encryption
inferred← citeshttps://doi.org/10.26636/jtit.2003.4.205openalex-snapshot
A study of differences between bent functions constructed using Rothaus method and randomly generated bent functions
inferred← citeshttps://doi.org/10.30837/rt.2020.1.200.07openalex-snapshot
Computational algorithms for calculating the algebraic immunity of nonlinear nodes of replacing symmetric ciphers
inferred← citeshttps://doi.org/10.48550/arxiv.1202.1898openalex-snapshot
A Block Cipher using Rotation and Logical XOR Operations
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.