On the public citation graph
Security of VSH in the Real World
0 signed · 17 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/11761679_11openalex-snapshot
VSH, an Efficient and Provable Collision-Resistant Hash Function
inferredcites →https://doi.org/10.1007/3-540-68697-5_1openalex-snapshot
Keying Hash Functions for Message Authentication
inferredcites →https://doi.org/10.1007/pl00003816openalex-snapshot
Parallel Collision Search with Cryptanalytic Applications
inferredcites →https://doi.org/10.1090/pspum/020/0316385openalex-snapshot
Class number, a theory of factorization, and genera
inferredcites →https://doi.org/10.17487/rfc2104openalex-snapshot
HMAC: Keyed-Hashing for Message Authentication
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11958239_15openalex-snapshot
Discrete Logarithm Variants of VSH
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_9openalex-snapshot
How to Build a Hash Function from Any Collision-Resistant Function
inferred← citeshttps://doi.org/10.1007/978-3-540-77026-8_1openalex-snapshot
Linearization Attacks Against Syndrome Based Hashes
inferred← citeshttps://doi.org/10.1007/978-3-642-01440-6_1openalex-snapshot
The State of Hash Functions and the NIST SHA-3 Competition
inferred← citeshttps://doi.org/10.1007/978-3-642-11925-5_1openalex-snapshot
The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition
inferred← citeshttps://doi.org/10.1007/978-3-642-16280-0_8openalex-snapshot
Interpreting Hash Function Security Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-16825-3_17openalex-snapshot
Preimage Attacks against Variants of Very Smooth Hash
inferred← citeshttps://doi.org/10.1007/s10623-010-9391-yopenalex-snapshot
Whirlwind: a new cryptographic hash function
inferred← citeshttps://doi.org/10.1109/ares.2008.34openalex-snapshot
On the Security of VSH in Password Schemes
inferred← citeshttps://doi.org/10.1109/ares.2009.25openalex-snapshot
Finding Preimages of Multiple Passwords Secured with VSH
inferred← citeshttps://doi.org/10.1515/jmc.2007.016openalex-snapshot
Statistical distribution and collisions of VSH
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.