On the public citation graph

The cryptographic security of the syndrome decoding problem for rank distance codes

0 signed · 80 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/3-540-46885-4_19openalex-snapshot
An alternative to the Fiat-Shamir protocol
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/3-540-60693-9_28openalex-snapshot
Cryptanalysis of Harari's identification scheme
inferredcites →https://doi.org/10.1007/3-540-68339-9_22openalex-snapshot
An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
inferredcites →https://doi.org/10.1007/bfb0019849openalex-snapshot
A new authentication algorithm
inferredcites →https://doi.org/10.1007/bfb0030367openalex-snapshot
A (non-practical) three-pass identification protocol using coding theory
inferredcites →https://doi.org/10.1007/bfb0032363openalex-snapshot
A new identification algorithm
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1049/el:19941106openalex-snapshot
Improved Girault identification scheme
inferredcites →https://doi.org/10.1109/18.556672openalex-snapshot
A new paradigm for public key identification
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.1002/sec.274openalex-snapshot
An efficient and provably secure public key encryption scheme based on coding theory
inferred← citeshttps://doi.org/10.1007/11779360_4openalex-snapshot
A Welch–Berlekamp Like Algorithm for Decoding Gabidulin Codes
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/978-1-4757-3585-7_8openalex-snapshot
Reducible Rank Codes and Applications to Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-00434-7_14openalex-snapshot
Code-Based Signature Schemes from Identification Protocols in the Rank Metric
inferred← citeshttps://doi.org/10.1007/978-3-030-16458-4_16openalex-snapshot
A New Gabidulin-Like Code and Its Application in Cryptography
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-030-54074-6_6openalex-snapshot
MURAVE: A New Rank Code-Based Signature with MUltiple RAnk VErification
inferred← citeshttps://doi.org/10.1007/978-3-030-65411-5_28openalex-snapshot
Enhancing Code Based Zero-Knowledge Proofs Using 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-031-40003-2_2openalex-snapshot
Cryptanalysis of Rank-Metric Schemes Based on Distorted Gabidulin Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-47818-5_6openalex-snapshot
zk-SNARKs from Codes with Rank Metrics
inferred← citeshttps://doi.org/10.1007/978-3-032-22695-2_5openalex-snapshot
Hybrid Subsupport Guessing: A New Hybrid Technique for the Rank Decoding Problem
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-11659-4_6openalex-snapshot
RankSign: An Efficient Signature Algorithm Based on the Rank Metric
inferred← citeshttps://doi.org/10.1007/978-3-319-29360-8_2openalex-snapshot
RankSynd a PRNG Based on Rank Metric
inferred← citeshttps://doi.org/10.1007/978-3-319-59879-6_1openalex-snapshot
A New Rank Metric Codes Based Encryption Scheme
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-19574-7_12openalex-snapshot
A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
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/978-3-642-38616-9_1openalex-snapshot
Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
inferred← citeshttps://doi.org/10.1007/978-981-99-8739-9_10openalex-snapshot
Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems with Smaller Sizes
inferred← citeshttps://doi.org/10.1007/s00200-022-00577-0openalex-snapshot
Two modifications for Loidreau’s code-based cryptosystem
inferred← citeshttps://doi.org/10.1007/s10623-003-6151-2openalex-snapshot
How to Mask the Structure of Codes for a Cryptographic Use
inferred← citeshttps://doi.org/10.1007/s10623-012-9716-0openalex-snapshot
Asymptotic behaviour of codes in rank metric over finite fields
inferred← citeshttps://doi.org/10.1007/s10623-017-0343-7openalex-snapshot
Extension of Overbeck’s attack for Gabidulin-based cryptosystems
inferred← citeshttps://doi.org/10.1007/s10623-023-01265-xopenalex-snapshot
Revisiting algebraic attacks on MinRank and on the rank decoding problem
inferred← citeshttps://doi.org/10.1007/s10623-025-01744-3openalex-snapshot
Information set decoding for ring-linear codes
inferred← citeshttps://doi.org/10.1016/j.jisa.2020.102598openalex-snapshot
Rank-metric code-based mutual authentication protocol for RFID
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.1051/ita/2021010openalex-snapshot
A Novel Niederreiter-like cryptosystem based on the (u|u+υ)-construction codes
inferred← citeshttps://doi.org/10.1080/23742917.2016.1226650openalex-snapshot
Will quantum computers be the end of public key encryption?
inferred← citeshttps://doi.org/10.1109/csci.2017.339openalex-snapshot
A Secure MQTT Framework from PUF-based Key Establishment
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00111openalex-snapshot
Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
inferred← citeshttps://doi.org/10.1109/isit.2015.7282956openalex-snapshot
New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174497openalex-snapshot
Generic Decoding in the Sum-Rank Metric
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518085openalex-snapshot
Decoding High-Order Interleaved Rank-Metric Codes
inferred← citeshttps://doi.org/10.1109/redundancy48165.2019.9003318openalex-snapshot
Interleaving Loidreau’s Rank-Metric Cryptosystem
inferred← citeshttps://doi.org/10.1109/sarnof.2005.1426530openalex-snapshot
Optimal distortion parameter for the GPT public-key cryptosystem
inferred← citeshttps://doi.org/10.1109/tit.2011.2178017openalex-snapshot
Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations
inferred← citeshttps://doi.org/10.1109/tit.2015.2511786openalex-snapshot
On the Complexity of the Rank Syndrome Decoding Problem
inferred← citeshttps://doi.org/10.1109/tit.2019.2933535openalex-snapshot
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography
inferred← citeshttps://doi.org/10.1109/tit.2022.3167629openalex-snapshot
Generic Decoding in the Sum-Rank Metric
inferred← citeshttps://doi.org/10.1109/tit.2025.3555075openalex-snapshot
Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems With Smaller Sizes
inferred← citeshttps://doi.org/10.1145/3197507.3197513openalex-snapshot
A New LRPC-Kronecker Product Codes Based Public-Key Cryptography
inferred← citeshttps://doi.org/10.1561/0100000119openalex-snapshot
Rank-Metric Codes and Their Applications
inferred← citeshttps://doi.org/10.1561/9781638280019openalex-snapshot
Rank-Metric Codes and Their Applications
inferred← citeshttps://doi.org/10.20381/ruor-4555openalex-snapshot
Light-Weight Authentication Schemes with Applications to RFID Systems
inferred← citeshttps://doi.org/10.21203/rs.3.rs-860071/v1openalex-snapshot
Two Public-Key Cryptosystems Based on Expanded Gabidulin Codes
inferred← citeshttps://doi.org/10.3390/cryptography10030035openalex-snapshot
MPC-in-the-Head Zero-Knowledge Proof for Rank Syndrome Decoding via Mixed-Field Secret Sharing
inferred← citeshttps://doi.org/10.3390/math9070789openalex-snapshot
An Application of p-Fibonacci Error-Correcting Codes to Cryptography
inferred← citeshttps://doi.org/10.3934/amc.2023003openalex-snapshot
On the rank decoding problem over finite principal ideal rings
inferred← citeshttps://doi.org/10.48550/arxiv.1004.2881openalex-snapshot
Rank Distance Bicodes and their Generalization
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1026openalex-snapshot
On the complexity of the Rank Syndrome Decoding problem
inferred← citeshttps://doi.org/10.48550/arxiv.1305.5436openalex-snapshot
Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
inferred← citeshttps://doi.org/10.48550/arxiv.1603.05128openalex-snapshot
RankSynd a PRNG Based on Rank Metric
inferred← citeshttps://doi.org/10.48550/arxiv.1806.10055openalex-snapshot
Twisted Gabidulin Codes in the GPT Cryptosystem
inferred← citeshttps://doi.org/10.48550/arxiv.1904.08774openalex-snapshot
Decoding High-Order Interleaved Rank-Metric Codes
inferred← citeshttps://doi.org/10.48550/arxiv.1911.13119openalex-snapshot
RAMESSES, a Rank Metric Encryption Scheme with Short Keys
inferred← citeshttps://doi.org/10.48550/arxiv.2006.06598openalex-snapshot
Combinatorial Solution of the Syndrome Decoding Problem using Copula on Grassmann graph
inferred← citeshttps://doi.org/10.48550/arxiv.2104.08065openalex-snapshot
Low Row Rank Parity Check Codes
inferred← citeshttps://doi.org/10.48550/arxiv.2106.15526openalex-snapshot
Generalizing Syndrome Decoding problem to the totally Non-negative Grassmannian
inferred← citeshttps://doi.org/10.5772/intechopen.101105openalex-snapshot
A Public Key Cryptosystem Using Cyclotomic Matrices
inferred← citeshttps://doi.org/10.70675/18ebf760z5eb4z46cez8912z0e36b1c90bdcopenalex-snapshot
Security of cryptographic protocols based on coding theory
inferred← citeshttps://doi.org/10.70675/71022c8fzb2f6z486dzb4faz5bfc36f274ceopenalex-snapshot
Cryptographie à base de codes correcteurs d’erreurs en métrique rang et application
inferred← citeshttps://doi.org/10.70675/8933f010z60f3z4923za6a9zcc163c44c920openalex-snapshot
Applications of Quantum Fourier Sampling and the Dihedral Hidden Subgroup Problem
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.