Title :
XRMAC-an extended RMAC scheme to evade hacking by dynamic sizing
Author :
Rajaram ; Balaji, S. ; Jeeva, R.
Author_Institution :
Anna Univ. Chennai, Chennai, India
Abstract :
In KSAC, the interval is splitted by the keys generated by pseudorandom generator at each encryption of a character. As it ia symmetric nature, there is a need to transport the key to the destination either in the message or in the control message. But if the data captured, the system will be compromised. The usage of floating point representation will not be efficient to decrypt the message correctly which fails data integrity or it may increase the computational time. In our system, Extended RMAC (XRMAC), the message is encrypted by the dynamically sized matrix generated from the key. The hash value of the message is generated form the total ASCII values of the characters in the message modulus message length that proves data integrity. Instead of transmitting the key itself, just transfer the size of the matrix encrypted by the end user id. The system efficiency is increased upto 45%.
Keywords :
cryptography; XRMAC scheme; character encryption; control message; data integrity; dynamic sizing; floating point representation; hacking evasion; hash value; matrix size; message modulus message length; pseudorandom generator; Adaptation models; Complexity theory; Computational efficiency; Computer crime; Cryptography; Encoding; AC; RAC; XRMAC;
Conference_Titel :
Advanced Computing (ICoAC), 2013 Fifth International Conference on
Conference_Location :
Chennai
Print_ISBN :
978-1-4799-3447-8
DOI :
10.1109/ICoAC.2013.6921944