Smart card
Upcoming SlideShare
Loading in...5
×

Like this? Share it with your network

Share
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Be the first to comment
    Be the first to like this
No Downloads

Views

Total Views
693
On Slideshare
693
From Embeds
0
Number of Embeds
0

Actions

Shares
Downloads
36
Comments
0
Likes
0

Embeds 0

No embeds

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
    No notes for slide

Transcript

  • 1. n LEVEL UNICODE – POSITION - CHARACTER- LENGTH CIPHER FOR SECURING SMART CARD Presented By S.SENTHIL KUMAR. K.NAVANEETHA KRISHNAN.
  • 2. INTRODUCTION
    • In day to day life, smart card plays an important role.
    • But due to the increase in hackers today, smart cards are becoming insecure now.
    • So it is time now to secure the smart card.
  • 3. MY PREVIOUS PROPOSED MODEL
  • 4. WORKING PRINCIPLE
    • The input to the hash algorithm can be of any length.
    • But output will be only of fixed length.
    • Collision Resistance -it is rare that two messages (in our case, it is PIN) have the same hash value.
  • 5. DISADVANTAGES OF SHA FAMILY
    • SHA family algorithms are relatively slower.
    • The initial value chosen by this hash algorithm is not dynamic.
    • SHA family uses the Merkle-Damgard model , which leads to the length extension attack.
    • It uses the static retriever table
  • 6. PROPOSED IMPREGNABLE CRYPTOSYSTEM
    • The total characters used for encryption is 255.
    • Number of alternate keys are relatively higher.
    • UNICODE characters instead of English alphabets.
    • It uses the position value -> the relative frequency attack is being avoided.
  • 7.
    • Important key ->The DATE and TIME on which the user obtained the smart card.
    • PLAIN TEXT : DATE & TIME + PIN .
    • This algorithm will take less time for encryption and takes more time for hackers to decrypt.
  • 8. ENCRYPTION
  • 9. ENCRYPTION FORMULA
    • Cipher text = (position value of the character + character value in UNICODE + Total length of the plain text) mod 256.
    • Find the median of the obtained cipher text and pad it at the end.
    • Find the base 64 value of the system’s DATE & TIME and it at first.
  • 10. IMPLEMENTATING CIPHERS
  • 11.  
  • 12. DATABASE-2
  • 13. COMPLEXITY ANALYSIS
    • Number of alternate keys
    • = 2256 * 255! * 109 *2*3*4 * 62
    • = 3.34 * 10593 keys..
    • Number of keys that can be found in a day at 1 decryption/µs
    • = 24 * 60 * 60 * 106
    • = 8.64 * 1010 keys decrypted/Day
  • 14.
    • Number of keys that can be found in a year at 1 decryption/µs
    • = 8.64 * 1010 * 365
    • = 3.15 * 1013 keys decrypted/year
    • Number of years required to find the key at 1 decryption/µs
    • = 1.06 * 10580 years
  • 15. DEPLOYING IN SMART CARD
    • A Smart Card is a type of card capable of storing data.
    • Magnetic stripe writer ->to transfer the encrypted PIN into the ATM card.
    • magnetic stripe is read by physical contact and swiping past a reading head.
    • They may also contain an RFID tag, a transponder device and/or a microchip.
  • 16. ATM MACHINE WITH THE CENTRAL DATABASE
  • 17. ADVANTAGES OF OUR MODEL
    • Some of the attacks avoided include
    • Active attack
    • Passive attack
    • Relative Frequency attack
    • Relative Frequency attack
    • Dictionary attack
    • Forgery attack
  • 18. Conclusion
    • Thus this cipher is used in the encryption algorithm, which gave high performance.
    • It is now highly easy to store the information like PIN in the smart card safely.
    • it avoids the forgery attack efficiently.
  • 19. FUTURE ENHANCEMENTS
    • The PIN management is presently done in single encryption and single decryption.
    • In future, it can be implemented in dual encryption and dual decryption.
  • 20. Thanking you!!!