2013Unpublished venueRequires access

XRMAC-an extended RMAC scheme to evade hacking by dynamic sizing

Rajaram, S. Balaji, R. Jeeva

Open publisher page 5 citations

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

About this research paper

What this paper is about

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

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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%.

Key concepts: Encryption, Computer science, Hash function, Key (lock), Cryptography, Computer network, Theoretical computer science, Computer security

Related papers

Back to paper searchBrowse research topicsOriginal source
XRMAC-an extended RMAC scheme to evade hacking by dynamic sizing — Research Paper | ScholarLens