On the public citation graph
An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions
0 signed · 62 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/bf00196773openalex-snapshot
Local randomness in pseudorandom sequences
inferredcites →https://doi.org/10.1007/bf01388386openalex-snapshot
Three characterizations of non-binary correlation-immune and 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.1016/0012-365x(72)90025-8openalex-snapshot
Nearly perfect binary codes
inferredcites →https://doi.org/10.1016/s0019-9958(68)90874-7openalex-snapshot
A class of optimum nonlinear double-error-correcting codes
inferredcites →https://doi.org/10.1016/s0019-9958(72)90376-2openalex-snapshot
A class of low-rate nonlinear binary codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/sfcs.1985.55openalex-snapshot
The bit extraction problem or t-resilient functions
inferredcites →https://doi.org/10.1109/tit.1987.1057356openalex-snapshot
An updated table of minimum-distance bounds for binary linear codes
inferredcites →https://doi.org/10.1137/0217014openalex-snapshot
Privacy Amplification by Public Discussion
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1998.2763openalex-snapshot
On Cryptographic Propagation Criteria for Boolean Functions
inferred← citeshttps://doi.org/10.1007/3-540-36178-2_29openalex-snapshot
Improved Construction of Nonlinear Resilient S-Boxes
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_27openalex-snapshot
Nonlinear Vector Resilient 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-45537-x_5openalex-snapshot
Linear Codes in Constructing Resilient Functions with High Nonlinearity
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_22openalex-snapshot
On Nonlinear Resilient Functions
inferred← citeshttps://doi.org/10.1007/3-540-60865-6_52openalex-snapshot
On the security of nonlinear filter generators
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_28openalex-snapshot
Almost k-wise Independent Sample Spaces and Their Cryptologic Applications
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-030-38471-5_1openalex-snapshot
Looking Back—My Life as a Mathematician and Cryptographer
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_17openalex-snapshot
Vectorial Functions and Covering Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-71039-4_21openalex-snapshot
Post-Processing Functions for a Biased Physical Random Number Generator
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_46openalex-snapshot
Corruption and Recovery-Efficient Locally Decodable Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-25286-0_9openalex-snapshot
BUPLE: Securing Passive RFID Communication through Physical Layer Enhancements
inferred← citeshttps://doi.org/10.1007/978-3-662-48865-2_6openalex-snapshot
The Symmetric Property of Boolean Functions
inferred← citeshttps://doi.org/10.1007/bf02828649openalex-snapshot
Construction of resilient functions
inferred← citeshttps://doi.org/10.1007/bfb0023289openalex-snapshot
On construction of resilient functions
inferred← citeshttps://doi.org/10.1007/bfb0054146openalex-snapshot
On the propagation criterion of degree l and order k
inferred← citeshttps://doi.org/10.1007/s00145-001-0010-yopenalex-snapshot
Almost k -Wise Independent Sample Spaces and Their Cryptologic Applications
inferred← citeshttps://doi.org/10.1007/s00200-008-0061-5openalex-snapshot
t-resilient functions and the partial exposure problem
inferred← citeshttps://doi.org/10.1007/s40314-020-01402-5openalex-snapshot
Iterative estimation of Sobol’ indices based on replicated designs
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.09.009openalex-snapshot
Correlation immunity and resiliency of symmetric Boolean functions
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00150-xopenalex-snapshot
Two results on the bit extraction problem
inferred← citeshttps://doi.org/10.1017/cbo9780511780448.012openalex-snapshot
Vectorial Boolean Functions for Cryptography
inferred← citeshttps://doi.org/10.1023/a:1008207230165openalex-snapshot
Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions
inferred← citeshttps://doi.org/10.1023/a:1008209004667openalex-snapshot
Some New Results on Key Distribution Patterns and Broadcast Encryption
inferred← citeshttps://doi.org/10.1023/a:1008337029047openalex-snapshot
Correlation-Immune and Resilient Functions Over a Finite Alphabet and Their Applications in Cryptography
inferred← citeshttps://doi.org/10.1109/18.623184openalex-snapshot
Cryptographically resilient functions
inferred← citeshttps://doi.org/10.1109/18.782141openalex-snapshot
On the constructions of new resilient functions from old ones
inferred← citeshttps://doi.org/10.1109/ccc.2001.933886openalex-snapshot
On the power of nonlinear secret-sharing
inferred← citeshttps://doi.org/10.1109/isit.1995.550470openalex-snapshot
Applications of coding and design theory to constructing the maximum resilient systems of functions
inferred← citeshttps://doi.org/10.1109/isit.2008.4595266openalex-snapshot
Fast computation of Boolean influences
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/tdsc.2010.48openalex-snapshot
Three Improved Algorithms for Multipath Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission
inferred← citeshttps://doi.org/10.1109/tir.2002.800492openalex-snapshot
Linear codes in generalized construction of resilient functions with very high nonlinearity
inferred← citeshttps://doi.org/10.1109/tit.2002.807297openalex-snapshot
A construction of resilient functions with high nonlinearity
inferred← citeshttps://doi.org/10.1109/tit.2004.836684openalex-snapshot
Almost Security of Cryptographic Boolean Functions
inferred← citeshttps://doi.org/10.1109/tit.2004.839524openalex-snapshot
Improved Construction of Nonlinear Resilient S-Boxes
inferred← citeshttps://doi.org/10.1109/tit.2009.2027483openalex-snapshot
Analysis and Construction of Correctors
inferred← citeshttps://doi.org/10.1109/tit.2014.2300067openalex-snapshot
Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2780233openalex-snapshot
Some Results on the Existence of $t$ -All-or-Nothing Transforms Over Arbitrary Alphabets
inferred← citeshttps://doi.org/10.1137/s0895480102412868openalex-snapshot
On the Power of Nonlinear Secret-Sharing
inferred← citeshttps://doi.org/10.1137/s0895480194270950openalex-snapshot
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds
inferred← citeshttps://doi.org/10.1145/1046290.1046327openalex-snapshot
New construction of resilient functions with satisfying multiple cryptographic criteria
inferred← citeshttps://doi.org/10.1587/transfun.e97.a.1405openalex-snapshot
Highly Nonlinear Resilient Functions without Linear Structures
inferred← citeshttps://doi.org/10.4213/mvk136openalex-snapshot
Асимптотические оценки для чисел двоичных отображений с заданными криптографическими свойствами
inferred← citeshttps://doi.org/10.4213/mvk79openalex-snapshot
Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров
inferred← citeshttps://doi.org/10.48550/arxiv.1003.3492openalex-snapshot
Generalized Maiorana-McFarland Constructions for Almost Optimal Resilient Functions
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.