We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute-force. But is this the definition?

Is a cipher broken if you can get the key faster than brute-force? Or is there another definition for "broken"? Because if you have a 128-bit key and it takes $2^{126.5}$ operations to break it, I wouldn't call that broken, for that I find broken a bit of a strong word.

I did find this for an asymmetric key and the quote:

An asymmetric authentication scheme is considered to be broken if an attacker with access to the verification key can generate any valid cipher text, even if he can convince you to sign arbitrary other plain texts.

...which isn't really applicable to symmetric keys. It is a perfect answer for asymmetric encryption but I'm looking for something more general or I could make a distinction between symmetric and asymmetric but then I would still like to know, when is a symmetric encryption scheme deemed broken?

We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute-force. But is this the definition?

Is a cipher broken if you can get the key faster than brute-force? Or is there another definition for "broken"? Because if you have a 128-bit key and it takes $2^{126.5}$ operations to break it, I wouldn't call that broken, for that I find broken a bit of a strong word.

I did find this for an asymmetric key and the quote:

An asymmetric authentication scheme is considered to be broken if an attacker with access to the verification key can generate any valid cipher text, even if he can convince you to sign arbitrary other plain texts.

...which isn't really applicable to symmetric keys. It is a perfect answer for asymmetric encryption but I'm looking for something more general or I could make a distinction between symmetric and asymmetric but then I would still like to know, when is a symmetric encryption scheme deemed broken?

We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute-force. But is this the definition?

Is a cipher broken if you can get the key faster than brute-force? Or is there another definition for "broken"? Because if you have a 128-bit key and it takes $2^{126.5}$ operations to break it, I wouldn't call that broken, for that I find broken a bit of a strong word.

I did find this for an asymmetric key and the quote:

An asymmetric authentication scheme is considered to be broken if an attacker with access to the verification key can generate any valid cipher text, even if he can convince you to sign arbitrary other plain texts.

...which isn't really applicable to symmetric keys. It is a perfect answer for asymmetric encryption but I'm looking for something more general or I could make a distinction between symmetric and asymmetric but then I would still like to know, when is a symmetric encryption scheme deemed broken?

We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute-force. But is this the definition?

Is a cipher broken if you can get the key faster than brute-force? Or is there another definition for "broken"? Because if you have a 128-bit key and it takes $2^{126.5}$ operations to break it, I wouldn't call that broken, for that I find broken a bit of a strong word.

I did find this for an asymmetric key and the quote:

An asymmetric authentication scheme is considered to be broken if an attacker with access to the verification key can generate any valid cipher text, even if he can convince you to sign arbitrary other plain texts.

...which isn't really applicable to symmetric keys. It is a perfect answer for asymmetric encryption but I'm looking for something more general or I could make a distinction between symmetric and asymmetric but then I would still like to know, when is a symmetric encryption scheme deemed broken?

We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute force. but is this the definition?

Is a cipher broken if you can get the key faster than bruteforce? or is there an other definition for broken? because if you have a 2^128 bit key and it takes 2^126.5 to break, i wouldn't call that broken, for that i find broken a bit of a strong word.

I did find this for an assymentric key and the quote:

An asymmetric authentication scheme is considered to be broken if an attacker with access to the verification key can generate any valid cipher text, even if he can convince you to sign arbitrary other plain texts.

Which isn't really applicable to symmetric keys, it is a perfect answer to asymmetric encryption but i'm looking for something more general or i could make a distinction between symmetric and asymmetric but then i would still like to know, when is a symmetric encryption deemed broken?

We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute-force. But is this the definition?

Is a cipher broken if you can get the key faster than brute-force? Or is there another definition for "broken"? Because if you have a 128-bit key and it takes $2^{126.5}$ operations to break it, I wouldn't call that broken, for that I find broken a bit of a strong word.

I did find this for an asymmetric key and the quote:

An asymmetric authentication scheme is considered to be broken if an attacker with access to the verification key can generate any valid cipher text, even if he can convince you to sign arbitrary other plain texts.

...which isn't really applicable to symmetric keys. It is a perfect answer for asymmetric encryption but I'm looking for something more general or I could make a distinction between symmetric and asymmetric but then I would still like to know, when is a symmetric encryption scheme deemed broken?