[Plugin] SHA512
#21

SHA is Secure Hash Algorithm.

It simply hashes your string to something not understandable when read.
Click on the Wikipedia link to know more about this.
Reply
#22

If you have 256 bits or less, can be factored in a few hours with a personal computer using free software. If you have is 512 bits or less, can be factored by several hundreds of computers . A theoretical hardware device named TWIRL and described by Shamir Tromer in 2003 questioned the safety of 1024-bit key. It is currently recommended that no is at least 2048 bits long.
Some experts believe that 1024-bit keys could begin to be weak in a short time with 4096 bit key could be broken in the future.
Reply
#23

Ok, now i know what it means, so good job i'll use it...
Reply
#24

Quote:
Originally Posted by Brian_Furious
Посмотреть сообщение
Ok, now i know what it means, so good job i'll use it...
But is really recomended to use Whirpool.

Because The SHA is a secure digest algorithm developed by NIST. SHA-1 is a corrected version of the algorithm published in 1994. The algorithm is an ANSI standard. The algorithm takes a message of less than 264 bits and generates a summary of 160 bits. Is slower than MD5, but most key length makes it more resistant to attack by brute-force collision and investment.

Now exists SHA512 function works in a message block of 1024 bits and an intermediate hash value of 512 bits. It is essentially a block cipher that encrypts 512-bit intermediate value using the block as a key message.

The sha hash is cracked now, with a C# code Allow the choice of encryption algorithm using a list.
The resistance of SHA-1 algorithm has been compromised during the year 2005

Please upgrade SHA1 to SHA2 (Uses 512 bits).
Reply
#25

Quote:
Originally Posted by MrDeath
Посмотреть сообщение
I can't understand how to unhash a function without bruteforce
You can't, hashing != encrypting, after hashing data in unrecognizable and unreadable
Reply
#26

Quote:
Originally Posted by MrDeath
Посмотреть сообщение
I can't understand how to unhash a function without bruteforce, supposing I've got this 'hash':

pawn Код:
stock
    hash(const string[])
    {
        new
            len,
            pos,
            hashed
            ;

        for (len = strlen(string), pos = 0; pos < len; pos ++)
        {
            hashed += string[pos];
        }

        return 1;
    }
Supposing I hash "ab" (which will give me 195 [98 + 97])
How can you know the password without tryng all combinations?:

X + Y = 195

:\


Sorry if I am doing a stupid question, but I don't understand.
You need to do this with brute force, but this algorithm has very big collisions (the same hash for many strings).
Reply
#27

Quote:
Originally Posted by RyDeR`
Посмотреть сообщение
@ ******:
Agreed - you have a point.

@ Brian_Furious:
It's obvious. Which part don't you understand?

@ MrDeath:
It's not possible (AFAIK) as long you don't save every value of a character to another variable.
You can't just return the characters from a sum of numbers.
Quote:
Originally Posted by ziomal432
Посмотреть сообщение
You need to do this with brute force, but this algorithm has very big collisions (the same hash for many strings).
if the string have 26 caracters with all signs, you have to wait 43 years to find the password with bruteforce.
Reply
#28

Quote:
Originally Posted by RyDeR`
Посмотреть сообщение
@ ******:
Agreed - you have a point.

@ Brian_Furious:
It's obvious. Which part don't you understand?

@ MrDeath:
It's not possible (AFAIK) as long you don't save every value of a character to another variable.
You can't just return the characters from a sum of numbers.
I never will use the 'hash' what I posted, I posted it for give you an example.
I'm using Whirlpool.



Quote:
Originally Posted by DiDok
Посмотреть сообщение
You can't, hashing != encrypting, after hashing data in unrecognizable and unreadable
I didn't know, thanks you.



Quote:
Originally Posted by xenowort
Посмотреть сообщение
if the string have 26 caracters with all signs, you have to wait 43 years to find the password with bruteforce.
a, b, c, d, e ... x, y, z: 26 chars
A, B, C, D, E ... X, Y, Z: 26 chars,
0, 1, 2, 3, 4, 5 ... 9: 10 chars

(26 + 26 + 10) ^ 26 = 99999999999999999 :\
Reply
#29

SHA1 has known attacks against it. This is a bad choice.

Whirlpool on the other hand has no known attacks against it. It is a better choice.
Reply
#30

<Removed>
Reply
#31

Quote:
Originally Posted by FANEX
Посмотреть сообщение
This plugin is revolutionary !!
I suggest everyone to change "whirpool plugin" with this. It's much faster...
How do you now that this plugin is much faster than Whirpool ?
Reply
#32

Quote:
Originally Posted by FANEX
Посмотреть сообщение
This plugin is revolutionary !!
I suggest everyone to change "whirpool plugin" with this. It's much faster...
I'll try this today.
You haven't even tried it and you provided false information?
Reply
#33

Quote:
Originally Posted by Lorenc_
Посмотреть сообщение
You haven't even tried it and you provided false information?
"false information" ? =))
It was my opinion, lol...

Anyway, I don't care about you. ****** is right... I use whirpool plugin too, but I like this more...
Reply
#34

Quote:
Originally Posted by FANEX
Посмотреть сообщение
"false information" ? =))
It was my opinion, lol...

Anyway, I don't care about you. ****** is right... I use whirpool plugin too, but I like this more...
"This plugin is revolutionary !!
I suggest everyone to change "whirpool plugin" with this. It's much faster...
I'll try this today."

Thats not really a opinion, its more of a statement with a false fact inside that 'statement'.
Reply
#35

Aka hash system right? xb
Reply
#36

Quote:
Originally Posted by FireCat
Посмотреть сообщение
Aka hash system right? xb
Exactly.
Reply
#37

Why this plugin crashing my server when i write a password?
Reply
#38

so what this plugin does?
Reply
#39

Quote:
Originally Posted by xkirill
Посмотреть сообщение
so what this plugin does?
1. Read the first post.
2. SHA512
Reply
#40

help i get error about a .dll file

says this is missing MSVCR100D.dll
Reply


Forum Jump:


Users browsing this thread: 1 Guest(s)