On the public citation graph

Attacking the SL 2 hashing scheme

0 signed · 25 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-48658-5_5openalex-snapshot
Hashing with SL 2
inferredcites →https://doi.org/10.1007/978-0-387-98144-4_3openalex-snapshot
Algorithms and Programming
inferredcites →https://doi.org/10.1007/bf01388652openalex-snapshot
Hash functions and Cayley graphs
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/conm/022openalex-snapshot
Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers

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/11927587_4openalex-snapshot
Hashing with Polynomials
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-49248-8_3openalex-snapshot
Cryptographic Primitives for Information Authentication — State of the Art
inferred← citeshttps://doi.org/10.1007/3-540-69710-1_7openalex-snapshot
On the Security of the Hashing Scheme Based on SL 2
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_6openalex-snapshot
Cryptanalysis of Two Cryptosystems Based on Group Actions
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-642-00862-7_12openalex-snapshot
Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security
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/bfb0000419openalex-snapshot
Advances in Cryptology — ASIACRYPT'94
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.1109/icecs.2008.4675001openalex-snapshot
Efficiency and pseudo-randomness of a variant of Zémor-Tillich hash function
inferred← citeshttps://doi.org/10.1201/9781420049503-c41openalex-snapshot
Crypto Topics and Applications I
inferred← citeshttps://doi.org/10.1201/9781584888215-c12openalex-snapshot
Crypto Topics and Applications I
inferred← citeshttps://doi.org/10.3233/jcs-1997-5303openalex-snapshot
Authentication of sequences with the SL2 hash function: application to video sequences
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5250openalex-snapshot
Cryptographic Hash Functions in Groups and Provable Properties
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.