The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Symmetric and Asymmetric Encryption
Open accessAbstract
All cryptosystems currently m use are symmetrm m the sense that they require the transmitter and receiver to share, m secret, either the same pmce of reformation (key) or one of a paLr of related keys easdy computed from each other, the key is used m the encryption process to introduce uncertainty to an unauthorized receiver.Not only is an asymmetric encryption system one in whmh the transmitter and receiver keys are different, but in addition it Is computatmnally mfeaslble to compute at least one from the other.Asymmetric systems make it possible to authent2cate messages whose contents must be revealed to an opponent or allow a transmitter whose key has been compromised to communmate m privacy to a receiver whose key has been kept secret--neither of which is possible using a symmetric cryptosystem.This paper opens with a brmf dmcussion of encryptmn principles and then proceeds to a comprehensive discussion of the asymmetric encryptmn/decryption channel and its application m secure communmations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
Diffie, W., & Hellman, M. E. (1977) · Computer · doi:10.1109/c-m.1977.217750 · Cited by 567
Cited by
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
The Prisoners’ Problem and the Subliminal Channel
Simmons, G. J. (1984) · Advances in Cryptology · doi:10.1007/978-1-4684-4730-9_5 · Cited by 977
Self-citationCryptographic solution to a problem of access control in a hierarchy
Akl, S. G., & Taylor, P. D. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357369.357372 · Cited by 544
Contact Tracing Mobile Apps for COVID-19: Privacy Considerations and Related Trade-offs
Cho, H., Ippolito, D., & Yu, Y. W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.11511 · Cited by 350
Picture data encryption using scan patterns
Bourbakis, N., & Alexopoulos, C. (1992) · Pattern Recognition · doi:10.1016/0031-3203(92)90074-s · Cited by 278
Metadata
- Authors
- Simmons, G. J.
- Venue
- ACM Computing Surveys
- Published
- 1979-12
- Volume
- 11
- Issue
- 4
- Pages
- 305-330
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2068955912
- Cited by
- 241
- References
- 4
- FWCI
- 3.92
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.