The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A modification of the RSA public-key encryption procedure (Corresp.)
Abstract
The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integerRused as the modulus can be factored. It my however be possible to break this system without factoringR. A modification of the RSA scheme is described. For this modified version it is shown that, if the encryption procedure can be broken in a certain number of operations, thenRcan be factored in only a few more operations. Furthermore, this technique can also be used to produce digital signatures, in much the same manner as the RSA scheme.
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
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge
Guillou, L. C., & Quisquater, J.-J. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34799-2_16 · Cited by 451
Meng, F.-Q., & Wu, G. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124413 · Cited by 144
Quantum resistant public key cryptography: a survey
Perlner, R. A., & Cooper, D. A. (2009) · Proceedings of the 8th Symposium on Identity and Trust on the Internet · doi:10.1145/1527017.1527028 · Cited by 137
Metadata
- Authors
- Williams, H.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1980-11
- Volume
- 26
- Issue
- 6
- Pages
- 726-729
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2167989228
- Cited by
- 271
- References
- 1
- FWCI
- 5.26
- 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 modification of the RSA public-key encryption procedure (Corresp.). https://app.cochat.ai/papers/10.1109/tit.1980.1056264
- The paper
- Williams, H. (1980). A modification of the RSA public-key encryption procedure (Corresp.). IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1980.1056264
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.
