Efficient Cryptographic Implementations for Smart CardsSwathi TripuraneniTrong NguyenIntroduction and Motivation:Smart cards technology has found its way into many important applications such as financial transactions, e-commerce, physical access control, health and transportation services, and access to wireless systems. As a result, the need for efficient cryptographic implementations for smart cards is heavily demanded in order to securely protect users’ private information. The goal of this paper is to study the four different efficient cryptographic implementations for smart cards to have data privacy and the constraints of the smart cards. These cryptographic algorithms include: secret-key encryption algorithm, standard public-key cryptography based on modular multiplication, public-key algorithm based on elliptic curves, and hash functions. In addition, the comparison of the implementation of above cryptographic algorithms would also be discussed.Time Schedule:October 15/19: Research on secret-key encryption and standard public-key cryptography based on modular multiplication completed.1st progress report completed.November 11/12: Research on public-key algorithm based on elliptic curves and hash functions completed.2nd progress report finished.December 5: Finish comparing implementations of four cryptographic algorithms and final report.December 16: Power Point Slides for project presentation completedDecember 19: Finish preparation for presentationTentative table contents of final report:I. Introduction- What are smart cards and how do they work?- Smart card design constraints- ApplicationsII. Description of four different cryptographic algorithms1. Secret-key encryption algorithms (DES, AES)2. Standard public-key cryptography based on modular multiplication (RSA, DH, DSS)3. Public-key algorithms based on elliptic curves4. Hash functions (SHA-1/2, RIPEMD)III. Comparison of the Implementation of four cryptographic algorithms - HW and/or SW- Performance such as speed (encryption) and/or flexibility- Key sizes- Physical space required on smart cards for implementation - Memory space (RAM, EEPROM used) required on smart cards for implementation (code size)- Cost of implementationIV. ConclusionV. ReferencesReferences:[1] A.J. Menezes, P.C. Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, Fla., 1997.[2] W. Stallings, Cryptography and Network Security, Prentice Hall, 4th ed., Upper Saddle River, 2006.[3] M. Scott, N. Costigan, and W. Abdulwahab, “Implementing Cryptographic Pairings on Smart Cards,” available at http://eprint.iacr.org/2006/144.pdf, Oct. 2007.[4] I.F. Blake, G. Seroussi, and N.P. Smart, “Elliptic Curves in Cryptography,” London Mathematical Society Lecture Notes Series, Cambridge Univ. Press, Cambridge, UK, 1999.[5] N. Koblitz, A Course in Number theory and Cryptography, Graduate Texts in Mathematics, 2nd ed., Springer-Verlag, berlinHeidelberg, 1994.[6] B. Schneier, Applied Cryptography. 2nd ed., John Wiley & Sons, Somerset, J.J., 1996.[7] NIST Federal Information Processing Standards Publication, “Advanced Encryption Standard (AES)”, available at http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf, Nov. 2001.[8] E. Trichina and L. Korkishko, “Secure and Efficient AES Software Implementation for Smart Cards,” Proc. fifth International Workshop, WISA 2004, pp. 425-39, 2005.[9] C. Lu, S. Dos, L.M. Andre, and F. Pimentel, “Implementation of Fast RSA Key Generation on Smart Cards,” Proc. ACM Symposium on Applied Computing, pp. 214-20, 2002.[10] A. Fujioka, T. Okamoto, and S. Miyaguchi, “ESIGN: An Efficient Digital Signature Implementation for Smart Cards,” Proc. Advances in Cryptology-EUROCRYPT ’91, pp. 446-57, 1991.[11] A.K. Lenstra and E.R. Verheul, “Selecting Cryptographic Key Sizes,” Journal of Cryptography: The Journal of the International Association for Cryptologic Research, Vol. 14, no. 4, pp. 255-93,
View Full Document
Unlocking...