RMAC - A new encryption scheme for Arithmetic Coding to evade CCA attacks

The random bit generated by pseudorandom bit generator used in Randomized Arithmetic Coding (RAC) doesn't depend on any parameter, so it raises the difficulty in decryption side to reconstruct that random bit and the process to match the exact pattern will take multistep till it reaches exact v...

Full description

Saved in:
Bibliographic Details
Published in:2011 Third International Conference on Advanced Computing pp. 175 - 180
Main Authors: Kavitha, V., Balaji, S., Jeeva, R.
Format: Conference Proceeding
Language:English
Published: IEEE 01.12.2011
Subjects:
Complexity theory
Computer crime
Encoding
Encryption
Indexes
RAC
RMAC
ISBN:9781467306706, 1467306703
ISSN:2377-6927
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The random bit generated by pseudorandom bit generator used in Randomized Arithmetic Coding (RAC) doesn't depend on any parameter, so it raises the difficulty in decryption side to reconstruct that random bit and the process to match the exact pattern will take multistep till it reaches exact value. In our system Randomized Matrix Arithmetic Coding (RMAC), the security depends on a randomized matrix formed by the random key based on the user profile. So the adversary can't guess the cipher or key because we are encrypting plaintext with the symbols in the matrix, not only by the key and at the same time using that key it is easy to recreate the matrix at the decryption side. It will increase the security of Arithmetic Coding by preventing from the attacks like Chosen Cipher text Attack type-2 (CCA2) attack, third party attack etc and at the same time it reduces the computational time to match the cipher with original pattern.
ISBN:9781467306706
1467306703
ISSN:2377-6927
DOI:10.1109/ICoAC.2011.6165170