On the public citation graph
Hash functions based on block ciphers and quaternary codes
0 signed · 43 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_38openalex-snapshot
How easy is collision search. New results and applications to DES
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-44750-4_22openalex-snapshot
A Key-schedule Weakness in SAFER K-64
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-57220-1_55openalex-snapshot
On the power of memory in the design of collision resistant hash functions
inferredcites →https://doi.org/10.1007/bfb0030364openalex-snapshot
LOKI — A cryptographic primitive for authentication and secrecy applications
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.1007/s001459900035openalex-snapshot
Attacks on Fast Double Block Length Hash Functions
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/tse.1987.233150openalex-snapshot
Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys
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.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-44448-3_37openalex-snapshot
Cryptanalysis of the Yi-Lam Hash
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-04117-4_4openalex-snapshot
Cryptographic Hash Functions
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-34961-4_31openalex-snapshot
Provable Security of the Knudsen-Preneel Compression Functions
inferred← citeshttps://doi.org/10.1007/bfb0024473openalex-snapshot
Hash functions and MAC algorithms based on block ciphers
inferred← citeshttps://doi.org/10.1007/bfb0052257openalex-snapshot
Fast and secure hashing based on codes
inferred← citeshttps://doi.org/10.1049/el:19981641openalex-snapshot
Analysis of hash function of Yi and Lam
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.10.2575openalex-snapshot
A Security Analysis of Double-Block-Length Hash Functions with the Rate 1
inferred← citeshttps://doi.org/10.1109/9780470544839.ch28openalex-snapshot
A Cost-Effective, High-Bandwidth Storage Architecture
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.1145/291006.291029openalex-snapshot
A cost-effective, high-bandwidth storage architecture
inferred← citeshttps://doi.org/10.4213/mvk79openalex-snapshot
Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5333openalex-snapshot
Design and Analysis of Multi-Block-Length Hash 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.