On the public citation graph
On the Chor—Rivest knapsack cryptosystem
0 signed · 42 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.1016/0142-0496(87)90105-6openalex-snapshot
Two issues in public key cryptography, RSA bit security and a new knapsack type system
inferredcites →https://doi.org/10.1017/9781009633529.009openalex-snapshot
Factorization of Polynomials
inferredcites →https://doi.org/10.1109/18.21214openalex-snapshot
A knapsack-type public key cryptosystem based on arithmetic in finite fields
inferredcites →https://doi.org/10.1109/5.4443openalex-snapshot
Cryptanalysis: a survey of recent results
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.2001.1158openalex-snapshot
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
inferred← citeshttps://doi.org/10.1006/jsco.1999.1002openalex-snapshot
Factoring Polynomials Over Finite Fields: A Survey
inferred← citeshttps://doi.org/10.1007/11593447_3openalex-snapshot
Adapting Density Attacks to Low-Weight Knapsacks
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_131openalex-snapshot
Random polynomials and polynomial factorization
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_3openalex-snapshot
A New Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_4openalex-snapshot
Provable Security for Public Key Schemes
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_2openalex-snapshot
Factoring Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_27openalex-snapshot
On Algorithms to Find p-ordering
inferred← citeshttps://doi.org/10.1007/978-3-031-07082-2_23openalex-snapshot
On the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-032-02717-7_24openalex-snapshot
On Acceleration of Logarithms Computing in the Chor-Rivest Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-319-04720-1_11openalex-snapshot
Balanced Integer Solutions of Linear Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-69284-5_6openalex-snapshot
Exploring Naccache-Stern Knapsack Encryption
inferred← citeshttps://doi.org/10.1007/bfb0055732openalex-snapshot
Cryptanalysis of the Chor-Rivest cryptosystem
inferred← citeshttps://doi.org/10.1007/s001450010005openalex-snapshot
Cryptanalysis of the Chor—Rivest Cryptosystem
inferred← citeshttps://doi.org/10.1007/s10623-018-0568-0openalex-snapshot
Factorization of a class of composed polynomials
inferred← citeshttps://doi.org/10.1007/s10623-018-0573-3openalex-snapshot
Polynomial time bounded distance decoding near Minkowski’s bound in discrete logarithm lattices
inferred← citeshttps://doi.org/10.1007/s12190-024-02009-3openalex-snapshot
Equal-degree factorization of binomials and trinomials over finite fields
inferred← citeshttps://doi.org/10.1007/s13389-018-0188-7openalex-snapshot
Mixed-radix Naccache–Stern encryption
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111603openalex-snapshot
Factorization of composed polynomials and applications
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.10.003openalex-snapshot
Factoring polynomials of the form f(xn)∈Fq[x]
inferred← citeshttps://doi.org/10.1016/j.ffa.2021.101837openalex-snapshot
On polynomials x − 1 over binary fields whose irreducible factors are binomials and trinomials
inferred← citeshttps://doi.org/10.1016/j.ins.2009.08.030openalex-snapshot
Analysis of the efficiency of the Chor–Rivest cryptosystem implementation in a safe-parameter range
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)80001-1openalex-snapshot
Univariate polynomial factorization over finite fields
inferred← citeshttps://doi.org/10.1109/csf.2012.8openalex-snapshot
Automatically Verified Mechanized Proof of One-Encryption Key Exchange
inferred← citeshttps://doi.org/10.1112/tlm3.70026openalex-snapshot
The 3‐sparsity of Xn−1 over finite fields of characteristic 2
inferred← citeshttps://doi.org/10.26636/jtit.2002.4.146openalex-snapshot
Asymmetric cryptography and practical security
inferred← citeshttps://doi.org/10.37236/32openalex-snapshot
A Complete Annotated Bibliography of Work Related to Sidon Sequences
inferred← citeshttps://doi.org/10.4018/978-1-5225-0105-3.ch014openalex-snapshot
Provable Security for Public Key Cryptosystems
inferred← citeshttps://doi.org/10.4018/978-1-7998-1763-5.ch013openalex-snapshot
Provable Security for Public Key Cryptosystems
inferred← citeshttps://doi.org/10.48550/arxiv.1406.3672openalex-snapshot
Deterministic polynomial factoring under the assumption of the Extended Riemann Hypothesis (ERH)
inferred← citeshttps://doi.org/10.48550/arxiv.1809.01762openalex-snapshot
Factorization of a class of composed polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1901.02951openalex-snapshot
Factorization of composed polynomials and applications
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5250openalex-snapshot
Cryptographic Hash Functions in Groups and Provable Properties
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
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.