Any public key decryption can be decrypted given enough time and computing power. Is there a metric or term for this? Something like
it would require on average 2^43 1024 bit hashes to find private key 'I' based on public key 'U'?
Is there a term that would sum up this average amount of work?
I'm a programmer but I don't know much about encryption, so any pointers to a intros on this subject that might cover this question appreciated.