I am now reading a paper 'The Exact Security of Digital Signatures - How to Sign with RSA and Rabin' and there is an equation e = (q_sig + q_hash) * e' on page 401. (e : success probability of RSA, e' : success probability of RSA-FDH)
What I want to know is the relation between query count(q_sig, q_hash) and security parameter k. Is query count is proportional to poly(k) or 2^k?
In case of RSA, k is the bit length of modulus. So I feel like it should be proportional to 2^k. And if it is proportional to 2^k, how is e is guaranteed to be negligible in case e' is be negligible?
Thanks in advance.