On the public citation graph
Hash functions and Cayley graphs
0 signed · 55 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-16767-6_67openalex-snapshot
Can a fast signature scheme without secret key be secure
inferredcites →https://doi.org/10.1007/3-540-45961-8_9openalex-snapshot
Manipulations and Errors, Detection and Localization
inferredcites →https://doi.org/10.1007/3-540-57843-9_12openalex-snapshot
Group-theoretic hash functions
inferredcites →https://doi.org/10.1007/978-1-4684-0255-1openalex-snapshot
Introduction to Elliptic Curves and Modular Forms
inferredcites →https://doi.org/10.1007/bf02579283openalex-snapshot
Explicit constructions of graphs without short cycles and low density codes
inferredcites →https://doi.org/10.1016/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
inferredcites →https://doi.org/10.1016/0304-3975(85)90047-7openalex-snapshot
The complexity of finding minimum-length generator sequences
inferredcites →https://doi.org/10.1016/s0195-6698(89)80067-8openalex-snapshot
Small-diameter Cayley Graphs for Finite Simple Groups
inferredcites →https://doi.org/10.1090/pspum/008/0182610openalex-snapshot
On the estimation of Fourier coefficients of modular forms
inferredcites →https://doi.org/10.1090/s0894-0347-1989-0965008-xopenalex-snapshot
Diameters and Eigenvalues
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199807)12:4<335::aid-rsa2>3.0.co;2-uopenalex-snapshot
The action of a few permutations onr-tuples is quickly transitive
inferred← citeshttps://doi.org/10.1006/jnth.1998.2276openalex-snapshot
Dynamique des fractions continues à contraintes périodiques
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_18openalex-snapshot
Weaknesses in the SL2($$ \mathbb{F}_{2^n } $$) Hashing Scheme
inferred← citeshttps://doi.org/10.1007/3-540-48969-x_8openalex-snapshot
The State of Cryptographic Hash Functions
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_26openalex-snapshot
A Functional Cryptosystem Using a Group Action
inferred← citeshttps://doi.org/10.1007/3-540-49248-8_3openalex-snapshot
Cryptographic Primitives for Information Authentication — State of the Art
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_31openalex-snapshot
The action of a few random permutations on r-tuples and an application to cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-58411-4_18openalex-snapshot
Faster Cryptographic Hash Function from Supersingular Isogeny Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-68032-3_6openalex-snapshot
Cryptographic Hash Functions and Some Applications to Information Security
inferred← citeshttps://doi.org/10.1007/978-3-319-76578-5_13openalex-snapshot
A Practical Cryptanalysis of WalnutDSA$$^{\text {TM}}$$
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_25openalex-snapshot
Pseudorandom Graphs from Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-540-78967-3_15openalex-snapshot
Collisions for the LPS Expander Graph Hash Function
inferred← citeshttps://doi.org/10.1007/978-3-540-85855-3_18openalex-snapshot
Full Cryptanalysis of LPS and Morgenstern Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-19574-7_20openalex-snapshot
Preimages for the Tillich-Zémor Hash Function
inferred← citeshttps://doi.org/10.1007/978-981-95-6857-4_15openalex-snapshot
PoC Hash: A Power-of-Commutators Hash over Hamiltonian Quaternions
inferred← citeshttps://doi.org/10.1007/978-981-96-1218-5_20openalex-snapshot
Toward Hash Functions Based on Group-Subgroup Pair Graphs
inferred← citeshttps://doi.org/10.1007/bfb0054026openalex-snapshot
Public-key cryptosystems using the modular group
inferred← citeshttps://doi.org/10.1007/s00145-007-9002-xopenalex-snapshot
Cryptographic Hash Functions from Expander Graphs
inferred← citeshttps://doi.org/10.1007/s00145-010-9063-0openalex-snapshot
Cryptanalysis of the Tillich–Zémor Hash Function
inferred← citeshttps://doi.org/10.1007/s10623-012-9743-xopenalex-snapshot
Towards factoring in $${SL(2,\,\mathbb{F}_{2^n})}$$
inferred← citeshttps://doi.org/10.1007/s10623-022-01152-xopenalex-snapshot
Cayley sum graphs and their applications to codebooks
inferred← citeshttps://doi.org/10.1007/s11071-016-2652-1openalex-snapshot
Chaotic hash function based on the dynamic S-Box with variable parameters
inferred← citeshttps://doi.org/10.1007/s44007-024-00096-zopenalex-snapshot
Applications of Finite Non-Abelian Simple Groups to Cryptography in the Quantum Era
inferred← citeshttps://doi.org/10.1016/0167-4048(92)90007-eopenalex-snapshot
Requirements for cryptographic hash functions
inferred← citeshttps://doi.org/10.1016/j.laa.2017.04.031openalex-snapshot
Shift lifts preserving Ramanujan property
inferred← citeshttps://doi.org/10.1017/cbo9780511842467.008openalex-snapshot
Group theory in cryptography
inferred← citeshttps://doi.org/10.1017/s0004972700034055openalex-snapshot
Groups with a Cayley graph isomorphic to a hypercube
inferred← citeshttps://doi.org/10.1080/09720529.2019.1638613openalex-snapshot
Security aspects of the Cayley hash function using discrete heisenberg group
inferred← citeshttps://doi.org/10.1155/2023/7588535openalex-snapshot
Block Encryption and Decryption of a Sentence Using Decomposition of the Turan Graph
inferred← citeshttps://doi.org/10.1515/jmc-2019-0033openalex-snapshot
New Zémor-Tillich Type Hash Functions Over GL 2 (𝔽 p n )
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.1891openalex-snapshot
Full Cryptanalysis of Hash Functions Based on Cubic Ramanujan Graphs
inferred← citeshttps://doi.org/10.31274/rtd-180813-15958openalex-snapshot
An algebraic hash function based on SL2
inferred← citeshttps://doi.org/10.47836/mjms.18.2.10openalex-snapshot
Encryption and Decryption Using Decomposition of Complete Graph K3(6n+1)
inferred← citeshttps://doi.org/10.48550/arxiv.1502.07410openalex-snapshot
Towards Constructing Ramanujan Graphs Using Shift Lifts
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5250openalex-snapshot
Cryptographic Hash Functions in Groups and Provable Properties
inferred← citeshttps://doi.org/10.51286/albjm/1656414764openalex-snapshot
KEYED HASH FUNCTION FROM LARGE GIRTH EXPANDER GRAPHS
inferred← citeshttps://doi.org/10.70675/37a7a358zfc40z4a36zb409z363eec150800openalex-snapshot
Anneaux d'endomorphismes en cryptographie
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.