The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The advantages of elliptic curve cryptography for wireless security
Abstract
This article provides an overview of elliptic curves and their use in cryptography. The focus is on the performance advantages to be obtained in the wireless environment by using elliptic curve cryptography instead of a traditional cryptosystem like RSA. Specific applications to secure messaging and identity-based encryption are discussed.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
Use of Elliptic Curves in Cryptography
Miller, V. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_31 · Cited by 3,946
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Elliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
A Survey of Fast Exponentiation Methods
Gordon, D. M. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0913 · Cited by 534
Advances in Cryptology — CRYPTO’ 86: Proceedings
(1987) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7 · Cited by 519
More Flexible Exponentiation with Precomputation
Lim, C. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_11 · Cited by 264
Software Implementation of the NIST Elliptic Curves Over Prime Fields
Brown, M., Hankerson, D., López, J., & Menezes, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_19 · Cited by 258
Non-interactive Public-Key Cryptography
Maurer, U. M., & Yacobi, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46416-6_43 · Cited by 160
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Ciet, M., Jóye, M., Lauter, K., & Montgomery, P. L. (2006) · Designs Codes and Cryptography · doi:10.1007/s10623-005-3299-y · Cited by 149
Self-citationEfficient algorithms for elliptic curve cryptosystems
Guajardo, J., & Paar, C. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052247 · Cited by 140
A World Wide Number Field Sieve factoring record: On to 512 bits
Cowie, J. R., Dodson, B., Elkenbracht-Huizing, R. M., Lenstra, A. K., Montgomery, P. L., & Zayer, J. (1996) · Lecture notes in computer science · doi:10.1007/bfb0034863 · Cited by 72
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
Eisenträger, K., Lauter, K., & Montgomery, P. L. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36563-x_24 · Cited by 61
Self-citationUse of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS)
Blake-Wilson⋆⋆, S., Brown, D. R. L., & Lambert, P. A. (2002) · doi:10.17487/rfc3278 · Cited by 25
Discrete-Log With Compressible Exponents
Yacobi, Y. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_47 · Cited by 14
Cited by
Bubbles of Trust: A decentralized blockchain-based authentication system for IoT
Hammi, M. T., Hammi, B., Bellot, P., & Serhrouchni, A. (2018) · Computers & Security · doi:10.1016/j.cose.2018.06.004 · Cited by 691
A Secure Biometrics-Based Multi-Server Authentication Protocol Using Smart Cards
Odelu, V., Das, A. K., & Goswami, A. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2439964 · Cited by 413
An active man-in-the-middle attack on bluetooth smart devices
Melamed, T. (2018) · International Journal of Safety and Security Engineering · doi:10.2495/safe-v8-n2-200-211 · Cited by 46
Metadata
- Authors
- Lauter, K.
- Venue
- IEEE Wireless Communications
- Published
- 2004-02
- Volume
- 11
- Issue
- 1
- Pages
- 62-67
- ISSN
- 1536-1284 (ISSN-L)
- OpenAlex
- W2090911915
- Cited by
- 379
- References
- 18
- FWCI
- 43.65
- 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.