MODEL.

Realizati Algoritmul RIVEST CODE 2 Conform Scemei de mai jos.

Mesajul de criptare m= “criptare” Subkey CE

CRIPTARE
01100011 01110010 01101001 01110000
01110100 01100001 01110010 01100101
a => (01100011 01110010) b => (01101001 01110000)
c => (01110100 01100001) d => (01110010 01100101)
Subkey =CE=>(01000011 01000101)

1. a + subkey=>(01100011 01110010+01000011 01000101) mod 2^32=

(25458 +17221) mod 2^32 = 42679 = 10100110 10110111

2. c^d=> 01110100 01100001&

01110010 01100101=
01110000 01100001
3. (not d) ^ b= 01110000 01100001 &
01101001 01110000=
01100000 01100000

4. (c ^d) + (not d ^b) => (01110000 01100001+

01100000 01100000)mod2^32 =>
(28769+24672)mod2^32=>( 11010000 11000001)

5. (pt1)+(pt4) 1010011010110111+1101000011000001mod2^32 =>

(42679+ 53441) mod 2^32 = mod 2^32 =>96120 => (10111011 101111000)

6. Deplasament la stanga cu 4 (<<<4): 0000 000000010111011 101111000 0000

7. b => (01101001 01110000) c => (01110100 01100001)

d => (01110010 01100101) a=>(0000 0000000 10111011 101111000 0000)

8. Concatenare b,c,d,a => (01101001 0111000001110100 0110000101110010

011001010000 0000000 10111011 101111000 0000) “itre”

DECRIPTARE
1. Deplasamentul a la dreapta cu 4 (>>>4):
0000 0000000 10111011 101111000 0000 (>>>4):
10111011 101111000
2. c^d=> 01110100 01100001&
01110010 01100101=
01110000 01100001
3. (not d) ^ b= 01110000 01100001 &
01101001 01110000=
01100000 01100000

4. (c ^d) + (not d ^b) => (01110000 01100001+

01100000 01100000) mod 2^32 =>
(28769+24672)mod2^32 =>
11010000 11000001
5. (a - (b ^ (not d) + (c ^ d) )) =>
( 0000 0000000 10111011 101111000 0000 –
11010000 11000001) mod2^32=>
(96120 - 53441)mod2^32=>
42679=> (10100110 10110111)

6. a - FV=>(10100110 10110111 - 01000011 01000101) mod 2^32 =>(42679-

17221) mod2^32=25458=> 0110001101110010

Concatenare a ,b,c,d => (01100011 01110010 01101001 01110000

01110100 01100001 01110010 01100101)

“ criptare”