Hey there, I'm Tim and will need access granted to see what this doc is, i'm assuming its homework?
Gotcha man, I'm going to pass on this one and open up the question to others.
here is the updated link
I think, I can help you in it.
By when do you need it ?
Two days from now
Alright !! Hopefully I will be able to complete it by then.
Thank you for responding. Have you looked into the questions?
Hi, Yes I looked into it but I am not yet done.
I am sorry, I could not get the expected result of your first 2 question. I answered your last question in it. I am opting out so that other experts can reply to you.
Hi. I would be happy to help you. Among other things, I am a former professor of EE and comp E.
Is that all the information you have to complete the assignment?
Yup that is it
Sixteen iterations are required for problem 1, and more than that for problem 2. This is a lot more effort than you may have imagined.
As for the proposed answer to problem 3, it is correct for the asymmetric case but NOT NECESSARILY CORRECT for the symmetric case. The answer for the latter depends upon how the cryptosystem is set up. If if is end-to-end, there are 20 x 19 possible ordered pairs of communicants, so the number of underordered pairs is indeed 190. In other cases, the answer differs.
check this out
No, thank you. I cannot complete the work within the specified parameters. Sorry. Best of luck!