Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 12407

A hash algorithm is a function which takes a variable size input and produces a fixed size output. The algorithm tries to make it difficult to predict the output for a given input, find two inputs with the same output, or reconstruct the input from the output.

1 vote

How to identify hashes

They output bytes, and a good hash function should appear to generate all of its output bytes at random. … But any data can be encoded this way, and there is no way to distinguish the output of a hash. …
Stephen Touset's user avatar
0 votes

Need references about why public access to a password hash and salt is poor practice

Modern password crackers have extremely sophisticated engines that can take a base word like "password" and hash every plausible permutation of it ("p4$$wOrd!" … Algorithms like scrypt go even farther, requiring a configurable amount of memory in order to generate the hash. …
Stephen Touset's user avatar
4 votes
Accepted

"Remember me" cookies - did I implement them securely?

Send them this string, then hash it (SHA-2/256 is fine), and store the hash alongside the user record. … When a user explicitly logs out, delete the cookie from the browser and delete the hash of the token from the database. …
Stephen Touset's user avatar
0 votes
Accepted

Seeding GPG keygen with a hashed secret

Digested passwords only have as much entropy as was in the password passed to the hashing function. GPG uses cryptographic sources of random numbers to generate the private key, and encrypts it with a …
Stephen Touset's user avatar
2 votes

Is there value in storing passwords in their own table with encrypted or hashed keys?

So, really, the solution is simply to responsibly hash your passwords in the first place. …
Stephen Touset's user avatar
0 votes

Why is password strength often underestimated and uncertain in the context of password hashing?

Long story short, you have complete control over how you hash passwords. But beyond a very limited point, you don't have control over how strong your users' passwords will be. …
Stephen Touset's user avatar
11 votes
Accepted

What happened to MD6?

The short answer is that MD5 is widely discussed because it's had widespread historical use, and MD6 isn't because it's relatively unused and has faded into obscurity due to a multitude of better of a …
Stephen Touset's user avatar
4 votes
Accepted

What is the "cost" of hashing?

As this number grows, the amount of work (typically CPU time or memory) necessary to compute the hash increases exponentially. … A typical cost factor might increase the number of operations necessary to compute a password hash by a factor of 100,000 or more. …
Stephen Touset's user avatar
9 votes

Why improvising your own Hash function out of existing hash functions is so bad

In the best case scenario, you've likely merely reduced the difficulty of cracking the password to that of the weakest hash, rather than actually improving security. …
Stephen Touset's user avatar
4 votes

comparing password hashing algorithms - PoC ideas?

Take a list of 1,000 passwords: some trivial (password, cat), some pattern-based (mY$p455w0rd), some random (s%Xn3,0a9aN), and hash them three different ways: MD5 with salt, SHA-256 with salt, and bcrypt …
Stephen Touset's user avatar
6 votes
Accepted

Is there any reason for using private key 2 times when creating security hash?

The gist of the attack is that an attacker who knows H(s || m) and m for a hash H, secret s, and message m can trivially forge a hash of the form H(s || m || p || a) where p is the internal padding used … by the hash function and a is an attacker-controlled string. …
Stephen Touset's user avatar
3 votes

create a variants of MD5

You should not be implementing your own cryptography. Use an existing cryptographically secure random number generator. MD5 is not a random number generator. Not only will it (nor any variant you are …
Stephen Touset's user avatar
2 votes

create a variants of MD5

Hashes are not random number generators. You are inventing your own crypto. Do not invent your own crypto. Worst, say you modify MD5. Now you have n = MD5'(x). You still need a random x in order to …
Stephen Touset's user avatar
7 votes

Client side password hashing

It seems like you're trying to invent your own cryptographic protocol. From the description of your approach, it does not seem like you have the background to do this in a secure manner. I highly reco …
Stephen Touset's user avatar
6 votes

At what point does adding more iterations to PBKDF2 provide no extra security?

From Colin Percival's paper on scrypt: By using a key derivation function which requires 2^s cryptographic operations to compute, the cost of performing a brute-force attack against passwords with …
Stephen Touset's user avatar

15 30 50 per page