Open AccessA Study on Data Hiding Technique Using Prime Numbers
Author(s) -
K. Ravikumar,
R. Raja
Publication year - 2019
Publication title -
international journal of scientific research in computer science, engineering and information technology
Language(s) - English
Resource type - Journals
ISSN - 2456-3307
DOI - 10.32628/cseit1952186
Subject(s) - computer science , least significant bit , fibonacci number , arithmetic , cache , lossless compression , prime (order theory) , theoretical computer science , algorithm , computer hardware , parallel computing , mathematics , data compression , discrete mathematics , combinatorics , operating system
In a globe full of communications, it is necessary to guard the data in arrange to make certain the isolation of the users. There is a lot of responsive data present in the mesh and it requirements. A novel data hitting technique is future, as an development over the Fibonacci LSB data-hiding technique. The traditional LSB technique is the simplest, but using this method it is promising to implant only in few bit-planes, since picture excellence becomes radically misshapen when embed in higher bit-planes. Battista et al. proposed an development over this by using Fibonacci putrefaction modus operandi and generate a deferent set of practical bit-planes all mutually, thereby growing the numeral of bit-planes. we propose two new hashing functions, prime modulo and odd-multiplier displacement, that are resistant to pathological behaviour and yet are able to eliminate the worst-case disagreement performance in the L2 cache. We show that these two schemes can be implemented in fast hardware using a set of thin totalling operation, with insignificant disintegration in the L2 hoard. We assess the scheme on 23 reminiscence intensive applications. It produces different secret message text for the same plain text which confuses the hacker to attain the unique text and makes it near impossible to break it.