Questions tagged [password-hashing]

Irreversibly converting user-selected passwords into authentication tokens that can be safely stored e.g. in a user database. Typically done with a salted password-based key derivation function (PBKDF), ideally with a memory-hard mixing stage to thwart brute-force attacks using parallel hardware.

Filter by
Sorted by
Tagged with
1
vote
1answer
253 views

securing the keystore

When generating a public-private key pair you have the option to secure the keystore with a password. where is that password stored, is it a hashed version that is stored and if that is so which ...
9
votes
3answers
1k views

Cryptocurrency serving as hash breaking?

There are many people mining for Bitcoin right this second.[Citation needed] Bitcoin's proof-of-work mining system is based on a hash function (SHA-256, I believe), and there are ASICs built ...
0
votes
2answers
243 views

What is the probability of the first half of a hash output being identical to the first half of another hash output?

Let's say for example that I encrypt a password with some hash function and receive a 256-bit hash value in return. What are the chances that the first 128-bits (half) of this value are identical to ...
0
votes
1answer
743 views

Hash algorithm for converting n-bit number into another n-bit number

So I'm new to this area of Stack Exchange, and to cryptography in general, but I just wanted to ask this question here to see if I could get any advice. I don't understand a lot of the technical ...
-2
votes
2answers
322 views

Very simple, very memory-hard (?) password-based key derivation

I know the problem of memory-hard password-based key derivation functions is better left to the likes of scrypt, argon2, etc... But validated implementations of those algorithims are not always ...
5
votes
1answer
4k views

Pre-image attack on MD5 hash

I read somewhere MD5 is broken in terms of collision, but I am wondering if it is broken in terms of pre-image resistance? Given a hash of Md5, is it possible to find the original message of it? If ...
1
vote
1answer
2k views

Storing passphrase and encrypted private key

I have to protect a key pair with a passphrase and to store these information someway in a table. I read that I can protect the key pair (specifically, the private one) using a digest of the ...
2
votes
1answer
617 views

anything obviously wrong with my custom password hash scheme?

i sha2-256 hash the password, then i base64 encode the hash (per RFC 2045) , resulting in a 44 bytes string looking like LPJNul+wow4m6DsqxbninhsWHlwfp0JecwQzYpOLmCQ=...
13
votes
3answers
939 views

Is it better to maximize memory usage or number of passes with Argon2i 1.3?

I wrote a small application that uses Argon2i for deriving symmetric keys for encryption of local files and secret Curve25519 keys. Argon2i v1.3 is susceptible to TMTO attacks if the number of passes ...
5
votes
2answers
2k views

Is the SHA1 hash of MD5 hash of a password secure?

Cryptography is not my area, so pardon me if the question is annoying. Some time ago, I implemented an Internet site, which database had a users table. To keep the password in its user table field, I ...
24
votes
2answers
5k views

Does the Balloon hashing paper deprecate Argon2?

Does the recent Balloon hashing paper and the included attack on Argon2 effectively negate the result of the Password Hashing Competition? On one hand it seems that only a constant-factor improvement ...
2
votes
2answers
2k views

Why do two Argon hashes with the same password differ?

