Mt ci tin thut ton giu tin trong nh nh phn

A Improved Scheme for Hiding Information in Binary Image

o Thanh Tnh, Tng Minh c
Abstract: In this paper, we propose a improved steganography scheme for hiding information in a host binary image. A secret key and a permuted vector are used to protect the hidden data. Given an image block of size mn, an existing scheme [1] can embed [log2 (mn+1)] bits of data in the image by changing at most two bits in the block mn of image. This scheme, as compared to [1] in some cases can embed more data, as many as values up to mn-1, by changing the same of bits of data in an image block, and then keep the same quality of the host image. Tm tt: Bi bo trnh by mt ci tin phng php giu tin trong nh nh phn trn c s s dng tng khi nh c kch thc mn, kha nh phn E v vect hon v F nhm tng cng tnh bo mt ca thng tin c giu. Vi mi khi nh c kch thc mn, phng php trong [1] c th giu c [log2 (mn+1)] bit d liu bng cch thay i nhiu nht hai bit d liu trong khi nh. Phng php m rng trong bi bo nng gi tr c giu trong khi ln n mn-1, cng bng cch thay i khng qu hai bit d liu trong khi nh, ngha l c cng mc nh hng ti nh gc.

xut mt phng php giu thng tin trong nh nh phn, theo , nh c phn hoch thnh nhiu khi c cng kch thc mn. Vi mi khi d liu nh c th giu c ti a r bit thng tin, vi r [log2(mn+1)] bng cch thay i khng qu 2 bit trong khi d liu nh. Thut ton trong [1] cn mt n - kha K c kch thc bng khi nh v gm cc bit 0 hoc 1 v ma trn trng s W cng c kch thc bng khi nh sao cho cc phn t c gi tr ph kn tp 2R =[1,...,2r-1] v cng ch thuc tp 2R. Gi s gi tr cn giu l b [0,..., 2r-1] v k hiu khi nh s mang tin giu l F, thut ton giu b vo F gm 4 bc: S1) Tnh F(i,j) = K(i,j) xor F(i,j), 1 i m, 1 j n. S2) Tnh
m n

s=

W (i, j ) F ' (i, j )

i =1 j =1

S3) Vi mi w = 1, 2,...,2r-1, tnh Sw = { (j,k): W(j,k) =w, F(j,k) =0 hoc W(j,k) =2r-w, F(j,k) =1} S4) K hiu d = b - s (mod 2 ) o bit trong khi F c F sao cho tng s tnh trong bc S2) tng d n v. Trong [1] chng minh rng tng tng s trong bc S2) ch cn thay i khng qu hai bit trong khi F. Kt qu quan trng c chng minh trong 1
r

I. GII THIU Vic giu tin vo nh nh phn thc s l mt thch thc khng nh. Thut ton giu bit tin vo khi nh nh phn c M.Y. WU v J.H. LEE xut trong [2]. Tuy nhin, mi khi ch giu c khng nhiu thng tin v kh nng bo mt cng khng c tt. Trong nghin cu [1], trn c s pht trin tng ca nhm M.Y. WU v J.H. LEE, cc tc gi Y.Y. Chen, H. Pan, Y. Tseng (CPT)

[1] l trong mi khi kch thc mn c th giu c ti a [log2(mn+1)] bit vi an ton kh cao. C th la chn K v W t:
2 1 C mn (2 r 1)! (2 r 1) mn ( 2
r r

1)

R rng l khi thay i mt bit trong dy W gi tr d cng s thay i theo. Chng hn, nu U*(i) = 1, o bit W(f1(i)), gi tr mi ca U*(i) bng 0, khi ny d s gim mt lng i, ngc li d s tng i n v. t: db = b d (mod K) (3) Nu db = 0 ta coi nh giu c s nguyn dng b vo dy W. Khi cn tnh li b t d liu W cha b, ta thc hin theo (1), (2) v t: b = d (mod K) (4) Gi thit db<0, t h = db (h>0) ta cn thay i W d (mod K) gim mt lng h. Trng hp db>0, cn thay i W d (mod K) tng mt lng db, ni cch khc, d (mod K) gim mt lng h vi h =K db (h>0). Khng lm mt tnh tng qut v gim bt s phc tp khng cn thit trong cc cng thc, trong phn sau ta ch xt cho trng hp f(i) = i, i [1,...,K]. Khi ny U*(i) = U(i), vi mi i [1,...,K]. V vy

