MT THUT TON MI GIU TIN TRONG NH NH PHN S DNG TNH CHN L CA CC KHI BIT

ThS. NGUYN HIU CNG

B mn Cng ngh phn mm Khoa Cng ngh thng tin Trng i hc Giao thng Vn ti Tm tt: Bo co trnh by mt thut ton mi giu tin trong nh nh phn s dng tnh chn l ca cc khi bit. Thut ton c th giu c mt bit vo mi khi nh bng cch thay i nhiu nht mt phn t ca khi , trong khi tnh bo mt v cht lng nh sau khi giu tin ca thut ton ny kh cao. Summary: The paper presents a new algorithm for hiding data in binary images using parity blocks. The algorithm can hide one bit in each image block by changing at most one bit in the block. It has also good quality in security and stego-images.

I. T VN

CBCNTT

Giu tin l k thut nhm giu nhng thng tin s cn bo mt vo trong mt i tng d liu s khc (gi l mi trng giu tin) sao cho s bin i ca mi trng sau khi giu tin l rt kh nhn bit, do vy i phng s khng th bit c trong mt i tng no c giu thng tin mt hay khng. Giu tin l gii php hiu qu cho nhiu vn trong bo mt thng tin hin nay, nh truyn tin b mt, bo v bn quyn, xc thc thng tin, Mi trng giu tin c th l bt k i tng d liu a phng tin no nhng ph bin nht l nh s. Cc thut ton giu tin trong nh thng s dng nh mu hoc nh a mc xm lm mi trng giu tin, do chng c mi trng dy v v th lng tin c th giu c ln v tnh che giu cao. Giu tin trong nh nh phn l mt thch thc ln hn, v khng nh cc loi nh trn, mi trng giu tin trong nh nh phn rt tha, mi im nh ca n ch c th hin bi mt bit nn s rt d b pht hin khi c bt k s bin i no [2, 3, 4]. Trong thi gian gn y nhm tc gi Venkatesan trng i hc k thut Rangasamy xut mt thut ton giu tin trong nh nh phn [1]. Thut ton ny s dng k thut giu tin da trn tnh chn l ca cc khi bit 33, mi khi giu c mt bit bng cch thay i ti a mt phn t trong khi . Thut ton s dng mt k thut chn bit thay i sao cho nh sau khi giu tin t b nh hng nht. Tuy nhin thut ton trong [1] c bo mt thp, tc l trong trng hp i phng bit mt bc nh c giu tin bng thut ton ny th s d dng trch rt c thng tin giu. Trong bo co ny s trnh by mt thut ton mi, ci tin t thut ton trong [1], cng da trn tnh chn l ca cc khi bit, nhng c s dng thm mt ma trn kha tng cng tnh bo mt cho thut ton giu tin. Khi nhn c nh c tin giu, ngi nhn cn phi c

thm ma trn kha mi c th trch rt c thng tin. Khi bit c s dng khng ch c nh l 33 m c th l mn bt k. Cc tham s m v n cng l nhng yu t tng thm tnh bo mt, ng thi c th la chn linh hot cc gi tr ca chng tng cht lng nh sau khi giu tin. Nu lng tin cn giu nh so vi nh gc th c th iu chnh tng gi tr m v n ln sao cho tin giu c tri u trn ton nh, thay v ch tp trung vo mt phn nh pha trn nh, do mt cc bit phi thay i s thp, nn tnh che giu ca nh s cao hn. Ngoi ra cht lng nh sau khi giu cn c nng cao hn do trong thut ton mi ny, nhng khi ton mu en hoc ton mu trng s khng c s dng giu tin.
II. MT S NH NGHA

nh ngha 1. Php ton ^ l php AND tng phn t ca hai ma trn cng cp. Vi A, B l cc ma trn cng cp mn, ta c C = A^B cng l ma trn cp mn trong C[j,k] = A[j,k] AND B[j,k], vi j = 1, 2, , m, k = 1, 2, , n. nh ngha 2. Php ton SUM(F) tnh tng cc phn t ca ma trn F. nh ngha 3. Phn t lng ging ca phn t F[j,k] l phn t F[u,v] tha mn cc iu

1 u j + v k 2 kin: u j < 2 vk < 2

