Chapter 1: Q28E (page 49)
In an RSA cryptosystem, p = 7and q = 11(as in Figure 1.9). Find appropriate exponents and .
Short Answer
The correct exponent of d is 37 and e is 13.
Chapter 1: Q28E (page 49)
In an RSA cryptosystem, p = 7and q = 11(as in Figure 1.9). Find appropriate exponents and .
The correct exponent of d is 37 and e is 13.
All the tools & learning materials you need for study success - in one app.
Get started for freeShow that any binary integer is at most four times as long as the corresponding decimal integer. For very large numbers, what is the ratio of these two lengths, approximately?
Calculate using any method you choose. (Hint: 127 is prime.)
Suppose you want to compute the nth Fibonacci number , modulo an integer . Can you find an efficient way to do this?
Wilson's theorem says that a numberis prime if and only if
.
(a) If is prime, then we know every number is invertible modulo . Which of thesenumbers is their own inverse?
(b) By pairing up multiplicative inverses, show thatrole="math" localid="1658725109805" for prime p.
(c) Show that if N is not prime, then .(Hint: Consider
(d) Unlike Fermat's Little Theorem, Wilson's theorem is an if-and-only-if condition for primality. Why can't we immediately base a primality test on this rule?
1.36. Square roots. In this problem, we'll see that it is easy to compute square roots modulo a prime pwith .
(a) Suppose . Show that is an integer.
(b) We say x is a square root of a modulo p if . Show that if and if a has a square root modulo p, then is such a square root.
What do you think about this solution?
We value your feedback to improve our textbook solutions.