Open Access Open Access  Restricted Access Subscription or Fee Access

N Level Unicode Position Character Length Cipher for Securing Smart Card

Dr. P. Vijayakumar, M. Palanivelu, M. Latha Karthigaa, N. Balachandar, M. Karthi

Abstract


In day to day life, Smart card plays an important role. Open your wallet! See at least 20 to 25 cards in it. Wondering?? Today, the world is fully in the hands of smart cards since it is easy to carry and even if it is stolen, it is secure. But due to the increase in hackers today, Smart cards are becoming insecure now. Even the Encrypted PIN can be easily stolen by the cryptanalysts. So it is time now to secure the Smart card. In our previous paper [1], we have considered all the vulnerabilities of the Smart card and have provided various ways to overcome it. Still we feel that my algorithm is suffering from forgery attack. In this paper, we have applied a new encryption and a new hash algorithm to keep the information secure in Smart cards and to overcome forgery attack. The main advantage of this paper is, on an average, even the supercomputer will take 101084 years to decrypt, which is 42.2% higher than the previous proposals.


Keywords


Cryptographic Algorithms, Low Cost Smart Cards, Smart Cards, Brand New Hash.

Full Text:

PDF

References


Latha Karthigaa.M., Balachandar.N, Karthi.M. “Unassailable Cryptosystem for Securing Magnetic Stripe Card using A Brand New Hash and Encryption Algorithm”, in the “International Journal on Computer Science and Network Security (IJCSNS)”VOL.9 No.4, pp.396-400, April 2009.

“A new remote user authentication scheme using smart cards with forward secrecy” in IEEE trans, vol.2, pp.89-95

Specifications for secure hash standard: http://www.csrc.nist.gov/publications/

Requirements for SHA-3: http://www.nist.gov/hash-competition

“Cryptography and network security – Principles and practices” by William Stallings, Third Edition.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.