nh ngha 4. Ma trn lng ging ca ma trn F cp mn l ma trn N cp mn trong N[j,k] l s phn t lng ging thuc khi F ca F[j,k] m c gi tr khc vi F[j,k]. V d:
CB-CNTT

1 1 1 Nu F = 0 0 1 0 0 1
III. NI DUNG THUT TON

2 2 1 th N = 2 5 2 0 2 2

D liu vo: + F: nh nh phn c dng giu tin + m v n: Kch thc ca khi con Fi ca F + K: Ma trn nh phn cp mn vi cc gi tr c la chn ngu nhin + B: Dy bit cn giu vo F F l mt ma trn nh phn v c phn hoch thnh cc khi Fi cp mn. Mi khi Fi s c s dng giu mt bit b ca B bng cch thay i nhiu nht mt phn t trong Fi. Ma trn K l kho b mt, c tha thun gia ngi gi v ngi nhn. Ngi gi s dng K trong qu trnh giu tin v ngi nhn sau khi c nh F cha tin giu cn phi c thm

K c th khi phc li thng tin giu. D liu ra: + F: nh nh phn cha dy bit B, trong mi khi Fi cp mn l mt phn hoch ca F giu mt bit b ca B v Fi khc Fi nhiu nht l mt bit. Thut ton thc hin giu tng bit b ca B tun t vo mi khi Fi ca F theo cc bc sau: Bc 1: + Tnh SUM(Fi) + Nu SUM(Fi) = 0 hoc SUM(Fi) = mn th b qua khng giu tin vo khi Fi ny, chuyn sang xt khi Fi tip theo. + Nu 0 < SUM(Fi) < mn th chuyn sang bc 2 giu tin. Vic giu tin vo Fi thc cht l bin i Fi thnh Fi sao cho tha mn mt bt bin no . Bt bin ny cng chnh l du hiu c th khi phc li thng tin giu. Trong thut ton ny bt bin cn t c l SUM(Fi ^ K) = b (mod 2), ni cch khc b phi c cng tnh chn l vi SUM(Fi ^ K). Bc 2: + Tnh S = SUM(Fi ^ K) + Nu S = b (mod 2) th t bt bin, do trng hp ny giu c mt bit vo Fi m khng cn phi bin i Fi. + Nu S b (mod 2) th cn phi bin i Fi sao cho t c bt bin. lm vic ny ch cn thay i mt bit trong Fi sao cho tnh chn l ca S thay i l c. y l trng hp giu mt bit vo Fi bng cch thay i mt phn t trong Fi. Tuy nhin qua th nghim thy rng vi k thut thay i bit ngu nhin, tc l s dng mi khi Fi giu tin v trong trng hp cn thay i mt phn t trong Fi li thay i mt phn t bt k min sao t c bt bin th cht lng nh sau khi giu s khng c tt, xut hin kh nhiu im bt thng. Do mt vn c t ra l cn mt k thut thay i bit c chn lc: xc nh ng cc khi Fi giu tin v v tr phn t cn thay i trong Fi sao cho nh t b nh hng nht. Trong bc 1, trnh giu vo cc khi ton mu en hoc ton mu trng, ta a ra iu kin ch giu vo cc khi Fi tha mn 0 < SUM(Fi) < mn. Trong bc 2 ny, trng hp giu bit b m cn phi thay i mt phn t ca khi Fi th ta khng thay i ngay mt phn t bt k m chuyn sang bc 3 xc nh phn t thch hp nht. Bc 3: + Xy dng ma trn lng ging Ni ca ma trn Fi + Xc nh phn t Ni[j,k] c gi tr ln nht trong ma trn Ni m c K[j,k] = 1 + Thay i phn t Fi[j,k] Vi tnh cht ca ma trn lng ging th r rng nu Ni[j,k] c gi tr ln nht v K[j,k] = 1 th sau khi thay i Fi[j,k] ta s nhn c Fi tha mn bt bin v Fi[j,k] c nhiu phn t lng ging ging n nht, do s hn ch cc im bt thng v nng cao c cht lng

CBCNTT

nh sau khi giu tin. V d:

1 1 1 Nu Fi = 0 0 1 0 0 1

2 2 1
Th Ni = 2

5 2 0 2 2

1 1 0 Chn K = 0 1 1 1 0 0

