ASIC chips brute forcing

[eliaou]

Entropy ? (again sorry for the noobness )


Do you mean that by definition a password  becomes more complex and has many layers of change til it becomes a hash ?  and by collision do you mean that there can be a recognizable pattern how the entropy develops , and by that the computer arrives at a conclusion as to what the original password or the prime number was ?


(by the way i love this forum lots of smart peoples here , its refreshing to see that it still exists in the internet  )

[ande]

Entropy - The measure of randomness in a hash (In this case anyway)(Someone correct me if i'm wrong).

Basically you want a hash function to have a completely different output even if the input is only changed a tiny tiny tiny bit. So that hash of aaaaa is not even CLOSE or similar of hash of aaaab.

Collisions is when you have two different inputs that produce the same output in a hash function. There is no such thing as a hash without a collision, this is because a hash is of fixed length. However, the entropy of a hash determines "how often" a collision will occur or "how good" an hashing algorithm is.


(Someone please correct me if I am mistaken above, its getting rather late over here)

[eliaou]

Thanks for the info ande .

I got alot more questions but I think I can continue this one on google

+1 cookie

[Stackprotector]

One of the main reasons CPU mining is slow (rather than saying gpu mining is fast) is because CPU implements a lot of security features and has more features who come in handy in running an operation system and securing it. The GPU is more based on raw calculations wich makes it faster.

[eliaou]

Security in the CPU itself ?


Do you mean that it has security in the gate transistors or/and in the logic circuit ?

[Stackprotector]

Security in the CPU itself ?


Do you mean that it has security in the gate transistors or/and in the logic circuit ?

Yhea a CPU has rings and modes http://en.wikipedia.org/wiki/Ring_(computer_security). Also a CPU has virtual memory and more features wich are required to run a OS but not required to do raw operations.

[lucid]

Entropy - The measure of randomness in a hash (In this case anyway)(Someone correct me if i'm wrong).

Basically you want a hash function to have a completely different output even if the input is only changed a tiny tiny tiny bit. So that hash of aaaaa is not even CLOSE or similar of hash of aaaab.

Collisions is when you have two different inputs that produce the same output in a hash function. There is no such thing as a hash without a collision, this is because a hash is of fixed length. However, the entropy of a hash determines "how often" a collision will occur or "how good" an hashing algorithm is.


(Someone please correct me if I am mistaken above, its getting rather late over here)

Nah you're not wrong. This is part of the reason why an algo is only so good for so long. People used to think it would take a Cray supercomputer years to crack DES.