Questions tagged [sha-512]

SHA-512 is part of the SHA-2 family of hash functions with a 512-bit output and a 256-bit security level.

Filter by
Sorted by
Tagged with
1 vote
2 answers
127 views

SHA-512 for ECDH key derivation

I'm currently working in a constrained environment and need to derive a symmetric key (that will be used for AES-256 in GCM mode later) based on a low-entropy shared secret obtained via X25519. To ...
alexck's user avatar
  • 13
3 votes
1 answer
181 views

Entropy extraction from a Zener diode TRNG

My project is to build a true random number generator that relies on the avalanche effect in a Zener diode. This for a messaging device that uses one-time-pad encryption. Reading about similar ...
Björn Morén's user avatar
2 votes
2 answers
684 views

How secure is the password from the hash sum (SHA-512) of a long sentence

If I convert a long sentence (>50 characters) to c and use the result (128 hex characters) as a password, how secure is it?
NewLinux's user avatar
  • 121
1 vote
0 answers
109 views

Is it better to use PBKDF2 with SHA-512 and 1e6 iterations or SHA-256 and 6e6 iterations?

I'm implementing encryption in my browser extension that will allow users to encrypt their data and then share them with others. And since shared links can be leaked, I want to protect the data as ...
icl7126's user avatar
  • 111
1 vote
0 answers
51 views

What are some ways to produce a pre-determined sequence of a large number of dice rolls? [closed]

What are some ways to produce a pre-determined sequence of a large number of dice rolls (on the order of 100-1000 times) using biased dice or a biased human roller given the constraints that multiple ...
TheReal_Skywalker's user avatar
2 votes
1 answer
845 views

When using AES-256 in combination with HMAC-SHA, should we use SHA-256 or SHA-512?

When using AES-256 (cipher mode CBC and padding mode PKCS7) in combination with HMAC-SHA for authenticated encryption (assuming alternatives like TLS and AES-GCM cannot be used), should we use SHA-...
SeekingAnswers's user avatar
4 votes
2 answers
548 views

Does combining multiple PBKDF2 keys result higher iteration count when using same password but different salts?

I did some experimenting with web subtle crypto. I derived a key using PBKDF2 with SHA-512 and 100 000 iterations and timed it. Doing same with 200 000 rounds doubled the time as expected. Then I did ...
Puruporo's user avatar
1 vote
1 answer
337 views

HKDF-Expand max output length

I'm trying to use HKDF-Expand to derive lots of keying material (> 64GB) from a pseudo-random 512 bit key. Now according to the HKDF RFC, the maximum amount of ...
Jon James's user avatar
2 votes
1 answer
288 views

Create a control hash string from different sources, is there a difference, advantage or disadvantage in comparison when using this ways?

I wanna create from several inputs/sources should be formed into one hash value for controlling of different thinks later. Example: String + File String + String File + File String + File + String ...
Z0OM's user avatar
  • 155
-1 votes
1 answer
131 views

Is partial digest recognition possible?

TL;DR Does hashing a private key, then XOR[ing] the digest (twice recursively, with offset) on the secret have any glaring issues? Is partial digest recognition possible? Description User provides a ...
Asleepace's user avatar
  • 101
1 vote
1 answer
153 views

Approximate size of image of SHA512

