On the public citation graph
Fast and secure hashing based on codes
0 signed · 50 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/0-387-34805-0_39openalex-snapshot
A Design Principle for Hash Functions
inferredcites →https://doi.org/10.1007/0-387-34805-0_40openalex-snapshot
One Way Hash Functions and DES
inferredcites →https://doi.org/10.1007/3-540-38424-3_22openalex-snapshot
The MD4 Message Digest Algorithm
inferredcites →https://doi.org/10.1007/3-540-46885-4_43openalex-snapshot
How easy is collision search? Application to DES
inferredcites →https://doi.org/10.1007/3-540-48285-7_26openalex-snapshot
Collisions for the compression function of MD5
inferredcites →https://doi.org/10.1007/3-540-48329-2_31openalex-snapshot
Hash functions based on block ciphers: a synthetic approach
inferredcites →https://doi.org/10.1007/3-540-48329-2_32openalex-snapshot
Security of Iterated Hash Functions Based on Block Ciphers
inferredcites →https://doi.org/10.1007/3-540-60590-8_18openalex-snapshot
Improved characteristics for differential cryptanalysis of hash functions based on block ciphers
inferredcites →https://doi.org/10.1007/bfb0034837openalex-snapshot
Hash functions based on block ciphers and quaternary codes
inferredcites →https://doi.org/10.1007/bfb0053455openalex-snapshot
New attacks on all double block length hash functions of hash rate 1, including the Parallel-DM
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1145/191177.191231openalex-snapshot
Parallel collision search with application to hash functions and discrete logarithms
inferredcites →https://doi.org/10.1145/73007.73011openalex-snapshot
Universal one-way hash functions and their cryptographic applications
inferredcites →https://doi.org/10.3929/ethz-a-000646711openalex-snapshot
On the design and security of block ciphers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.3956openalex-snapshot
Variable message encryption through blockcipher compression function
inferred← citeshttps://doi.org/10.1007/10721064_24openalex-snapshot
Decorrelated Fast Cipher: An AES Candidate Well Suited for Low Cost Smart Cards Applications
inferred← citeshttps://doi.org/10.1007/11496618_24openalex-snapshot
Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
inferred← citeshttps://doi.org/10.1007/11799313_14openalex-snapshot
Some Plausible Constructions of Double-Block-Length Hash Functions
inferred← citeshttps://doi.org/10.1007/11935230_21openalex-snapshot
Combining Compression Functions and Block Cipher-Based Hash Functions
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-49162-7_21openalex-snapshot
Hash Functions and the MAC Using All-or-Nothing Property
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_11openalex-snapshot
New Constructions for Secure Hash Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_26openalex-snapshot
Making Hash Functions from Block Ciphers Secure and Efficient by Using Convolutional Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-74619-5_8openalex-snapshot
Security Analysis of Constructions Combining FIL Random Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-13858-4_6openalex-snapshot
Attacking the Knudsen-Preneel Compression Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-17373-8_5openalex-snapshot
Collision Attacks against the Knudsen-Preneel Compression Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-31410-0_16openalex-snapshot
The Collision Security of MDC-4
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_31openalex-snapshot
Provable Security of the Knudsen-Preneel Compression Functions
inferred← citeshttps://doi.org/10.1007/978-81-322-2202-6_47openalex-snapshot
A New (n, n) Blockcipher Hash Function Using Feistel Network: Apposite for RFID Security
inferred← citeshttps://doi.org/10.1007/bfb0024473openalex-snapshot
Hash functions and MAC algorithms based on block ciphers
inferred← citeshttps://doi.org/10.1007/bfb0054027openalex-snapshot
A cellular automaton based fast one-way hash function suitable for hardware implementation
inferred← citeshttps://doi.org/10.1007/s10623-015-0096-0openalex-snapshot
Open problems in hash function security
inferred← citeshttps://doi.org/10.1016/j.chaos.2008.09.056openalex-snapshot
One-way hash function construction based on chaotic map network
inferred← citeshttps://doi.org/10.1016/s1363-4127(97)81327-1openalex-snapshot
MACs and hash functions: State of the art
inferred← citeshttps://doi.org/10.1016/s1389-1286(01)00164-5openalex-snapshot
Cryptography on smart cards
inferred← citeshttps://doi.org/10.1049/el:19981641openalex-snapshot
Analysis of hash function of Yi and Lam
inferred← citeshttps://doi.org/10.1109/asiajcis.2014.27openalex-snapshot
A New (n, n) Blockcipher Hash Function: Apposite for Short Messages
inferred← citeshttps://doi.org/10.1109/comnetsat.2013.6870868openalex-snapshot
A topologically simple keyed hash function using a single robust absolute-value chaotic map
inferred← citeshttps://doi.org/10.1109/itcom.1999.781407openalex-snapshot
Error correcting codes and collision-resistant hashing
inferred← citeshttps://doi.org/10.1109/sai.2015.7237319openalex-snapshot
A chaos-based keyed hash function for secure protocol and messege authentication in mobile ad hoc wireless networks
inferred← citeshttps://doi.org/10.1109/tit.2002.801402openalex-snapshot
Construction of secure and fast hash functions using nonbinary error-correcting codes
inferred← citeshttps://doi.org/10.14569/ijacsa.2016.070182openalex-snapshot
A Robust Hash Function Using Cross-Coupled Chaotic Maps with Absolute-Valued Sinusoidal Nonlinearity
inferred← citeshttps://doi.org/10.1587/transfun.e97.a.1747openalex-snapshot
Cryptanalysis of Double-Block-Length Hash Modes MDC-4 and MJH
inferred← citeshttps://doi.org/10.2498/cit.1002639openalex-snapshot
Building Secure and Fast Cryptographic Hash Functions Using Programmable Cellular Automata
inferred← citeshttps://doi.org/10.46586/tosc.v2024.i1.71-113openalex-snapshot
Permutation-Based Hashing Beyond the Birthday Bound
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.