The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A knapsack-type public key cryptosystem based on arithmetic in finite fields
Abstract
A knapsack-type public key cryptosystem is introduced that is the system is based on a novel application of arithmetic in finite fields. By appropriately choosing the parameters, one can control the density of the resulting knapsack, which is the ratio between the number of elements in the knapsack and their size in bits. In particular, the density can be made high enough to foil so-called low-density attacks against the system. At the moment, no attacks capable of breaking the system in a reasonable amount of time are known.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Self-citation
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Self-citationIntroduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Schnorr, C. P., & Euchner, M. (1994) · Mathematical Programming · doi:10.1007/bf01581144 · Cited by 1,427
A new public-key cryptosystem as secure as factoring
Okamoto, T., & Uchiyama, S. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054135 · Cited by 673
Generalized Compact Knapsacks Are Collision Resistant
Lyubashevsky, V., & Micciancio, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_13 · Cited by 268
Metadata
- Authors
- Chor, B., & Rivest, R. L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1988-09
- Volume
- 34
- Issue
- 5
- Pages
- 901-909
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2142247058
- Cited by
- 238
- References
- 1
- FWCI
- 23.29
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A knapsack-type public key cryptosystem based on arithmetic in finite fields. https://app.cochat.ai/papers/10.1109/18.21214
- The paper
- Chor, B., & Rivest, R. L. (1988). A knapsack-type public key cryptosystem based on arithmetic in finite fields. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.21214
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.