a developer might look at a problem and go "I know! I'll use crypto!" Now he has 2^n problems.
2
5
3
Replying to @benadida
@benadida but it's in the group of integers mod P·Q, so 2ⁿ is still O(1) because there's an upper bound :-)

Aug 9, 2012 · 5:59 PM UTC