Modules over rings of characteristic 2 and its application to maximality of secret data ratio in CPTE schemes
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/27/4/850Keywords:
maximality, secret data ratio, binary image, steganography, CPTE scheme, ring of characterisctic 2Abstract
Based on the ring of integers modulo 2r, Chen-Pan-Tseng (2000) introduced a block-based scheme (CPT scheme) which permits in each block F of size m.n of a given binary image B to embed r =ëlog2(q+1)û secret bits by changing at most two entries of F, where q=m.n . As shown, the highest number of embedded secret bits for at most two bits to be changed in each block of q positions of F in any CPT-based schemes is rmax=ëlog2(1+q(q+1)/2)û, approximately 2r-1. In this paper we introduce a CPTE scheme based on modules over the ring of characterisctic 2 such as Z2 which permits ratio of secret data to be reached approximately rmax, twice as much as CPT asymptotically.
Metrics
Metrics Loading ...
Downloads
Published
16-05-2012
How to Cite
[1]
N. H. Thanh and P. T. Huy, “Modules over rings of characteristic 2 and its application to maximality of secret data ratio in CPTE schemes”, JCC, vol. 27, no. 4, pp. 295–305, May 2012.
Issue
Section
Computer Science
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
