Do My Homework
/
Homework Help Answers
/
Computer Science Homework Help
/ 2 Discrete Mathematics Questions
2 Discrete Mathematics Questions
Need help with this question or any other Computer Science assignment help task?
Instructions: Complete the following problems. Submit responses as a single PDF file in Blackboard. For full credit, solutions must be justified and include supporting work when appropriate.
2. Determine n between 0 and 25 for each problem below.
(a) 1883 + 3421 ≡ n (mod 26)
(b) (1883)(3421) ≡ n (mod 26)
(c) 18833421 ≡ n (mod 26) Hint: Show 188312 ≡ 1 (mod 26) as an intermediate step.
3. Use the integers modulo 26 to encode the standard 26 letter alphabet using 1 for a, 2 for b, and so on.
(a) Find the ciphertext message from encrypting the plaintext message, may the force be with you, using the affine cipher with encryption key c ≡ 5p + 2 (mod 26). Hint: The ciphertext is the message repeated with different letters as specified by the cipher.
(b) Decrypt the ciphertext message, DCBCP SVGJ ZPCQAODI, into plain English using the decryption key p ≡ 9c + 4 (mod 26).
There are no answers to this question.
Login to buy an answer or post yours. You can also vote on other
others
Get Help With a similar task to - 2 Discrete Mathematics Questions
Related Questions
Similar orders to
2 Discrete Mathematics Questions
Tutlance Experts offer help in a wide range of topics. Here are some
of our top services:
- Online writing help
- Online homework help
- Personal statement help
- Essay writing help
- Research paper help
- Term paper help
- Do my homework
- Online assignment help
- Online class help
- Dissertation help
- Thesis help
- Proofreading and editing help
- Lab report writing help
- Case study writing help
- White paper writing help
- Letter writing help
- Resume writing help
Post your project now for free and watch professional experts outbid each other in just a few minutes.