The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Elliptic-Curve-Based Security Processor for RFID
Open accessAbstract
RFID (Radio Frequency IDentification) tags need to include security functions, yet at the same time their resources are extremely limited. Moreover, to provide privacy, authentication and protection against tracking of RFID tags without loosing the system scalability, a public-key based approach is inevitable, which is shown by M. Burmester et al. In this paper, we present an architecture of a state-of-the-art processor for RFID tags with an Elliptic Curve (EC) processor over GF(2^163). It shows the plausibility of meeting both security and efficiency requirements even in a passive RFID tag. The proposed processor is able to perform EC scalar multiplications as well as general modular arithmetic (additions and multiplications) which are needed for the cryptographic protocols. As we work with large numbers, the register file is the most critical component in the architecture. By combining several techniques, we are able to reduce the number of registers from 9 to 6 resulting in EC processor of 10.1K gates. To obtain an efficient modulo arithmetic, we introduce a redundant modular operation. Moreover the proposed architecture can support multiple cryptographic protocols. The synthesis results with a 0.13 um CMOS technology show that the gate area of the most compact version is 12.5K gates.
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
Cited by
He, D., & Zeadally, S. (2015) · IEEE Internet of Things Journal · doi:10.1109/jiot.2014.2360121 · Cited by 327
Robustness, Security and Privacy in Location-Based Services for Future IoT: A Survey
Chen, L., Thombre, S., Jarvinen, K., Lohan, E. S., Alen-Savikko, A., Leppakoski, H., Bhuiyan, M. Z. H., Bu-Pasha, S., Ferrara, G. N., Honkala, S., et al. (2017) · IEEE Access · doi:10.1109/access.2017.2695525 · Cited by 313
“, [159]–[163]) because of its small key sizes and relatively low computational complexity.”
BackgroundSecurity and privacy issues in implantable medical devices: A comprehensive survey
Camara, C., Peris-Lopez, P., & Tapiador, J. E. (2015) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2015.04.007 · Cited by 293
Chatterjee, U., Govindan, V., Sadhukhan, R., Mukhopadhyay, D., Chakraborty, R. S., Mahata, D., & Prabhu, M. M. (2019) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2018.2832201 · Cited by 290
Metadata
- Authors
- Lee, Y. K., Sakiyama, K., Batina, L., & Verbauwhede, I.
- Venue
- IEEE Transactions on Computers
- Published
- 2008-11
- Volume
- 57
- Issue
- 11
- Pages
- 1514-1527
- ISSN
- 0018-9340 (ISSN-L)
- OpenAlex
- W2143032227
- Cited by
- 228
- References
- 1
- FWCI
- 63.20
- Type
- journal article
- Language
- en
- Open access
- green
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.