Chapter 1: Q21E (page 49)
How many integers modulo have inverses?
Short Answer
The number of integers coprime to are 1210
Chapter 1: Q21E (page 49)
How many integers modulo have inverses?
The number of integers coprime to are 1210
All the tools & learning materials you need for study success - in one app.
Get started for freeGive an efficient algorithm to compute the least common multiple of two n-bit numbers and , that is, the smallest number divisible by both and . What is the running time of your algorithm as a function of ?
What is the least significant decimal digit of ? (Hint: For distinct primesp,q, and any a is not equal to role="math" localid="1658726105638" , we proved the formula role="math" localid="1658726171933" in Section 1.4.2.)
Show that if and if Divides
Digital signatures, continued.Consider the signature scheme of Exercise .
(a) Signing involves decryption, and is therefore risky. Show that if Bob agrees to sign anything he is asked to, Eve can take advantage of this and decrypt any message sent by Alice to Bob.
(b) Suppose that Bob is more careful, and refuses to sign messages if their signatures look suspiciously like text. (We assume that a randomly chosen messagethat is, a random number in the range is very unlikely to look like text.) Describe a way in which Eve can nevertheless still decrypt messages from Alice to Bob, by getting Bob to sign messages whose signatures look random.
Show that
(Hint: To show an upper bound, compare with . To show a lower bound, compare it with ).
What do you think about this solution?
We value your feedback to improve our textbook solutions.