Gi s bit cn giu vo Fi l bit 0. V SUM(Fi) = 5 tha mn 0 < SUM(Fi) < 9 nn c th s dng Fi giu tin. V SUM(Fi ^ K) = 3 khc tnh chn l vi 0 nn giu c bit 0 vo Fi cn phi thay i mt phn t trong Fi. Do Ni[2,2] c gi tr ln nht v K[2,2] = 1 nn phn t c chn thay i l Fi[2,2].

1 1 1 Kt qu sau khi giu bit 0 vo Fi, c Fi = 0 1 1 . 0 0 1

Nhn xt: Vic la chn kha K l hon ton ngu nhin, do s kh nng la chn c th ln n 2mn. Khi K cng c nhiu bit 0 th xc sut cc phn t Ni[j,k] c gi tr ln nht trong ma trn lng ging m c K[j,k] = 1 cng nh, v th s hn ch kh nng la chn phn t tt nht thay i. Tt nhin, nu K gm ton bit 0 th ta khng th s dng n trong thut ton ny giu tin c. khi phc li tin giu: Thut ton ny c th khi phc li thng tin giu m khng cn c nh gc. khi phc thng tin cn: nh nh phn F c cha tin giu v ma trn kha K cp mn. Qui trnh khi phc tin c thc hin ngc vi qui trnh giu tin, theo cc bc: + Phn hoch F thnh cc khi Fi cp mn, sau thc hin tun t trn cc khi Fi cc cng vic sau: + Tnh SUM(Fi) + Nu SUM(Fi) = 0 hoc SUM(Fi) = mn th chuyn sang khi Fi tip theo v trong khi Fi ny khng c tin giu. + Nu 0 < SUM(Fi) < mn th chng t trong khi Fi ny c tin giu, v ta cn khi phc li bit thng tin ny. Tnh gi tr b = SUM(Fi ^ K) mod 2, v b chnh l bit c giu trong Fi.
IV. TH NGHIM
CB-CNTT

Chng trnh th nghim giu mt nh nh phn logo.bmp (hnh 1) c kch thc 5454 vo trong mt nh nh phn cachep.bmp (hnh 2) kch thc 210210, vi kch c cc phn hoch trn nh gc l 33. Kt qu th nghim giu tin c th hin trong cc hnh 3, 4 v 5.

cachep.bmp

cachep_ngaunhien.bmp

logo.bmp

Hnh 1. nh cn giuHnh Hnh 2. nh gc trc khi giu tin

cachep_chonloc1.bmp

Hnh 3. nh sau khi giu logo.bmp bng k thut thay i bit ngu nhin
cachep_chonloc.bmp

CBCNTT

Hnh 4. nh sau khi giu logo.bmp bng k thut chn khi giu nhng khi ton mu en hoc ton mu trng khng c s dng giu tin V. KT LUN

Hnh 5. nh sau khi giu logo.bmp bng k thut chn khi giu v chn bit thch hp trong khi thay i vi vic s dng ma trn lng ging ca khi

Bo co trnh by mt thut ton mi giu tin trong nh nh phn. Thut ton c th giu mt bit vo mi khi nh mn bng cch thay i nhiu nht mt phn t trong khi . Thut ton s dng tnh chn l ca cc khi bit xy dng bt bin, s dng mt ma trn kha tng tnh bo mt v dng k thut thay i bit c chn lc nng cao cht lng nh sau khi giu.

Ti liu tham kho [1]. M. Venkatesan, P. Meenakshi Devi, K. Duraiswamy, K. Thiagarajah. A New Data Hiding Scheme with Quality Control for Binary Images Using Block Parity. 3rd International Symposium on Information Assurance and Security, IEEE, 2007. [2]. M. Wu, J. Lee. A Novel Data Embedding Method for Two-Color Fascimile Images. In Proceedings of International Symposium on Multimedia Information Processing. Chung-Li, Taiwan, R.O.C, 1998. [3]. C. Chan, C. Chang. A Survey of Information Hiding Schemes for Digital Images. IJCSES International Journal of Computer Sciences and Engineering Systems, Vol.1, No.3, July 2007. [4]. Phm Vn t, Nguyn Hiu Cng, Vn Tun. Giu tin trong nh nh phn v ng dng. Tp ch Khoa hc Giao thng vn ti, s 19, thng 9 nm 2007