Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
II. THEORIES
A. Data Integrity
Security goals cover three points such as availability,
confidentiality, and integrity [7]. A Understanding data
integrity broadly refers to the confidence of resource system.
Data integrity is paramount because it can ensure the data
accuracy, consistency, accessibilities, and the high quality.
Following the integrity rules is important. Data with integrity is
identical on hold during any operation such as business transfer,
storage or retrieval. In simple computer terms, data integrity is
the assurance that data is consistent, certified and referenced.
Data integrity means that the accuracy and correctness. Data
integrity in a database system must be maintained to keep the
truth of the stored data. Figure 1 illustrate the scheme of data
integrity.
I. INTRODUCTION
Integrity is an aspect that ensures that the data must not be
changed without the permission of the authorized competent
[3]. For the application of digital imaging, integrity aspect is
paramount. It contains the confidential information [2]. Access
to data is often sought after by intruders [6][9]. The picture that
has been submitted cannot be changed by the unauthorized
parties. Violation of this would result in malfunctioning of the
validation. It is especially in the fields of education, medicine,
military, etc. It needs to prove the originality of the content.
Some of them are used as the evidence of a fact. The integrity
validation is not only saving someone's life, but it can be
implemented on a security side. The highly use of imaging
system leads to the data exchange over the air while attaching
to the international network. While communication it is
imperative to verify the message so that intruder cannot replace
with the fake information [5]. For example, when the computer
sends the picture, the third party can intercept it in the air,
modify the content of the picture and send it to its destination.
We should send them with the verification or the message
digest. When the receiver checks the hash of the image, they
can compare it to the hash send simultaneously. Sometimes, we
do not understand what they are. The information retrieved is
used directly without verification. Once we start it, it might run
the script consists of some trojan or virus lines. Certain methods
of checksums provide the way to verification to ensure the
image integrity [6]. Adler-32 presents to be a practical approach
to help manage the originality.
B. Hash Function
D. Image Preprocessing
max(,,)+min(,,)
++
Adler-32(D) = B 65536 + A
(2)
(3)
C. Adler-32
Mark Adler invented the Adler-32 hash function. He created
in 1995 and modified the Fletcher checksum. The length is
same as CRC. It offers the speed of validation process. He
claimed that Adler-32 is more reliable than Fletcher-16 and
slightly less reliable than Fletcher-32. It is obtained by
calculating two 16-bit checksums A and B and concatenating
their bits into a 32-bit integer. It runs on the hexadecimal
platform. A is the sum of all bytes in the stream plus one, and
B is the sum of the individual values of A from each step. At
the beginning of an Adler-32 run, A is initialized to 1, B to 0.
The sums are done modulo 6552. The bytes are stored in
network order, B occupying the two most significant bytes [8].
(1)
R11
R21
R31
R41
R51
R12
R22
R32
R42
R52
G11
G21
G31
G41
G51
G12
G22
G32
G42
G52
RED
R13
R23
R33
R43
R53
R14
R24
R34
R44
R54
R15
R25
R35
R45
R55
GREEN
G13 G14
G23 G24
G33 G34
G43 G44
G53 G54
G15
G25
G35
G45
G55
= . 65536 +
B11
B21
B31
B41
B51
BLUE
B13
B23
B33
B43
B53
B12
B22
B32
B42
B52
B14
B24
B34
B44
B54
Where:
B15
B25
B35
B45
B55
I
A
B
D
++
3
(7)
:
:
:
:
Grayscale Intensity
The sum of all bytes
The sum of the individual values of A
Adler-32
(4)
Where:
I
R
G
B
:
:
:
:
New Intesity
Red Color Intensity
Green Color Intensity
Blue Color Intensity
I11
I21
I31
I41
I51
GRAYSCALE
I12
I13
I14
I22
I23
I24
32
33
I
I
I34
42
43
I
I
I44
I52
I53
I54
I15
I25
I35
I45
I55
Figure 4. A 10 x 15 image
= 1 +
(5)
=0
=
=0
(6)
200
238
199
161
181
216
192
107
99
142
177
161
162
213
211
168
194
235
197
79
97
166
162
165
239
214
186
89
57
197
198
96
111
178
234
239
254
199
40
28
62
90
126
144
144
223
255
254
255
240
155
64
70
114
131
91
128
235
242
253
254
254
237
122
60
90
69
48
54
87
77
169
247
254
214
103
53
28
36
43
35
56
37
76
235
248
243
115
35
59
26
28
31
29
104
114
A
1
201
439
638
799
980
1196
1388
1495
1594
1736
1913
2074
2236
2449
2660
2828
3022
3257
3454
3533
3630
3796
3958
4123
4362
4576
4762
4851
4908
5105
5303
5399
5510
5688
5922
6161
B
0
201
640
1278
2077
3057
4253
5641
7136
8730
10466
12379
14453
16689
19138
21798
24626
27648
30905
34359
37892
41522
45318
49276
53399
57761
62337
67099
71950
76858
81963
87266
92665
98175
103863
109785
115946
No.
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
A
6415
6614
6654
6682
6744
6834
6960
7104
7248
7471
7726
7980
8235
8475
8630
8694
8764
8878
9009
9100
9228
9463
9705
9958
10212
10466
10703
10825
10885
10975
11044
11092
11146
11233
11310
11479
11726
B
122361
128975
135629
142311
149055
155889
162849
169953
177201
184672
192398
200378
208613
217088
225718
234412
243176
252054
261063
270163
279391
288854
298559
308517
318729
329195
339898
350723
361608
372583
383627
394719
405865
417098
428408
439887
451613
No.
75
76
77
78
79
80
81
82
83
84
85
86
A
11980
12194
12297
12350
12378
12414
12457
12492
12548
12585
12661
12896
B
463593
475787
488084
500434
512812
525226
537683
550175
562723
575308
587969
600865
No.
87
88
89
90
91
92
93
94
95
96
97
A
13144
13387
13502
13537
13596
13622
13650
13681
13710
13814
13928
B
614009
627396
640898
654435
668031
681653
695303
708984
722694
736508
750436
=
=
=
=
A % MOD_ADLER
A % 65521
13928 % 65521
13928
=
=
=
=
B % MOD_ADLER
B % 65521
750436 % 65521
29705
AD
=
=
=
=
B . 65536 + A
29705 . 65536 + 13928
1946760808 (decimal)
74093668 (hexadecimal)
A
1
199
438
636
796
978
1195
1387
1494
1593
1735
1912
2073
2237
2451
2662
2830
3024
3258
3455
3534
3631
3797
3959
4124
4363
4577
4763
4851
4907
5104
5303
5399
5510
5688
5922
6161
6415
6613
6653
6681
6743
B
0
199
637
1273
2069
3047
4242
5629
7123
8716
10451
12363
14436
16673
19124
21786
24616
27640
30898
34353
37887
41518
45315
49274
53398
57761
62338
67101
71952
76859
81963
87266
92665
98175
103863
109785
115946
122361
128974
135627
142308
149051
No.
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
A
6832
6959
7103
7247
7470
7725
7979
8234
8474
8629
8693
8763
8877
9008
9099
9227
9462
9704
9957
10211
10465
10703
10824
10884
10974
11044
11092
11146
11233
11310
11479
11728
11982
12196
12300
12353
12380
12416
12459
12494
12550
12587
B
155883
162842
169945
177192
184662
192387
200366
208600
217074
225703
234396
243159
252036
261044
270143
279370
288832
298536
308493
318704
329169
339872
350696
361580
372554
383598
394690
405836
417069
428379
439858
451586
463568
475764
488064
500417
512797
525213
537672
550166
562716
575303
No.
85
86
87
88
89
90
91
A
12663
12897
13145
13388
13503
13538
13597
B
587966
600863
614008
627396
640899
654437
668034
No.
92
93
94
95
96
A
13623
13652
13683
13712
13816
B
681657
695309
708992
722704
736520
97
13930
750450
=
=
=
=
A % MOD_ADLER
A % 65521
13930 % 65521
13930
=
=
=
=
B % MOD_ADLER
B % 65521
750450 % 65521
29719
AD
=
=
=
=
B . 65536 + A
29719. 65536 + 13930
1947678314 (decimal)
7417366A (hexadecimal)
REFERENCES
[1] A. P. U. Siahaan, Three-Pass Protocol Concept in Hill
Cipher Encryption Technique, SNATI, Yogyakarta, 2016.
[2] A. P. U. Siahaan, RC4 Technique in Visual
Cryptography, SNATIA, Semarang, 2016.
[3] B. Forouzan, Cryptography and Network Security,
McGraw-Hill, 2006.
[4] H. Anton dan C. Rorres, Elementary Linear Algebra,
2011: John Wiley & Sons.
[5] R. Bhanot dan R. Hans, A Review and Comparative
Analysis
of Various
Encryption Algorithms,
International Journal of Security and Its Applications, vol.
9, no. 4, pp. 289-306, 2015.
[6] S. K. Das, G. Sharma dan P. K. Kevat, Integrity and
Authentication using Elliptic Curve cryptography,
Imperial Journal of Interdiscliplinary Research, vol. 2, no.
5, 2016.
[7] D. Shah, Digital Security Using Cryptographic Message
Digest Algorithm, International Journal of Advance
Research in Computer Science and Management Studies,
vol. 3, no. 10, pp. 215-219, 2015.
[8] M. Adler, Wikipedia, Wikipedia, 22 3 2016. [Online].
Available:
https://en.wikipedia.org/wiki/Adler-32.
[Diakses 8 7 2016].
[9] A. P. U. Siahaan, BPCS Steganography Noise-For
Region Security Improvisation, International Journal of
Science & Technoledge, vol. 4, no. 6, 2016.