On the public citation graph
An Attack on a Modified Niederreiter Encryption Scheme
0 signed · 33 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/11554868_11openalex-snapshot
Efficient Secure Group Signatures with Dynamic Joins and Keeping Anonymity Against Group Managers
inferredcites →https://doi.org/10.1007/11554868_5openalex-snapshot
A New Structural Attack for GPT and Variants
inferredcites →https://doi.org/10.1007/3-540-45961-8_25openalex-snapshot
An Observation on the Security of McEliece’s Public-Key Cryptosystem
inferredcites →https://doi.org/10.1007/3-540-45961-8_5openalex-snapshot
Authentication Codes with Multiple Arbiters
inferredcites →https://doi.org/10.1007/s10623-003-6151-2openalex-snapshot
How to Mask the Structure of Codes for a Cryptographic Use
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/18.272496openalex-snapshot
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
inferredcites →https://doi.org/10.1109/18.651067openalex-snapshot
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
inferredcites →https://doi.org/10.1109/proc.1980.11608openalex-snapshot
The theory of error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1978.1055873openalex-snapshot
On the inherent intractability of certain coding problems (Corresp.)
inferredcites →https://doi.org/10.1515/dma.1992.2.4.439openalex-snapshot
On insecurity of cryptosystems based on generalized Reed-Solomon codes
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-031-29689-5_1openalex-snapshot
Distinguishing and Recovering Generalized Linearized Reed–Solomon Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-86599-2_1openalex-snapshot
On the Structure of the Schur Squares of Twisted Generalized Reed-Solomon Codes and Application to Cryptanalysis
inferred← citeshttps://doi.org/10.1007/978-3-319-55589-8_15openalex-snapshot
A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-69284-5_10openalex-snapshot
Evolution of the McEliece Public Key Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-12929-2_5openalex-snapshot
Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
inferred← citeshttps://doi.org/10.1007/s10623-012-9694-2openalex-snapshot
The non-gap sequence of a subcode of a generalized Reed–Solomon code
inferred← citeshttps://doi.org/10.1007/s10623-012-9758-3openalex-snapshot
On the unique representation of very strong algebraic geometry codes
inferred← citeshttps://doi.org/10.1007/s11786-009-0015-8openalex-snapshot
Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.12.007openalex-snapshot
Computational aspects of retrieving a representation of an algebraic geometry code
inferred← citeshttps://doi.org/10.1109/isit.2018.8437923openalex-snapshot
Structural Properties of Twisted Reed-Solomon Codes with Applications to Cryptography
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/tit.2023.3271652openalex-snapshot
Twisted Goppa Codes With an Efficient Decoding Algorithm and Quasi-Cyclic Properties
inferred← citeshttps://doi.org/10.1515/dma-2022-0025openalex-snapshot
Classification of Hadamard products of one-codimensional subcodes of Reed–Muller codes
inferred← citeshttps://doi.org/10.4213/dm1583openalex-snapshot
Классификация произведений Адамара подкодов коразмерности 1 кодов Рида-Маллера
inferred← citeshttps://doi.org/10.5075/epfl-thesis-3846openalex-snapshot
Cryptography based on error correcting codes
inferred← citeshttps://doi.org/10.70675/18ebf760z5eb4z46cez8912z0e36b1c90bdcopenalex-snapshot
Security of cryptographic protocols based on coding theory
inferred← citeshttps://doi.org/10.70675/5e149c2az73a6z49fazbec7zc816a6bc6a1aopenalex-snapshot
Analysis of code-based post-quantum cryptosystems
inferred← citeshttps://doi.org/10.70675/768c8e60zc3e6z4c17za728zec57125eed6bopenalex-snapshot
An algebraic approach for the resolution of algorithmic problems raised by cryptography and coding theory
inferred← citeshttps://doi.org/10.70675/95c1b802zd7b4z4f95z8031z8eaa169ccc26openalex-snapshot
Algebraic and Physical Security in Code-Based 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.