This thread probably fits here

I’m trying to get my head around the whole encryption thing, but for starters:

Ok. Let’s say i have a 32bit key. This means the following

[00000000000000000000000000000000] → this is one container (combination) of 32 bits (0/1).

.

.

*2,1 billion and something of such combinations*

.

.

.

[11111111111111111111111111111111] → the final one

My key would therefore have 2,1 billion containers of different combinations. A computer would thus have to go trough all the billion combinations in different arrangements while searching for the key. Right?

So let’s say my key is just *ABC*

[01011000000000000000000000000000] → let’s say this is the encoding for A

[11000101000000000000000000000000] → B

[01100001000000000000000000000000] → C

[00000000000000000000000000000000] → *0*

[00000000000000000000000000000000] → *0*

[00000000000000000000000000000000] → *0*

.

.

.

.

[00000000000000000000000000000000] → *0*

So if the computer decided to just randomly check each combination…the would need to go trough all of them despite most of them being just 0? Do codebreaking computers have algorithms to first check if the password contains human usable symbols? Ant then just random combinations?

Am i even getting at this correctly?

tnx