Questions tagged [sha-1]

Question 1

I came across some code in 7zip of 2009 that uses srand() to generate random bytes required for ZIP encryption header. like this: ...

Question 2

The Linux kernel /dev/(u)random and getrandom(2) system call all use the same CSPRNG, which was originally based on MD5, then SHA-1, and now ChaCha20 since Linux 4.8. If I use an older version of the ...

Question 3

HMAC-SHA1-96 is performed in AH of IPSec, to have data authentication and integrity. I don't understand why I need to pad message M to a multiple of 160 bit, which is the output length of SHA1. Why is ...

Question 4

The idea is to authenticate the TLS peer by verification of the SHA-1 hash of his public key (aka SKI). So Alice meets Bob in person and they exchange SKIs of their public keys. When later they ...

Question 5

Given a hash cipher f(sha1($pepper . $plaintext)) where f is some transformation to an 11-byte string pepper is 24 bytes long with a character space of 62 (and is ...

Question 6

I have an implementation of PBKDF2, which I know Has two bytes of '=' at the end of the input Has an input length of 24 (which is a Base64 encoded character representation of 16 bytes of entropy) ...

Question 7

In this question on sha1(known_prefix + user_input + backend_secret), an answer states that is realistically possible to find the first few bytes of ...

Question 8

Assuming there is a web service that returns the following to an unauthenticated user: SHA-1(known_prefix + user_input + backend_secret) where ...

Question 9

After tinkering with cryptographic hash functions, I started wondering if they do have counterpart functions that would imitate their cryptographic properties but with a lower level of strength in ...

Question 10

We know that SHA-1 is susceptible to collision attacks, but what about pre-image attacks such as poisoning torrents?

Question 11

I'm going to guess the latter, but just wanted to ask here. I want to have a relatively short signature, and my goal is to take a substring of the resulting hash.

Question 12

Assume I create a hash using SHA-256 and then take only the first 160 bits of the hash, as the result. is the result more cryptographically secured than SHA-1? Or are the two algorithms equally secure ...

Question 13

Not sure about the security implications of making HMAC SHA1 message and corresponding hash public (secret would remain… secret)? Evaluating if that would help an attacker crack algorithm.

Question 14

Contemplating using YubiKey’s challenge-response feature to hash public passphrases. By public, I mean an attacker could potentially exfiltrate passphrases but, not having YubiKey*, passphrases would ...

Question 15

As some password manager, such as KeyPassXC allows a user to create a master password using a HMAC response from a YubiKey concatenated with a password entered by user, I was wondering something. ...

Stack Exchange Network

Questions tagged [sha-1]

Is PRNG really not secure even when combined with SHA1?

With SHA-1 broken, can the old Linux /dev/(u)random algorithm be trusted?

Why does HMAC-SHA1-96 need to pad message to a multiple of 160 bits?

SKI-based authentication

Is a reduced character space pre-image attack possible for SHA-1?

Does having a known suffix on the input to PBKDF2 make you more vulnerable?

On the exposition of SHA-1 attack (known_prefix + user_input + backend_secret)

Extracting a secret from a SHA-1 hashing algorithm

Are there "light" versions of cryptographic hash functions?

How secure is SHA-1 against preimage attacks currently?

What is more secure, HMAC with SHA-1, or with SHA-256 and take a substring?

Is sha-256 better then sha-1 in aspects othen then the hash size?

Is it insecure to make HMAC SHA1 message and corresponding hash public?

Is HMAC SHA1 algorithm secure in 2022? [duplicate]

Is it possible to bruteforce a 200 bit hash generated with PBKDF2, in which the first 160 bit are known?

Hot Network Questions