I need help with this question: - In computer science, we often struggle to find efficient algorithms
Question:
I need help with this question:
- In computer science, we often struggle to find efficient algorithms for problems, so we conjecture that they are hard. As we saw with graph isomorphisms, assuming this allows us to get zero-knowledge schemes. Let's use another common conjecture to form another zero-knowledge proof scheme. For the purposes of this section, p is a very large prime number.
- Definition 4.1. An integer g (mod p) is called a generator if every number in {1, 2, . . . , p − 1} can be written as ga (mod p) for some a.
- Here, in the modular arithmetic setting, we charge costs a little differently: adding or multiplying two numbers mod p costs $1. Making random numbers still costs the same. An algorithm is efficient in modular arithmetic if it's a polynomial in log2 p, the number of binary digits in p.
- Question (Already been answered)- Devise an efficient algorithm for computing ga (mod p).
- Answer -
Auditing Cases An Interactive Learning Approach
ISBN: 978-0132423502
4th Edition
Authors: Steven M Glover, Douglas F Prawitt