On the public citation graph

A New Public-Key Cryptosystem Based on the Problem of Reconstructing p–Polynomials

0 signed · 48 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-39200-9_14openalex-snapshot
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem
inferredcites →https://doi.org/10.1007/978-3-540-24632-9_2openalex-snapshot
Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem
inferredcites →https://doi.org/10.1007/978-3-540-30539-2_28openalex-snapshot
Cryptanalyzing the Polynomial-Reconstruction Based Public-Key System Under Optimal Parameter Choice
inferredcites →https://doi.org/10.1007/978-3-540-30556-9_18openalex-snapshot
Designing an Efficient and Secure Public-Key Cryptosystem Based on Reducible Rank Codes
inferredcites →https://doi.org/10.1007/bfb0034349openalex-snapshot
A fast matrix decoding algorithm for rank-error-correcting codes
inferredcites →https://doi.org/10.1016/j.crma.2004.10.004openalex-snapshot
Sur la reconstruction des polynômes linéaires : un nouvel algorithme de décodage des codes de Gabidulin
inferredcites →https://doi.org/10.1023/a:1020369320078openalex-snapshot
New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications
inferredcites →https://doi.org/10.1090/s0002-9947-1933-1501703-0openalex-snapshot
On a Special Class of Polynomials
inferredcites →https://doi.org/10.1090/s0002-9947-1934-1501740-7openalex-snapshot
Contributions to the Theory of Finite Fields
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/18.75248openalex-snapshot
Maximum-rank array codes and their application to crisscross error correction
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/978-3-030-25922-8_6openalex-snapshot
Weak Keys in the Faure–Loidreau Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-44223-1_1openalex-snapshot
Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_1openalex-snapshot
Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis
inferred← citeshttps://doi.org/10.1007/978-3-031-17234-2_3openalex-snapshot
LRPC Codes with Multiple Syndromes: Near Ideal-Size KEMs Without Ideals
inferred← citeshttps://doi.org/10.1007/978-3-031-22301-3_10openalex-snapshot
Cryptanalysis and Repair of a Gabidulin Code Based Cryptosystem from ACISP 2018
inferred← citeshttps://doi.org/10.1007/978-3-031-58411-4_7openalex-snapshot
Injective Rank Metric Trapdoor Functions with Homogeneous Errors
inferred← citeshttps://doi.org/10.1007/978-3-031-90229-1_2openalex-snapshot
Generalizing the Augot-Finiasz PKE to Other Code Classes
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-981-97-0641-9_33openalex-snapshot
Quantum-Safe Encryption Schemes Based on Hadamard Code
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-017-0402-0openalex-snapshot
Polynomial-time key recovery attack on the Faure–Loidreau scheme based on Gabidulin codes
inferred← citeshttps://doi.org/10.1007/s10623-017-0425-6openalex-snapshot
Generalized Gabidulin codes over fields of any characteristic
inferred← citeshttps://doi.org/10.1007/s10623-021-00861-zopenalex-snapshot
LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding
inferred← citeshttps://doi.org/10.1007/s10623-021-00972-7openalex-snapshot
Extending Coggia–Couvreur attack on Loidreau’s rank-metric cryptosystem
inferred← citeshttps://doi.org/10.1007/s10623-023-01330-5openalex-snapshot
LowMS: a new rank metric code-based KEM without ideal structure
inferred← citeshttps://doi.org/10.1007/s10623-026-01933-8openalex-snapshot
Using cyclic $$(f,\sigma )$$-codes over finite chain rings to construct $$\mathbb {Z}_p$$- and $$\mathbb {F}_q[\![t]\!]$$-lattices
inferred← citeshttps://doi.org/10.1007/s42979-021-00761-yopenalex-snapshot
Constant Time Algorithms for ROLLO-I-128
inferred← citeshttps://doi.org/10.1016/j.laa.2020.06.014openalex-snapshot
Equivalence and characterizations of linear rank-metric codes based on invariants
inferred← citeshttps://doi.org/10.1017/s001708952300006xopenalex-snapshot
Division algebras and MRD codes from skew polynomials
inferred← citeshttps://doi.org/10.1109/isit.2018.8437561openalex-snapshot
Repairing the Faure-Loidreau Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517869openalex-snapshot
On the decoding of the sum of Gabidulin codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518085openalex-snapshot
Decoding High-Order Interleaved Rank-Metric Codes
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206957openalex-snapshot
Randomized Decoding of Linearized Reed–Solomon Codes Beyond the Unique Decoding Radius
inferred← citeshttps://doi.org/10.1109/redundancy48165.2019.9003318openalex-snapshot
Interleaving Loidreau’s Rank-Metric Cryptosystem
inferred← citeshttps://doi.org/10.1109/redundancy48165.2019.9003356openalex-snapshot
Efficient Decoding of Interleaved Low-Rank Parity-Check Codes
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.2021.3067318openalex-snapshot
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
inferred← citeshttps://doi.org/10.1145/3327958.3329544openalex-snapshot
Rank-metric Encryption on Arm-Cortex M0
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.21203/rs.3.rs-1250619/v1openalex-snapshot
Semilinear Transformations in Coding Theory: A New Technique in Code-Based Cryptography
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.48550/arxiv.1809.03024openalex-snapshot
A Public-Key Cryptosystem from Interleaved Goppa Codes
inferred← citeshttps://doi.org/10.70675/18ebf760z5eb4z46cez8912z0e36b1c90bdcopenalex-snapshot
Security of cryptographic protocols based on coding theory
inferred← citeshttps://doi.org/10.70675/baee59e6zc790z4090za837zfa09b5da4e61openalex-snapshot
Decoding of block and convolutional codes in rank metric
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.