The algorithm Mod-Exp(b, e, n) computes the modular power be mod n, where b and n...

Transcribed Image Text:

The algorithm Mod-Exp(b, e, n) computes the modular power be mod n, where b and n are positive integers and e is a nonnegative integer. Determine asymptotic upper and lower bounds for Mod-Exp. Is it in a class? Mod-Exp (b, e, n) C = 0 d = 1 Let < > be the binary representation of e for i = k downto 0 c = 2c === (d*d) mod n d if e e == 1 C = c + 1 d = (db) mod n return d The algorithm Mod-Exp(b, e, n) computes the modular power be mod n, where b and n are positive integers and e is a nonnegative integer. Determine asymptotic upper and lower bounds for Mod-Exp. Is it in a class? Mod-Exp (b, e, n) C = 0 d = 1 Let < > be the binary representation of e for i = k downto 0 c = 2c === (d*d) mod n d if e e == 1 C = c + 1 d = (db) mod n return d

Answer rating: 100% (QA)

To analyze the complexity of the ModExp algorithm we can examine it step by step 1 The algorithm fir... View the full answer