On the public citation graph
Probability to meet in the middle
0 signed · 37 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/978-1-4684-4730-9_17openalex-snapshot
Producing a One-Way Hash Function from DES
inferredcites →https://doi.org/10.1007/978-1-4684-4730-9_18openalex-snapshot
On the Security of Compressed Encodings
inferredcites →https://doi.org/10.1007/bf00206323openalex-snapshot
Is the Data Encryption Standard a group? (Results of cycling experiments on DES)
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.1080/0161-118391857982openalex-snapshot
DES-GENERATED CHECKSUMS FOR ELECTRONIC SIGNATURES
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.2307/1401805openalex-snapshot
An Introduction to Probability Theory and Its Applications, Vol. 2
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-54195-0_66openalex-snapshot
Duality between two cryptographic primitives
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_20openalex-snapshot
Results of switching-closure-test on FEAL
inferred← citeshttps://doi.org/10.1007/3-540-60693-9_10openalex-snapshot
Computation of low-weight parity checks for correlation attacks on stream ciphers
inferred← citeshttps://doi.org/10.1007/3-540-60865-6_37openalex-snapshot
Attacks on the HKM / HFX cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-60865-6_51openalex-snapshot
Correlation attacks on stream ciphers: Computing low-weight parity checks based on error-correcting codes
inferred← citeshttps://doi.org/10.1007/978-1-4615-2694-0_22openalex-snapshot
Using Zech’s Logarithm to Find Low-Weight Parity Checks for Linear Recurring Sequences
inferred← citeshttps://doi.org/10.1007/978-3-031-30634-1_8openalex-snapshot
Collision Attacks on Round-Reduced SHA-3 Using Conditional Internal Differentials
inferred← citeshttps://doi.org/10.1007/978-3-540-74472-6_76openalex-snapshot
Content-Based Image Watermarking Via Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-10868-6_22openalex-snapshot
An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_22openalex-snapshot
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
inferred← citeshttps://doi.org/10.1007/978-3-662-46447-2_6openalex-snapshot
Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-94-007-5699-1_96openalex-snapshot
Preventing Blackhole Attack in DSR-Based Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/pl00003816openalex-snapshot
Parallel Collision Search with Cryptanalytic Applications
inferred← citeshttps://doi.org/10.1007/s10114-005-0632-3openalex-snapshot
Solving the Multi–discrete Logarithm Problems over a Group of Elliptic Curves with Prime Order
inferred← citeshttps://doi.org/10.1016/j.dam.2012.02.019openalex-snapshot
A non-uniform birthday problem with applications to discrete logarithms
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00444-4openalex-snapshot
Analysis of 3gpp-MAC and two-key 3gpp-MAC
inferred← citeshttps://doi.org/10.1049/ip-vis:20020168openalex-snapshot
Toward secure public-key blockwise fragile authentication watermarking
inferred← citeshttps://doi.org/10.1093/comjnl/bxad009openalex-snapshot
Explicit Upper Bound Of Impossible Differentials For AES-Like Ciphers: Application To uBlock And Midori
inferred← citeshttps://doi.org/10.1109/icip.2001.958536openalex-snapshot
Toward a secure public-key blockwise fragile authentication watermarking
inferred← citeshttps://doi.org/10.1140/epjst/e2019-900044-xopenalex-snapshot
An overview of memristive cryptography
inferred← citeshttps://doi.org/10.1145/191177.191231openalex-snapshot
Parallel collision search with application to hash functions and discrete logarithms
inferred← citeshttps://doi.org/10.14209/sbrt.2000.5150124openalex-snapshot
Um Modo de Operação de Funções de Hashing para Localizar Alterações em Dados Digitalmente Assinados
inferred← citeshttps://doi.org/10.4213/mvk290openalex-snapshot
How much data may be safely processed on one key in different modes?
inferred← citeshttps://doi.org/10.46586/tosc.v2017.i2.162-176openalex-snapshot
Cryptanalysis of PMACx, PMAC2x, and SIVx
inferred← citeshttps://doi.org/10.5753/sbseg.2014.20145openalex-snapshot
Decentralized management of One-Time Pad key material for a group
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
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.