On the public citation graph

A new identification algorithm

0 signed · 24 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/0-387-34805-0_54openalex-snapshot
An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-48329-2_2openalex-snapshot
A new identification scheme based on syndrome decoding
inferredcites →https://doi.org/10.1007/bfb0030367openalex-snapshot
A (non-practical) three-pass identification protocol using coding theory
inferredcites →https://doi.org/10.1049/el:19941106openalex-snapshot
Improved Girault identification scheme
inferredcites →https://doi.org/10.1109/tit.1978.1055873openalex-snapshot
On the inherent intractability of certain coding problems (Corresp.)
inferredcites →https://doi.org/10.1134/11122.1608-3253openalex-snapshot
Problems of Information Transmission

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-44448-3_4openalex-snapshot
Cryptanalysis of the TTM Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_24openalex-snapshot
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
inferred← citeshttps://doi.org/10.1007/3-540-69710-1_10openalex-snapshot
MRD Hashing
inferred← citeshttps://doi.org/10.1007/978-3-030-45371-8_17openalex-snapshot
An Efficient Identification Scheme Based on Rank Metric
inferred← citeshttps://doi.org/10.1007/978-3-031-23201-5_1openalex-snapshot
Cryptanalysis of a Code-Based Identification Scheme Presented in CANS 2018
inferred← citeshttps://doi.org/10.1007/978-3-319-06734-6_1openalex-snapshot
New Results for Rank-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-55227-9_18openalex-snapshot
A Practical Group Signature Scheme Based on Rank Metric
inferred← citeshttps://doi.org/10.1007/978-3-540-30556-9_18openalex-snapshot
Designing an Efficient and Secure Public-Key Cryptosystem Based on Reducible Rank Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-25405-5_3openalex-snapshot
Full Cryptanalysis of the Chen Identification Protocol
inferred← citeshttps://doi.org/10.1007/bfb0034862openalex-snapshot
The cryptographic security of the syndrome decoding problem for rank distance codes
inferred← citeshttps://doi.org/10.1007/s10623-004-3988-yopenalex-snapshot
MRD Hashing
inferred← citeshttps://doi.org/10.1007/s10623-022-01114-3openalex-snapshot
Code-based signatures from new proofs of knowledge for the syndrome decoding problem
inferred← citeshttps://doi.org/10.1023/a:1020369320078openalex-snapshot
New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834642openalex-snapshot
Quasi-Cyclic Stern Proof of Knowledge
inferred← citeshttps://doi.org/10.1109/tit.2015.2511786openalex-snapshot
On the Complexity of the Rank Syndrome Decoding Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1026openalex-snapshot
On the complexity of the Rank Syndrome Decoding problem
inferred← citeshttps://doi.org/10.70675/54d4fd00z9015z4e02zaf4ezcd1d192265b2openalex-snapshot
On certain types of code-based signatures
inferred← citeshttps://doi.org/10.70675/ec6beab6zd428z4ff2z88b2zc63d6652d9f7openalex-snapshot
Etude et analyse de cryptosystèmes basés sur les codes correcteurs implantables en pratique
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.