2. Alice signs the hash of a message. Suppose her hash function satisfies \( h(x) \equiv 2^{x}(\bmod 101) \) and \( 1 \leq h(x) \leq 100 \) for all \( x \). Suppose \( m \) is a valid signed message from Alice. Give another message \( m_{1} \) for which the same signature is also valid.
Added by Tammy J.
Close
Step 1
Alice signs the hash of a message using a hash function \( h(x) \equiv 2^x \pmod{101} \). We need to find another message \( m_1 \) such that the hash of \( m_1 \) is the same as the hash of \( m \). Show more…
Show all steps
Your feedback will help us improve your experience
William Mead and 97 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
3.7. Alice publishes her RSA public key: modulus N = 2038667 and exponent e = 103. (a) Bob wants to send Alice the message m = 892383. What ciphertext does Bob send to Alice? (b) Alice knows that her modulus factors into a product of two primes, one of which is p = 1301. Find a decryption exponent d for Alice. (c) Alice receives the ciphertext c = 317730 from Bob. Decrypt the message.
Madhur L.
Sri K.
Shu N.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD