• DocumentCode
    2144747
  • Title

    Efficient Data Structure Based Smart Card Implementation

  • Author

    Jain, Sonal ; Shukla, A. ; Pandey, Bishwajeet ; Kumar, Manoj

  • Author_Institution
    Indian Inst. of Inf. Technol., Gwalior, Gwalior, India
  • fYear
    2013
  • fDate
    27-29 Sept. 2013
  • Firstpage
    465
  • Lastpage
    468
  • Abstract
    To make smart card much faster, we need efficient data structure. Access time of on chip data depends on how and where we stored. Some Data Structure take maximum time and some take minimum time depending on the space and time complexity of data structure. In this work, we have taken some data structures and find that BST is the best suitable data structure for performing smart card operations in compare to other possible data structures.
  • Keywords
    computational complexity; data structures; smart cards; data structure based smart card implementation; maximum time; minimum time; space complexity; time complexity; Data structures; Java; Object recognition; Organizations; Random access memory; Security; Smart cards; Data Structure; Dedicated File; Elementary File; File Management; Flash; Master File; Memory; Personal Identification Number(PIN); RAM; ROM; Smart Card;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Communication Networks (CICN), 2013 5th International Conference on
  • Conference_Location
    Mathura
  • Type

    conf

  • DOI
    10.1109/CICN.2013.102
  • Filename
    6658037