Search Results
| 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 sha
Search options answers only
not deleted
user 414
Secure Hash Algorithm is a family of cryptographic hash functions published by NIST. This includes SHA-1, and the SHA-2 and SHA-3 families of functions. SHA-1 is deprecated for all usages.
3
votes
Password generation - too primitive?
Tom Leek's answer is an excellent review of your password diversification scheme, so I won't attempt to repeat what he wrote in my own inferior words. In this answer I'll focus on a comparison with un …
15
votes
Is it possible to get the encryption key when you have the plaintext?
Or you might have meant HMAC-SHA-256. An HMAC is a message authentication code, which is different from a digest algorithm. … If you know some message (plaintext) M and you also know HMAC-SHA-256(M, K), then here too you are no closer to knowing the key K. …
13
votes
What are SHA-rounds?
One common way of constructing a slow hash is to take an ordinary cryptographic hash function such as SHA-256 or SHA-512 and to run it many times: basically SHA-256(SHA-256(…(SHA-256(salt + password))) … SHAcrypt uses the standard hash function (SHA-256 or SHA-512) as a black box, and calls it multiple times. …
2
votes
Accepted
Are GNU coreutils SHA digest functions FIPS-validated (in NIST's Cryptographic Module Valida...
I did find that Red Hat holds a certification for an OpenSSL implementation, which also lists SHA-3 and SHS certificates, Cert #3781, but that's for RHEL8 and we're on RHEL7. … Barring alternatives, is there a way to prove GNU coreutils's SHA-2 implementations are "sufficiently secure"? I feel that question is asking for trouble and a whole lot of math proofs... …
37
votes
SHA & MD5 Collisions for shorter strings
MD5 and SHA-1 are insecure because it is possible in practice to find collisions.
SHA-512 and the other SHA2 variants (SHA-256, SHA-384, etc.) have collisions. … SHA2 is as insecure as MD5 and SHA-1 for password hashing: password hashing must be slow and salted. …
2
votes
Disguising the type of hash used
But if you're completely stuck, and all you have is SHA-1, look for an implementation of PBKDF2 on top of this SHA-1 primitive. …