On the public citation graph

On the propagation criterion of degree l and order k

https://doi.org/10.1007/bfb0054146
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.1007/3-540-39799-x_41openalex-snapshot
On the Design of S-Boxes
inferredcites →https://doi.org/10.1007/3-540-46416-6_12openalex-snapshot
Boolean Functions Satisfying Higher Order Propagation Criteria
inferredcites →https://doi.org/10.1007/3-540-46766-1_6openalex-snapshot
On Correlation-immune functions
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-46885-4_53openalex-snapshot
Nonlinearity Criteria for Cryptographic Functions
inferredcites →https://doi.org/10.1007/3-540-48405-1openalex-snapshot
Advances in Cryptology — CRYPTO’ 99
inferredcites →https://doi.org/10.1007/3-540-48658-5_24openalex-snapshot
Bounds for Resilient Functions and Orthogonal Arrays
inferredcites →https://doi.org/10.1007/3-540-68339-9_25openalex-snapshot
Construction of t-Resilient Functions over a Finite Alphabet
inferredcites →https://doi.org/10.1007/3-540-68697-5_28openalex-snapshot
Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations
inferredcites →https://doi.org/10.1007/3-540-69053-0_29openalex-snapshot
More Correlation-Immune and Resilient Functions over Galois Fields and Galois Rings
inferredcites →https://doi.org/10.1007/3-540-69053-0_30openalex-snapshot
Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria
inferredcites →https://doi.org/10.1007/bf00202271openalex-snapshot
An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions
inferredcites →https://doi.org/10.1007/bf01388407openalex-snapshot
A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with preparata parameters
inferredcites →https://doi.org/10.1007/bfb0052332openalex-snapshot
The interpolation attack on block ciphers
inferredcites →https://doi.org/10.1016/0012-365x(90)90010-fopenalex-snapshot
On the delsarte-goethals codes and their formal duals
inferredcites →https://doi.org/10.1016/0097-3165(76)90024-8openalex-snapshot
On “bent” functions
inferredcites →https://doi.org/10.1016/s0019-9958(73)80007-5openalex-snapshot
Four fundamental parameters of a code and their combinatorial significance
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/18.312154openalex-snapshot
The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
inferredcites →https://doi.org/10.13016/m2ms3k194openalex-snapshot
Elementary Hadamard Difference Sets

What points at this work

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

inferred← citeshttps://doi.org/10.1006/ffta.2001.0332openalex-snapshot
Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions
inferred← citeshttps://doi.org/10.1006/inco.1998.2763openalex-snapshot
On Cryptographic Propagation Criteria for 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-44448-3_36openalex-snapshot
On Relationships among Avalanche, Nonlinearity, and Correlation Immunity
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_36openalex-snapshot
Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-12146-4_15openalex-snapshot
Cheating-Immune Secret Sharing Schemes from Maiorana-McFarland Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-0348-7865-4_9openalex-snapshot
On the Propagation Criterion of Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-89641-8_19openalex-snapshot
Construction of Resilient Functions with Multiple Cryptographic Criteria
inferred← citeshttps://doi.org/10.1007/s11401-010-0621-4openalex-snapshot
Vectorial resilient PC(l) of order k Boolean functions from AG-codes
inferred← citeshttps://doi.org/10.1007/s12095-012-0076-4openalex-snapshot
Cheating-immune secret sharing schemes from codes and cumulative arrays
inferred← citeshttps://doi.org/10.1016/b978-0-12-374890-4.00007-0openalex-snapshot
Avalanche and propagation criteria
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00319-5openalex-snapshot
Connections among nonlinearity, avalanche and correlation immunity
inferred← citeshttps://doi.org/10.1109/18.923730openalex-snapshot
On cryptographic properties of the cosets of R(1, m)
inferred← citeshttps://doi.org/10.1109/chinacom.2009.5339811openalex-snapshot
New construction of Boolean functions which satisfy multiple cryptographic criteria
inferred← citeshttps://doi.org/10.1109/issa.2016.7802926openalex-snapshot
SHA-1 and the Strict Avalanche Criterion
inferred← citeshttps://doi.org/10.1109/itw.1998.706485openalex-snapshot
On cryptographic propagation criteria for Boolean functions
inferred← citeshttps://doi.org/10.1109/itw.2005.1531898openalex-snapshot
A construction of resilient functions with satisfying synthetical cryptographic criteria
inferred← citeshttps://doi.org/10.1109/tit.2004.836684openalex-snapshot
Almost Security of Cryptographic Boolean Functions
inferred← citeshttps://doi.org/10.1145/1046290.1046327openalex-snapshot
New construction of resilient functions with satisfying multiple cryptographic criteria
inferred← citeshttps://doi.org/10.3233/jifs-213591openalex-snapshot
Nonlinearity of nonbalanced and nearly bent boolean functions based on Galois ring
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.