kh nng. Nhng nghin cu trong bi bo ny nhm chng minh c th giu cc gi tr trong min Rmn = {2r, 2r+1, ...,mn-1} vo khi F m cng ch cn thay i khng qu 2 bit trong F. Chng hn, khi F c kch thc 1016 c th giu c khng qu 7 bit theo thut ton trong [1], nhng nu m rng gi tr giu c t 128 n 159 m mc nh hng, an ton nh nhau th r rng l tng dung lng ng k. Vic m rng gi tr c giu khng ch tng thm dung lng thng tin c giu m cn lm cho vic s dng thut ton mm do hn, khng b g b vo s bit thng tin cn giu trong khi. Vic la chn khi cng mm do hn, khng ph thuc vo vic la chn khi c kch thc ph hp vi ly tha ca 2. II. GIU B VO DY BT W K hiu xy l php ton XOR hai bit x v y. Cho trc s nguyn dng K, dy nh phn E = {e(1), e(2), ...,e(K)} v mt song nh f:{1,2,...,K} {1,2,...,K}. Thc cht, dy {f(1), f(2), ..., f(K)} l mt hon v no ca dy {1, 2, ..., K}. Cho dy nh phn W = {W(1), W(2), ..., W(K)}. K hiu: U = {W(1)e(1),..., W(K)e(K)} (1)
K

d =

i =1

i . U (i )

Xt cc trng hp: (C1): U(h) = 1. o bit W(h), gi tr mi ca U(h) bng 0. Khi ny

d =
*

i =1

d' =

i =1

i .U (i )

= dh

(5)

f (i ) .U (i )
1

(2)

(C2): U(K h) = 0. o bit W(K-h) gi tr mi ca U(Kh) bng 1. Tnh theo (2), ta c d= d + K h. (C3): Tn ti to [1..h] sao cho U(to) = 1 v U(to+Kh) = 0 hoc tn ti to [h+1,.., K h] sao cho U(to) = 1 v U(toh) = 0. Trong trng hp u o cc bit W(to) v W(to+K h) gi tr mi ca U(to) bng 0 v U(to+K h) bng 1. Suy ra d = d to + to + K h = d + Kh. 2

t : U (i) = U(f (i)) vi i = 1, 2, ..., K, ta c:

K

d = = =

f (i).U (i)
i =1 K

t .U ( f t .U
t =1 t =1 K *

(t ))

(t )

 Trong trng hp th hai, o cc bit W(to) v W(to-h), gi tr mi ca U(to) bng 0 v U(toh) bng 1. Khi ny d = d to + to h = d h. Nh vy, nu xy ra trng hp (C1) hoc (C2) phi o bit W(h) hoc bit W(Kh) l giu c b vo dy W. Trong trng hp khng xy ra (C1) cng nh (C2) v tn ti to tho mn (C3) phi thay i cp bit W(to) v W(to+Kh) hoc cp bit W(to) v W(toh) s giu c b vo dy W. Mnh : Cn thay i nhiu nht hai bit trong W l c th giu b vo W, vi 0 b< K. Chng minh: R rng l trong (3) khi db = 0, khng cn phi thay i W. Khi db>0 ta cn phi tng d (mod K) mt lng db tng ng vi vic gim d (mod K) mt lng h vi h = Kdb (h>0). V vy, theo nhn xt trn, ta ch cn chng minh cho trng hp db<0. T phn tch phn trn ta ch cn chng minh rng phi xy ra t nht mt trong ba trng hp (C1), (C2) hoc (C3). a) Xt trng hp (C2) v (C3) khng xy ra, ngha l: U(K-h) = 1 v t[1..h], U(t)=1 U(t+K-h)=1 t[h+1..K-h], U(t)=1 U(t-h)=1 t K = qh + , vi 0 < h, q1. Xt trng hp q>1. T (6) suy ra U(h+) = U(K-(q-1)h) = 1 thit 0, ta c U() = 1. T (6): U(2) = U( + K qh) = 1 (8) D dng thy U(x) = 1, vi 1 x [h/]+1. Vi x = [h/]+1 ta c U(x-h)=1. p dng (6) mt s ln ta c: U(xyh) =1, x, y: 1 xyh h (9) Chn x = h v y = -1 ta c U(h) = 1, ngha l (C1) xy ra. 3 (7) Nu =0 ta c U(h) = 1, ngha l (C1) xy ra. Gi (6)