Let $s: \{0,1\}^* \to \{0,1\}^{512}$ be the SHA512 hash (where $\{0,1\}^*$ is the countable set of all finite $\{0,1\}$ strings. Is it known whether $|\text{im}(s)|/2^{512} \geq 0.5$? If yes, what is ...
Dominic van der Zypen's user avatar
2 votes
1 answer
83 views

Finite fiber of SHA512

Let $\{0,1\}^*$ be the set of finite $\{0,1\}$-strings. Then SHA512 can be viewed as a map $s: \{0,1\}^*\to \{0,1\}^{512}$. The pidgeonhole principle implies that there is $y\in \{0,1\}^{512}$ such ...
Dominic van der Zypen's user avatar
1 vote
1 answer
169 views

Understanding intermediate values - SHA2 - 512

I am trying to understand SHA2 - 512 algorithm, so I am following this document which has the intermediate values for the string "abc". At t=0, the values ...
Josh's user avatar
  • 135
1 vote
1 answer
885 views

Step-by-step working out with example input for NIST Hash Functions like SHA-1,SHA-2, and SHA-3

I am working on doing a naive Python implementation of SHA-1,SHA-2, and SHA-3 and I need to test and debug because the hash result right now is not correct. I have found a step-by-step working out of ...
arunkumaraqm's user avatar
1 vote
1 answer
355 views

HMAC key generation and encoding

I've this piece of .NET code that is based on a Microsoft sample on how to generate a key and sign using HMACSH256. But I've altered the key generation a little bit and also decided to use Base64 to ...
danutz_plusplus's user avatar
0 votes
0 answers
87 views

PBKDF2 Rounds Implementation Question?

Currently I am working on a implementation of PBKDF2 for an embedded microcontroller. My question is that my psuedo-random function is fixed (SHA-512 HMAC) how do perform 'rounds' of encryption? I am ...
Russeree's user avatar
7 votes
2 answers
2k views

SHA-512 - How difficult is it to find a hash digest beginning with at least twelve zeros?

I know it's possible to find a hash value with multiple zeroes in it, I know of some BitCoin hashes with it, but how difficult is it to find/create a hash digest with 12 or more leading hex zeroes in ...
sha512guest's user avatar
1 vote
1 answer
499 views

Known text attack on Hash function (SHA 256 or SHA512)

I was thinking the below attack scenario on hash function. Let's assume that three binary numbers A(1000 bits), B(16 bits) and C(283 bits) are concatenated together and H(A||B||C) is generated using ...
Sami's user avatar
  • 37
0 votes
1 answer
848 views

AES Password Based Key Derivation Iterations

I have been writing my own implementation of the Advanced Encryption Standard with cipher block chaining in python3 for the last several months, mimicking the OpenSSL command line interface. I can ...
B345T's user avatar
  • 1
0 votes
0 answers
1k views

Bitcoin Key Recovery Without Nonce Re-Use

There are a lot of questions in these forums regarding the recovery of private keys. But I'm here to postulate on something unique to a specific piece of research that I looked into recently. The ...
librehash's user avatar
  • 145
2 votes
1 answer
271 views

Could a symmetric encrypted communication with a SHA-512 hash still be manipulated?

I just got back from an exam review and there was a question I remembered that I apparently got wrong. I wonder if someone could help me with this, since it bothers me. The question was something like ...
user2762996's user avatar
1 vote
3 answers
1k views

Why is SHA256/SHA512 not broken for shortish passwords

I don't get why SHA-256/SHA-512 hasn't been broken, at least for shortish (10-12 character) passwords It is perfectly plausible to pre-compute a password/hash-pair table using numerous very fast ...
MrJoe's user avatar
  • 111
-1 votes
1 answer
3k views

Salt length in SHA-512 version of Unix crypt command

SHA-512 crypt specs reports that SHA-512 crypt uses 128bit salt. The FreeBSD/Linux password generation code builds the salt using 16 bytes random data (128bits) and then it translates the random data ...
JohnP's user avatar
  • 3
0 votes
1 answer
114 views

Is it secure to repeatedly rehash a digest to extend the digest length?

Upon reading through the source code of Rainbow, a post-quantum signature algorithm, I found a hashing function that, using SHA-512, produced a variable length digest. This was achieved was by ...
Albert Weatherby's user avatar
0 votes
0 answers
41 views

What security vulnerabilities exists when encrypting then hashing to be able to search values in database?

im trying to find a good way to allow searches against encrypted data in the database. Lets say i want to encrypt phone numbers, if its encrypted securely i cant search against phone numbers directly ...
Meydan Ozeri's user avatar
1 vote
1 answer
109 views

SHA3-512 similar message digest

How is it possible to find a similar message-digest for SHA3-512 for the first 80 bits or so? There was a Q/A on this site where the answer stated that 80 bits that $2^{42}$ computations are required. ...
Tejas Bhuwania's user avatar
-1 votes
1 answer
191 views

Are there any crypto hash implementation beyond 512 bits of output?

My question is this: Are there any crypto hash implementations beyond 512 bits of output? Could you give me the link? Thank you so much for your time. Greetings.
Jorge Alberto Medina Rosas's user avatar
0 votes
0 answers
67 views

What can be deduced/extracted from this local hash extracted from Windows Machine?

I'm new to cryptography. I've been experimenting with getting Windows hashes to see whether it's possible to reverse engineer. The following hash is what I got from my test laptop. What can you ...
betkorvalic's user avatar
7 votes
2 answers
3k views

Why SHA-512/256 when we already have SHA-384?

Both of them are just SHA-512 with different IV's and truncation. What's the point of having 2 of them? (Actually we have 3 of them as SHA-512/224 is the exact same thing.)
hanshenrik's user avatar
1 vote
1 answer
2k views

Is it possible to find the key of an HMAC-SHA-512 given the input and the hash output?

Is it possible to find the key of an HMAC-SHA-512 given the input and the hash output? If so, what algorithm if any prevents this? I'm working on a simple E2E communication system between two self-...
Wasabi Thumbs's user avatar
1 vote
1 answer
102 views

Is it possible to affect the output of HMAC w/ SHA-512 by providing it with a custom message?

Consider an HMAC algorithm that uses SHA-512 with an unknown private key. Is it possible to affect its output, either partially or totally, by providing it with carefully crafted messages? For the ...
Alex Papageorgiou's user avatar
0 votes
0 answers
224 views

Combining Hashes - NTLM and SHA

i have been recently learning about different types of hashing and the encryption/decryption methods of such hashes. Im currently trying to find the preimage of this hash i have been given as a ...
BarTM's user avatar
  • 1
1 vote
1 answer
267 views

Can I find a specific SHA512 for an partially-known string?

I have a plain text string "I-like-drawwing", and this string has a SHA512 value, assume the SHA512 is "aabbcc". Then I show SHA512 "aabbcc" to my friend and say: "this is SHA512 for my string, and ...
Hu Bin's user avatar
  • 121
0 votes
1 answer
87 views

SHA-512 Encipherment via CBC

I wrote a cryptographic function that encrypts a plaintext by using a series of SHA-512 hashes that are used to encrypt the data via a simple byte-to-byte XOR. In order to prevent various attacks, I ...
Desthro's user avatar
  • 124
3 votes
2 answers
4k views

521-bit ECC keys are the same strength as RSA 15,360-bit keys

521 bit ECC uses key sizes 7.5 times smaller than the RSA standard while offering encryption that is magnitudes more secure. An RSA 2048-bit key's secure enough for banking, but a 521-bit ECC key is ...
djuture's user avatar
  • 31
1 vote
2 answers
3k views

Sha-512 understanding padding problem

I don't understand how to append the length of 128 bits exactly? First, we pad bits to make the length ($n*1024-128$) but then I need to append 128 bit of the plain text length. I find the problem to ...
fahad's user avatar
  • 27
0 votes
1 answer
174 views

How safe is my method

I'm building a website. I have an API which takes 2 parameters: delete_user(user_id, hash). And there is method to evaluate hash using SHA512: ...
icetroid's user avatar
0 votes
1 answer
2k views

What is the probability of a collision in SHA-512 when the input is 512 bits of data

Although this question is strongly related to my previous question, it's certainly not the same: Suppose the input of SHA-512 is 512 bits of data (so exactly the same size as the output). If I would ...
Garo's user avatar
  • 123
1 vote
2 answers
2k views

Are there parts of a SHA-512 hash that occur more often then others?

Suppose I have a 'begin' password that I can remember. I calculate it's SHA-512 hash, transform it to base-64 and check if it has a least 1 lowercase, 1 number, 1 capital, and 1 sign. If this is not ...
Garo's user avatar
  • 123
3 votes
2 answers
1k views

PBKDF2 with SHA-256/512 for low entropy input?

Is there any reason to use something stronger than SHA-1 with PBKDF2 if my input is fairly low entropy? I.e. if the passwords being hashed are only about 30-bits of entropy. I can't find it now, ...
AaronLS's user avatar
  • 133
6 votes
2 answers
4k views

Why might SHA-384 throughput be lower than SHA-512 throughput in hashcat and more secure?

I found a hashcat benchmark results in the internet: hashcat results: SHA-384 is 17065.4 MH/s SHA-512 is 17280.3 MH/s Why does SHA-512 take less time? SHA-512 is longer and I thought it therefore ...
sluge's user avatar
  • 197
1 vote
1 answer
722 views

enhanced hash password in bcrypt for nuGet library

Why do we use EnhancedHashPassword in nuGet library and chose a SHA algorithm like this? ...
Juliet's user avatar
  • 29
2 votes
1 answer
308 views

How to compute initial buffer of SHA-512?

I'm reading Cryptography And Network Security of William Stallings. In the SHA-512 section it is said that there is a 512-bit buffer is used to hold the intermediate and final result and every 64-bit ...
naweed's user avatar
  • 23
0 votes
1 answer
383 views

Finding and matching SHA512 Unsalted Hash

We are given a list of possible strings, there are $32^{16}$ ($=2^{80}$) to be exact. We also have the unsalted SHA512 of the original target string. How long would it take to go through those ...
HTHazard's user avatar
4 votes
1 answer
269 views

What is SHA-512's input space, taking into account variable message size?

The SHA-512 hash function accepts any message from a single bit to $2^{128}$ bits. Because the function takes into account the message length, I can't just represent every message as a $2^{128}$-bit ...
forest's user avatar
  • 15.2k
3 votes
2 answers
281 views

What is the proof that a hash output contains random binary numbers

I have heard quotes by many that a SHA-512 hash output is random. Does anyone know what method was used to come to this conclusion? If it is not randomized, how could that be shown?
Jon Hutton's user avatar
2 votes
3 answers
8k views

19 out of 24 words of BIP39 passphrase (brute-force last 5?)

I have managed to lose 5 words of my 24 word Ledger Nano S recovery phrase. I have words 1-19 but I am missing words 20-24. I have significant holdings on the wallet so would very much like to recover ...
JGoodwin10's user avatar
1 vote
2 answers
796 views

Hash collisions in sha512 hash of secp256k1 public keys

For a sha512 hash of a secp256k1 public key, how many other public keys could generate that hash? I would assume zero since the key size is equal to the hash length (secp256k1 public keys are 64 bytes,...
phi's user avatar
  • 15
0 votes
1 answer
272 views

Is there any Corelation between the SHA256 and SHA512 hash of the same data?

Is there any Corelation between the SHA256 and SHA512 hash of the same data ?
vasu's user avatar
  • 1
1 vote
1 answer
1k views

Which is more secure for hashing: SHA512 or BCrypt with the same salt reused over and over?

Setting aside questions of if BCrypt should even be used in this way, I was just wondering which one would be more secure hypothetically. If you want to know why I don't just use random salts as per ...
Adam's user avatar
  • 111