Python/hashes/adler32.py at master · ivan53/Python · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
"""
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995.
Compared to a cyclic redundancy check of the same length, it trades reliability for
speed (preferring the latter).
Adler-32 is more reliable than Fletcher-16, and slightly less reliable than
Fletcher-32.[2]

source: https://en.wikipedia.org/wiki/Adler-32
"""

MOD_ADLER=65521


defadler32(plain_text: str) ->int:
"""
 Function implements adler-32 hash.
 Iterates and evaluates a new value for each character

 >>> adler32('Algorithms')
 363791387

 >>> adler32('go adler em all')
 708642122
 """
a=1
b=0
forplain_chrinplain_text:
a= (a+ord(plain_chr)) %MOD_ADLER
b= (b+a) %MOD_ADLER
return (b<<16) |a
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
"""
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995.
Compared to a cyclic redundancy check of the same length, it trades reliability for
speed (preferring the latter).
Adler-32 is more reliable than Fletcher-16, and slightly less reliable than
Fletcher-32.[2]

source: https://en.wikipedia.org/wiki/Adler-32
"""

MOD_ADLER=65521


defadler32(plain_text: str) ->int:
"""
 Function implements adler-32 hash.
 Iterates and evaluates a new value for each character

 >>> adler32('Algorithms')
 363791387

 >>> adler32('go adler em all')
 708642122
 """
a=1
b=0
forplain_chrinplain_text:
a= (a+ord(plain_chr)) %MOD_ADLER
b= (b+a) %MOD_ADLER
return (b<<16) |a
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
"""
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995.
Compared to a cyclic redundancy check of the same length, it trades reliability for
speed (preferring the latter).
Adler-32 is more reliable than Fletcher-16, and slightly less reliable than
Fletcher-32.[2]

source: https://en.wikipedia.org/wiki/Adler-32
"""

MOD_ADLER=65521


defadler32(plain_text: str) ->int:
"""
 Function implements adler-32 hash.
 Iterates and evaluates a new value for each character

 >>> adler32('Algorithms')
 363791387

 >>> adler32('go adler em all')
 708642122
 """
a=1
b=0
forplain_chrinplain_text:
a= (a+ord(plain_chr)) %MOD_ADLER
b= (b+a) %MOD_ADLER
return (b<<16) |a
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
"""
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995.
Compared to a cyclic redundancy check of the same length, it trades reliability for
speed (preferring the latter).
Adler-32 is more reliable than Fletcher-16, and slightly less reliable than
Fletcher-32.[2]

source: https://en.wikipedia.org/wiki/Adler-32
"""

MOD_ADLER=65521


defadler32(plain_text: str) ->int:
"""
 Function implements adler-32 hash.
 Iterates and evaluates a new value for each character

 >>> adler32('Algorithms')
 363791387

 >>> adler32('go adler em all')
 708642122
 """
a=1
b=0
forplain_chrinplain_text:
a= (a+ord(plain_chr)) %MOD_ADLER
b= (b+a) %MOD_ADLER
return (b<<16) |a
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
"""
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995.
Compared to a cyclic redundancy check of the same length, it trades reliability for
speed (preferring the latter).
Adler-32 is more reliable than Fletcher-16, and slightly less reliable than
Fletcher-32.[2]

source: https://en.wikipedia.org/wiki/Adler-32
"""

MOD_ADLER=65521


defadler32(plain_text: str) ->int:
"""
 Function implements adler-32 hash.
 Iterates and evaluates a new value for each character

 >>> adler32('Algorithms')
 363791387

 >>> adler32('go adler em all')
 708642122
 """
a=1
b=0
forplain_chrinplain_text:
a= (a+ord(plain_chr)) %MOD_ADLER
b= (b+a) %MOD_ADLER
return (b<<16) |a
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
"""
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995.
Compared to a cyclic redundancy check of the same length, it trades reliability for
speed (preferring the latter).
Adler-32 is more reliable than Fletcher-16, and slightly less reliable than
Fletcher-32.[2]

source: https://en.wikipedia.org/wiki/Adler-32
"""

MOD_ADLER=65521


defadler32(plain_text: str) ->int:
"""
 Function implements adler-32 hash.
 Iterates and evaluates a new value for each character

 >>> adler32('Algorithms')
 363791387

 >>> adler32('go adler em all')
 708642122
 """
a=1
b=0
forplain_chrinplain_text:
a= (a+ord(plain_chr)) %MOD_ADLER
b= (b+a) %MOD_ADLER
return (b<<16) |a
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
"""
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995.
Compared to a cyclic redundancy check of the same length, it trades reliability for
speed (preferring the latter).
Adler-32 is more reliable than Fletcher-16, and slightly less reliable than
Fletcher-32.[2]

source: https://en.wikipedia.org/wiki/Adler-32
"""

MOD_ADLER=65521


defadler32(plain_text: str) ->int:
"""
 Function implements adler-32 hash.
 Iterates and evaluates a new value for each character

 >>> adler32('Algorithms')
 363791387

 >>> adler32('go adler em all')
 708642122
 """
a=1
b=0
forplain_chrinplain_text:
a= (a+ord(plain_chr)) %MOD_ADLER
b= (b+a) %MOD_ADLER
return (b<<16) |a
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
"""
Adler-32 is a checksum algorithm which was invented by Mark Adler in 1995.
Compared to a cyclic redundancy check of the same length, it trades reliability for
speed (preferring the latter).
Adler-32 is more reliable than Fletcher-16, and slightly less reliable than
Fletcher-32.[2]

source: https://en.wikipedia.org/wiki/Adler-32
"""

MOD_ADLER=65521


defadler32(plain_text: str) ->int:
"""
 Function implements adler-32 hash.
 Iterates and evaluates a new value for each character

 >>> adler32('Algorithms')
 363791387

 >>> adler32('go adler em all')
 708642122
 """
a=1
b=0
forplain_chrinplain_text:
a= (a+ord(plain_chr)) %MOD_ADLER
b= (b+a) %MOD_ADLER
return (b<<16) |a