The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Unconventional cryptographic keying variable management
Abstract
We present three unconventional approaches to keying variable management. The first approach is based on using a public key cryptosystem (PKC) that is breakable in short, but on average less, time than it takes to set up an ultrawide bandwidth modem that is then used to transport a keying variable for a classical cryptosystem. The second concept proposes using the characteristics of an urban UHF radio channel, determined by mutual sounding, as the cryptovariable. The third concept encourages research into ill-conditioned problems as potentially fruitful ground for PKCs not based on finite field arithmetic.>
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
Secure communications over insecure channels
Merkle, R. C. (1978) · Communications of the ACM · doi:10.1145/359460.359473 · Cited by 757
Cited by
A Survey on Wireless Security: Technical Challenges, Recent Advances, and Future Trends
Zou, Y., Zhu, J., Wang, X., & Hanzo, L. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2016.2558521 · Cited by 1,272
On the effectiveness of secret key extraction from wireless signal strength in real environments
Jana, S., Premnath, S. N., Clark, M., Kasera, S. K., Patwari, N., & Krishnamurthy, S. V. (2009) · Proceedings of the 15th annual international conference on Mobile computing and networking · doi:10.1145/1614320.1614356 · Cited by 518
Key Generation From Wireless Channels: A Review
Zhang, J., Duong, T. Q., Marshall, A., & Woods, R. (2016) · IEEE Access · doi:10.1109/access.2016.2521718 · Cited by 451
Information-Theoretically Secret Key Generation for Fading Wireless Channels
Ye, C., Mathur, S., Reznik, A., Shah, Y., Trappe, W., & Mandayam, N. B. (2010) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2010.2043187 · Cited by 417
High-Rate Uncorrelated Bit Extraction for Shared Secret Key Generation from Channel Measurements
Patwari, N., Croft, J., Jana, S., & Kasera, S. K. (2010) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2009.88 · Cited by 416
Metadata
- Authors
- Hershey, J. E., Hassan, A. A., & Yarlagadda, R.
- Venue
- IEEE Transactions on Communications
- Published
- 1995
- Volume
- 43
- Issue
- 1
- Pages
- 3-6
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2138009247
- Cited by
- 231
- References
- 2
- FWCI
- 0.48
- 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
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.