0

Why do we limit the number of queries to Encryption or Decryption oracles in the security analysis of various encryption schemes to be polynomial in the security parameter n?

Leli
  • 13
  • 2

1 Answers1

0

Typically we only consider adversaries that run in probabilistic polynomial time (PPT), to model real world, computationally bounded adversaries. If an adversary runs in polynomial time, it can only make polynomially-many queries. We wouldn't want to consider adversaries that could literally just try every possible secret key (brute force) in an exponentially-sized keyspace, for example.

meshcollider
  • 1,573
  • 1
  • 10
  • 14