Modules over rings of characteristic 2 and its application to maximality of secret data ratio in CPTE schemes

Nguyễn Hải Thanh, Phan Trung Huy
Author affiliations

Authors

  • Nguyễn Hải Thanh
  • Phan Trung Huy

DOI:

https://doi.org/10.15625/1813-9663/27/4/850

Keywords:

maximality, secret data ratio, binary image, steganography, CPTE scheme, ring of characterisctic 2

Abstract

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

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