Xt tng hp q = 1. Vi K = h + , < h, suy ra U() = U(K-h) =1. Tip tc xt nh chng minh trn, suy ra U(h) = 1. b) Xt trng hp (C1), (C3) khng xy ra. Ta c U(h) = 0 v t[1..h], U(t)=1 U(t+K-h)=1 t[h+1..K-h], U(t)=1 U(t-h)=1 Gi s U(K-h) = 1, chng minh tng t nh i vi trng hp a) suy ra U(h) = 1. iu ny mu thun vi gi thit U(h) = 0. V vy U(K-h) = 0, ngha l (C2) xy ra. c) Xt trng hp (C1) v (C2) khng xy ra, ngha l U(h) = 0 v U(K-h) = 1. Gi thit t[1..h ], U(t)=1 U(t+K-h) = 1 t[h+1..K-h], U(t)=1 U(t-h) =1 Chng minh tng t trng hp a) suy ra U(h) = 1. iu ny mu thun vi gi thit U(h) = 0, chng t tn ti to [1,h] sao cho U(to) = 1 v U(to+K-h) = 0 hoc to [h+1, K-h ] sao cho U(to) = 1 v U(toh) = 0. Ni cch khc nu (C1) v (C2) khng xy ra, ta c (C3). Mnh c chng minh xong. III. GIU THNG TIN VO NH Chia nh nh phn ban u thnh cc khi c kch thc mn. Chn K mn. Xy dng dy bit E = {e(1), e(2), ..., e(K)} ty v xc nh mt song nh f:{1,2,...,K} {1,2,...,K}. Dy bit E v nh x f c th c xy dng ring r cho tng khi hoc mt s khi nht nh hoc cho ton b cc khi. K hiu F = {F(i, j): 1 i m, 1 j n} l khi im nh nh phn c s dng v b, vi 0 b< K, l gi tr cn giu vo F. B1) Chuyn khi F vo dy W: W((i-1)n+j) = F(i,j), 1 i m, 1 j n B2) Tnh U, U* v d

U = {U(1), U(2), ...., U(K)} trong U(i) = W(i)e(i), i =1,2, .., K U (i) = U(f (i)), i = 1, 2, ..., K,
* 1
K

d = =

f (i).U (i)
i =1
K

Apparently neutral's protest is thoroughly discounted and ignored. Isman hard h

t .U
t =1

(t )

B3) Tnh db = b d (mod K) Trng hp db = 0 chuyn xung bc B4). Nu db<0 t li h = db,nu db>0 t li h = K db. a) Nu U*(h) = 1 o bit W f 1 (h ) . b) Nu
Hnh 1. nh nh phn giu on vn bn

W f

( (K h )).
1

U*(h)
*

0,
*

U*(K-h)

=0

bit

S cch la chn dy bit E l 2mn. V vy, r rng l trong trng hp bit c m, n v K, s tnh hung kim tra phi l
K 2 mn C mn K!

c) Nu U (h) = 0, U (K-h) = 1, tm to theo (C3), trong U* ng vai tr thay cho U, v o cp bit

IV. TH NGHIM V KT LUN So vi thut ton trong [1], thut ton xut y m rng c gi tr cn giu. Thut ton CPT trong [1] giu c r bit trong mt khi c kch thc mn > 2r. Bi bo chng minh c l c th giu c gi tr b mn-1. Chng hn, vi mt khi 1017, thut ton CPT ch c th giu c ti a 7 bit, thut ton m rng trong bi c th giu mt s nguyn khng m c gi tr ti a ti 169 m mc nh hng ti nh l nh nhau. V d, xt vn bn S c 560 k t:
Library of Congress Number: 2004114972. Copyright 2005 Symantec Corporation. All rights reserved. Printed in the United States of America. This publication is protected by copyright, and permission must be obtained from the publisher prior to any prohibited reproduction, storage in a retrieval system, or transmission in any form or by any means, electronic, mechanical, photocopying, recording, or likewise. For information regarding permissions, write to: Pearson Education, Inc. Rights and Contracts Department. One Lake Street. Upper Saddle River, NJ 07

W f 1 (t o ) v W f 1 (t o + K h ) hoc W f 1 (t o )
v
1 o

