• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 457
  • Last Modified:

IDEA reasons for multiplication mod 2^16 + 1

Hi.. i m not even sure if this is the correct place for this question or not...

but..

i was looking at the International Data Encryption Algorithm, and it has three vital parts to it are:

bit-by-bit exclusive-OR of two 16-bit sub-blocks

addition of integers modulo 2^16 where the 16-bit sub-block is treated as an unsigned integer

multiplication of integers modulo (2^16) + 1 where the 16-bit sub-block is treated as an unsigned integer except that the all-zero sub-block is treated as representing 2^16

why is it that in IDEA the addition is modulo 2^16 as opposed to say, (2^16) + 1 and why is multiplication (2^16)+1 as opposed to say 2^16?

Thanks,
0
sr11130107
Asked:
sr11130107
  • 2
1 Solution
 
gheistCommented:
Because 2^16+1 is prime number
0
 
sr11130107Author Commented:
well, yea. .but besides that trivial fact.. and then why is addition only 2^16..??

mabe it was just a design that suited it more. but was just curious..

if no more feedbakc, i'll motion for a delete..

thanks,
0
 
gheistCommented:
Mostly it is not used because it is heavily patented until 2011.
You are not cryptoanalyst as far as I see, basicaly multiplying by 2^n is same as bit shifting ( very simple to inverse )
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Featured Post

Keep up with what's happening at Experts Exchange!

Sign up to receive Decoded, a new monthly digest with product updates, feature release info, continuing education opportunities, and more.

  • 2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now