Can someone explain to me what the ArgonHashString function in libsodium returns (i'm using the .net port). For example i called it twice with the same string: ...
3
votes
1answer
186 views

Does AugPake not require key stretching?

I was reading the AugPAKE rfc and noticed that there is no mention of key stretching anywhere. The protocol does mention use of a hash function, and the hash function that is provided as an example is ...
-1
votes
2answers
2k views

what is the procedure to make my own hash encryption? [closed]

I am posting this question here for the procedures(If any) of making my own password hashing technique. Because bad encryption makes the severe damages as far I learned
-1
votes
2answers
106 views

What if I make the hashing with an own function ? Does it make unhackable?

I am thinking to create own hashing Instead of creating encryption(weak). That hash function has some number of cryptic parameters to go before it stores in db? Does it become unhackable if I do so?
3
votes
1answer
182 views

Security implications of repeated hashing

I have an hash function hash() I can easily compute the hash of the string "hello" like this: out = hash("hello"); What are ...
7
votes
1answer
343 views

Are coprocessors (Intel Phi) a threat for modern key stretching functions?

Modern key stretching functions (password-based key derivation functions, also used for password hashing) are memory-hard to mitigate parallel attacks, and as far as I know this is working well. Last ...
4
votes
1answer
4k views

RAR brute force cracking speed

I have been playing around with cRARk and was astonished by the low speed. On a 2015 high-end GPU (GeForce 980 ti), it took roughly 4h 50min to test all passwords composed of an 8-character prefix and ...
3
votes
1answer
682 views

Why do different applications of hash functions demand different properties of the hash function?

A strong cryptographic hash function in general must guarantee several properties, including: Preimage resistance, second preimage resistance and collision resistance. It turns out, however, that ...
1
vote
2answers
978 views

Can a hash have more than one input?

From a definition stand point, can a hashing algorithm have more than one input, ex: $H(m_1, m_2, m_3)$? If not why are algorithms like bcrypt, scrypt and pbkdf2 referred to as password hashing ...
3
votes
1answer
433 views

Rotating password with PBKDF2

Crypto is hard. Thank you for helping me learn. My encryption scheme currently looks like this: Salt is stored out in the open Secret is the user's password, known only to them EncKey||AuthKey = ...
1
vote
0answers
61 views

Password manager that uses a mix of long and short key derivation functions

I was reading "A Convenient Method for Securely Managing Passwords, Halderman et al., 2005". In short, the authors say to do the following: ...
2
votes
1answer
311 views

Salting Hash stored on RFID tag?

In my application, I am trying to prevent counterfeit widgets from being used on our gadgets; think HP ink-cartridges. I will be doing such with UHF RFID tags embedded in the widgets. Unfortunately, ...
6
votes
2answers
407 views

Are there any high level memory-hard PBKDF constructions?

The PBKDF2 construction from PKCS #5 v2 has the convenient feature that it can be implemented using only standard interchangeable cryptographic primitives. Specifically, it only requires the ...
21
votes
3answers
12k views

What is the recommended number of iterations for Argon2?

I've recompiled my operating system ("LionBSD" based on FreeBSD) to use Argon2i as the default password hashing algorithm in crypt/libcrypt. I'm wondering what the recommended number of iterations ...
0
votes
6answers
4k views

Can you use a hash as a password?

There are several methods of making a strong password, making it longer is one of them. now we also have hashing algorithms which have outputs of 512, so i wonder, would it be safe to basiclly use a ...
13
votes
3answers
2k views

Password entropy much lower than entropy of encryption keys. Why is this acceptable?

When talking symmetric encryption, a 56 bit key is known to be so weak. If you use it for your encryption, you are considered a goner. When talking passwords however, the standard these days is ...
5
votes
1answer
2k views

Do I need to use a CSPRNG when creating salts for user accounts?

I'm not sure about the need of using CSPRNG to create salts for each user account. I found “Cryptographically Secure Pseudo-Random Number Generator in Qt/C++ (Cross platform)” (at StackOverflow) with ...
11
votes
1answer
1k views

Does a big salt have the same memory effects as Bcrypt?

Citing Thomas Pornin on the question Why can't one implement bcrypt in Cuda?: bcrypt is a variant of the Blowfish key scheduling, which is defined over a table (a few kilobytes) which is constantly ...
1
vote
3answers
291 views

How to generate many passwords from one passphrase, so that knowledge of one password does not compromise the others?

The limitations are: it should be a function. passphrase is so weak, that if hash of it is known (or big part of hash), then it can be brute forced. I want to get N passwords from one passphrase. ...
10
votes
1answer
12k views

Why do we use hex output for hash functions?

Why do we use hex representation as default for the output of a hash functions result? For example the sha256 hash function: the output of sha256 in hex representation uses 64 characters, while ...
-1
votes
1answer
282 views

Reducing the probability that a password will be guessed

In a file users' password hashes are stored. There are 2 approaches to reduce the probability that the password is guessed. Increase the size of the salt from 12 bits to 24 bits. Increase the length ...
1
vote
1answer
125 views

What is the starting point of Hellman's TMTO method?

I understand what is happening and how the endpoint is computed but I'm still a bit unsure of where "SP" (Staring Point) came from. Are the starting points, randomly selected keys from the key-space n?...
1
vote
1answer
259 views

Is there a password hash function with a human component?

Sort of Related: Is there a cryptographic hash function that can be performed with pencil and paper? One problem with hashing passwords is that the attacker has more of everything it seems. More ...
4
votes
0answers
509 views

Password hashing in embedded systems

Are there good options for password hashing in embedded systems? These systems often cannot afford slow hash functions. I can think of a few approaches: Store the (hashed) passwords in a HSM that ...
0
votes
1answer
218 views

Negative lookup table concept

Interested in password cracking, I thought of a concept for lookup tables that can tell if a hash can be created using a dictionary in about O(log n) time. A simple overview of the idea is a follows: ...
20
votes
3answers
5k views

Should you change salt when changing password?

Assume a password storage scheme using a computationally-expensive hash algorithm and a CSPRNG salt. User ID, salt, and hash value are stored in a table; if the table is compromised, all three ...
4
votes
1answer
5k views

Traditional DES scheme in Unix crypt function

In a security context course, we need to reproduce the old DES hashing scheme in the crypt program, on an old unix system. I am actually reading the crypt page on wikipedia: The traditional ...

1 2 3
4