( W ( f (t h ))

ty theo to [1..h] hay to

[h+1,.., K h]. B4) Gn li d liu vo khi F: F(i,j) = W((i-1)n+j), 1 i m, 1 j n Vi tng khi ca nh nh phn ban u lm tng t nh cc bc t B1) n B4). V d trong Hnh 1 l nh nh phn ly t mn hnh c giu mt on vn bn theo thut ton c nu vi K = 16*16; cc thnh phn ca vect E: e(i) = 1, i = 1,2,...,256; nh x f c chn l f(t) = t, vi t = 1, 2, ..., 256. Vic thay i vect nh phn E hoc hon v f khng lm thay i cht lng nh c giu tin. Mc bo mt ca thng tin c giu so vi thut ton [1] khng thay i. Hin nhin l s cch la chn dy F l
K C mn K!

A)

chia nh vy, thut ton CPT trong [1] ch giu c 490 k t u tin ca S. Trong Hnh 2, B l nh giu 560 k t ca vn bn S theo phng php m rng trong bi; C l nh giu theo phng php CPT nhng ch giu c 490 k t u ca S. C hai nh khi c giu thng tin theo hai phng php u s

B)

dng khi c kch thc 1017. V mc nh hng ti nh cha tin giu, nu s dng cng mt kch thc khi 1017 thut ton CPT v phng php m rng cng phi sa ti a hai bit trong mi khi.
Tuy nhin, nu s dng khi vi kch thc mn = 2r hoc mn = 2r 1 th dung lng tin giu c l hon ton tng ng. Trong cc trng hp cn li, nu k hiu M (bit) l dung lng tin giu c theo phng php CPT th dung lng tin giu c theo phng php m rng l [M*(r+1)/r] bit, trong 2r 1 < mn, vi mn l kch thc khi im nh dng giu tin. ng ch l mc nh hng ti nh mang tin l hon ton nh nhau, v phc tp ca thut ton theo phng php m rng trong trng hp xu nht l

C) D)

O(K).
Hnh 2. A)- nh gc; B) nh c giu tin theo phng php m rng v C) - nh c giu tin theo phng php CPT

TI LIU THAM KHO

[1] YU-YUAN CHEN, HSIANG-KUANG PAN, YUCHEE TSENG, A Secure Data Hiding Scheme for TwoColor Images, Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000), July 04 - 06, 2000, pp. 750-755. [2] M.Y. WU and J.H. LEE. A Novel Data Embedding Method for Two-Color Facsimile Images. In Proceedings of International Symposium on Multimedia Information Processing, Chung-Li, Taiwan, R.O.C, December 1998. [3] LISA M.MARVEL, CHARLES G. BONCELET, CHARLES T. RETTER, "Spread Spectrum Image Steganography", IEEE Transactions On Image, Vol.8, No.8. 1999

Trong S, tr mt k t c m 169, cc k t cn li u c m khng qu 128. Cn giu S vo nh nh phn A) trong Hnh 2. nh nh phn A) c kch thc 400240. V m cc k t trong S ln nht l 169 cho nn nu s dng khi c kch thc 170 theo phng php xut trong bi bo l c th giu mi k t vo mt khi. Chia nh gc A) thnh cc khi c kch thc 170, chng hn 1017, ta c 560 khi. Vi thut ton m rng trong bi giu c ton b 560 k t ca S, trong khi , nu cng vi cch
5

[4] R. Z. WANG, C. F. LIN and J. C. LIN, "Image Hiding by LSB Substitution and Genetic Algorithm", 1998, Proceedings of International Symposium on Multimedia Information Processing, Chung-Li, Taiwan, R.O.C.

Ngy nhn bi: 01/03/2008 S LC TC GI O THANH TNH Sinh ngy 19/8/1956 ti Hng Yn. Tt nghip i hc tng hp Kisinhp nm 1984. Tt nghip Tin s 1995 ti HVKTQS. Ging dy ti Hc vin k thut qun s. Lnh vc quan tm: Thut ton, H thng thng tin. Email: dthuytuan@hn.vnn.vn TNG MINH C Sinh ngy 22/1/1976 ti Thanh Ha. Tt nghip i hc Cng ngh Thng tin ti Hc vin k thut qun s, nm 2000. Tt nghip Tin s ti Trng i hc tng hp k thut i n Xanhptcbua - Cng ha Lin bang Nga, nm 2007. Hin ang ging dy ti Hc vin K thut qun s. Hng nghin cu: Thut ton, H thng thng tin.

Email: tmduc08@gmail.com