Improving smart card security using elliptic curve cryptography over prime field (Fp)

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes the use of Elliptic Curve Cryptography (ECC) over Prime Field (Fp) for encryption and digital signature of smart cards. The concepts of ECC over prime field (Fp) are described, followed by the experimental design of the smart card simulation. Finally, the results are compared against RSA algorithms. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Abdurahmonov, T., Yeoh, E. T., & Hussain, H. M. (2011). Improving smart card security using elliptic curve cryptography over prime field (Fp). Studies in Computational Intelligence, 368, 127–140. https://doi.org/10.1007/978-3-642-22288-7_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free