parthzaveri89
Newbie level 1
- Joined
- Mar 27, 2013
- Messages
- 1
- Helped
- 0
- Reputation
- 0
- Reaction score
- 0
- Trophy points
- 1,281
- Activity points
- 1,289
Hi all,
Could someone please help me understand the bit rotation operation performed on the Scalable Encryption Algorithm. In what word size do the bits combined and how is the bits operation performed on it ?
As we assume N = 48bits and b = 8bits therefore Nb turns out to be 3.
Also i would like thank you all in advance for your responses.
Regards
Parth Zaveri
- - - Updated - - -
Hi all,
Also could someone explain about the bitwise to any set of three words of data using the following recursive definition of the S-box:
x3i = (x3i+2 ^ x3i+1) © x3i,
x3i+1 = (x3i+2 ^ x3i) © x3i+1,
x3i+2 = (x3i | x3i+1) © x3i+2, 0 · i · nb/3 -1
where © represents the ex-or operation.
where ^ and | respectively represent the bitwise AND and OR.
Thank you.
Could someone please help me understand the bit rotation operation performed on the Scalable Encryption Algorithm. In what word size do the bits combined and how is the bits operation performed on it ?
As we assume N = 48bits and b = 8bits therefore Nb turns out to be 3.
Also i would like thank you all in advance for your responses.
Regards
Parth Zaveri
- - - Updated - - -
Hi all,
Also could someone explain about the bitwise to any set of three words of data using the following recursive definition of the S-box:
x3i = (x3i+2 ^ x3i+1) © x3i,
x3i+1 = (x3i+2 ^ x3i) © x3i+1,
x3i+2 = (x3i | x3i+1) © x3i+2, 0 · i · nb/3 -1
where © represents the ex-or operation.
where ^ and | respectively represent the bitwise AND and OR.
Thank you.