Smart card

20
n LEVEL UNICODE – POSITION - CHARACTER- LENGTH CIPHER FOR SECURING SMART CARD Presented By S.SENTHIL KUMAR. K.NAVANEETHA KRISHNAN.

description

 

Transcript of Smart card

Page 1: Smart card

n LEVEL UNICODE – POSITION - CHARACTER-

LENGTH CIPHER FOR SECURING SMART CARD

Presented By

S.SENTHIL KUMAR. K.NAVANEETHA KRISHNAN.

Page 2: Smart card

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.

Page 3: Smart card

MY PREVIOUS PROPOSED MODEL

Page 4: Smart card

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.

Page 5: Smart card

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

Page 6: Smart card

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.

Page 7: Smart card

• 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.

Page 8: Smart card

ENCRYPTION

Page 9: Smart card

ENCRYPTION FORMULACipher 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.

Page 10: Smart card

IMPLEMENTATING CIPHERS

Page 11: Smart card
Page 12: Smart card

DATABASE-2

Page 13: Smart card

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

Page 14: Smart card

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

593

13

3.34*10

3.15*10

Page 15: Smart card

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.

Page 16: Smart card

ATM MACHINE WITH THE CENTRAL DATABASE

Page 17: Smart card

ADVANTAGES OF OUR MODELSome of the attacks avoided include

Active attack Passive attack Relative Frequency attack Relative Frequency attack Dictionary attack Forgery attack

Page 18: Smart card

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.

Page 19: Smart card

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.

Page 20: Smart card

Thanking you!!!