The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
State of the art in ultra-low power public key cryptography for wireless sensor networks
Abstract
Security in wireless sensor networks is currently provided exclusively through symmetric key cryptography. In this paper we show that special purpose ultra-low power hardware implementations of public key algorithms can be used on sensor nodes. The reduced protocol overhead due to public key cryptography (PKC) translates into less packet transmissions and hence, power savings. We provide an in-depth comparison of three popular public key implementations and describe how four fundamental security services benefit from PKC.
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947
Cited by
Cyber security in the Smart Grid: Survey and challenges
Wang, W., & Lu, Z. (2013) · Computer Networks · doi:10.1016/j.comnet.2012.12.017 · Cited by 1,123
A Survey of Lightweight-Cryptography Implementations
Eisenbarth, T., Kumar, S., Paar, C., Poschmann, A., & Uhsadel, L. (2007) · IEEE Design & Test of Computers · doi:10.1109/mdt.2007.178 · Cited by 479
Energy-efficient mechanisms in security of the internet of things: A survey
Hellaoui, H., Koudil, M., & Bouabdallah, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2017.08.006 · Cited by 61
Metadata
- Authors
- Gaubatz, G., Kaps, J.-P., Ozturk, E., & Sunar, B.
- Venue
- Third IEEE International Conference on Pervasive Computing and Communications Workshops
- Publisher
- IEEE
- Published
- 2005
- Pages
- 146-150
- OpenAlex
- W2116090163
- Cited by
- 233
- References
- 2
- FWCI
- 11.36
- Type
- conference paper
- 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.
