Done1
asked on
DES properties and multiple encryptions
Have 2 small questions...
suppose the round function in the the 16 rounds of DES is replaced with a function that sets all the bits to zero:
Fi(Ri-1,ki)-->{0}^32
Now what function would DES compute now?
And why is double encrypting with DES (2DES = DESk1(DESk2(m))) not efficient? and how it may be broken...
Thanks!
suppose the round function in the the 16 rounds of DES is replaced with a function that sets all the bits to zero:
Fi(Ri-1,ki)-->{0}^32
Now what function would DES compute now?
And why is double encrypting with DES (2DES = DESk1(DESk2(m))) not efficient? and how it may be broken...
Thanks!
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.