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

learn more… | top users | synonyms (2)

-4
votes
2answers
50 views

Decrypting SHA-256 with SHA-256 as input?

Is there a way to somewhat decrypt a SHA-256 hash, provided that the initial string was also a SHA-256 hash? If not, could anyone link me to a rainbow table containing some of the $16^{64}$ possible ...
5
votes
2answers
118 views

What is the threat to a PKI when the root CA certificate is generated using SHA1?

We have thousands of servers that have been issued certificates signed by our CA using SHA256 but the our root CAs own certificate was generated using SHA1. Assuming SHA1 is no longer secure for our ...
1
vote
1answer
36 views

Store hashed password using Digest authentication

Digest Authentication is something like this: Server sends client a nonce. Client hashes username and password with nonce. Client sends hashed value back to server. Server validates hash. However, ...
4
votes
1answer
76 views

Can a list of hashes with property $X_{n+1} = \operatorname{SHA-256}(X_n)$ loop?

This is the situation: I have a list of hashes where each hash is always the SHA-256 of the one above it. If I keep going down the list it must at some point loop since there can only be $16^{64}$ ...
-1
votes
1answer
29 views

3 digit code at the end of a changing magstripe (maybe hash?) [closed]

Myself and some fellow students are doing some "Independent Security Research" on campus and trying to crack the campus paid parking system to better understand how it might work. The system works ...
1
vote
1answer
67 views

Hash + Salt v. Hash + Encryption

I was wondering if using a salt with a hash is more effective than hashing and encrypting your hash.
-3
votes
1answer
157 views

Is it secure to send the hash along the message without encryption?

Lets suppose Alice send to Bob a message $M$ along with its hash value say $H$ which is calculated using SHA3 algorithm. It is sent on the network where it got read by Eve and she does not make any ...
3
votes
1answer
107 views

Differential Cryptanalysis for Hash functions

How is differential cryptanalysis used to attack hash functions? I've been struggling through a couple academic papers and thesis's on the subject but they all sound like greek to me. Does anyone know ...
0
votes
0answers
103 views

Implementing hmac+bcrypt in bash script

I was recently reading Mozilla's Secure Coding guidelines and found their password storage method interesting. They combine an hmac hash of the password with bcrypt which allows for added security ...
7
votes
1answer
59 views

Difficulty to find any preimages $a$ and $b$ for given $V$ so that $H(a) \oplus H(b) = V$?

Suppose I have the values $a$, $b$, and $V = H(a) \oplus H(b)$ with inputs $a \neq b$ and $H$ being SHA-224. None of these values are a secret. How secure is it to assume that no other possible values ...
23
votes
4answers
3k views

Are checksums essentially non-secure versions of cryptographic hashes?

Are checksums basically toned-down versions of cryptographic hashes? As in: they are supposed to detect errors that occur naturally/randomly as opposed to being designed to prevent a knowledgeable ...
1
vote
2answers
131 views

PHP AES 256 CBC faster than AES 128 CBC? Or am I doing something wrong?

for last couple of days I'm learning a bit about encrypting data in PHP, as I need a good encryption/decryption function for storing user's passwords in DB. I use ...
3
votes
2answers
67 views

Misuse-resistant authenticated encryption based on SHA-3/Blake2b and AES-CTR/ChaCha20

I am wondering if the following is a useful misuse-resistant authenticated encryption scheme: Parameters (shared by many users): Choose a hash function $H$, such as Blake2 or Keccak. SHA2 could ...
0
votes
1answer
48 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: ...
1
vote
1answer
33 views

Create a potential input for sha-256 hash given a substring of input?

Let's say I'm given a specific SHA-256 hash. Further assume that the SHA-256 input, that yielded this hash contained a known sub-string. Is there a way to find the input (containing the specific ...
2
votes
2answers
365 views

Many consecutive hashes to slow down brute force attack?

I've heard that hash algorithms like bcrypt are more secure because they take longer to complete, and therefore take much longer to brute force, without a ...
10
votes
2answers
912 views

How does hash speed vary based on string length?

Surprisingly I have not been able to find an answer to this question on Google. If I have a function that is based on any of the popular hashing algorithms used for password generation, by what ...
0
votes
1answer
73 views

Is it ok to store the plaintext hash of encrypted data

Is it ok to create and store the hash (unkeyed hash function) of a plaintext before encryption or does it lead to vulnerabilities? If it is ok are there requirements for the used hash function and ...
0
votes
0answers
35 views

Can anyone tell whether this RHO step of SHA3 is correct?

In rho step of SHA3, I have done right circular rotation whether its correct ?? I am doing in Verilog so I am using concatenation operator for rotation. For x=0 and y=1 that is A[0][1] rotation will ...
0
votes
1answer
55 views

Can anyone breifly explain the 'theta step' of compression box in SHA3?

Can you tell me the 'theta' step of compression box. D[X] = C[X-1] ^ ROT(C[X+1, 1]) In this step all the indices should be taken modulo 5. ...
1
vote
1answer
35 views

Secure way to hash a lookup value

I want to securely store a database table that consists of an account ID and a few columns of sensitive data. The data only has value if it can be associated with the account ID. My thinking is to ...
0
votes
1answer
43 views

Does absence of second pre-image resistance infer absence of pre-image resistance?

Talking about hash functions, I know the hierarchy is as follows: Pre-image resistance Second pre-image resistance Collision resistance Where each property implies the one before it so 2nd ...
1
vote
2answers
103 views

Can “Approximate Hashing” work in a Proof-of-Work context?

Here is a draft of an article claimed to soon appear in a peer-reviewed conference: Matthew Vilim, Uenry Duwe, Rakesh Kumar, Approximate Bitcoin Mining. It is proposed to simplifying a SHA-256 engine ...
1
vote
1answer
95 views

Fast MAC for 64-bit inputs

I am looking for a fast MAC (~few machine instructions) to be used for hash tables with 64-bit public inputs. I can't use SipHash as the hash function will be inlined in too many places and so the ...
-2
votes
2answers
41 views

mapping function

I have read a scientific paper which covers some security schemes in mobile ad hoc networks. I don't understand this notation: $$H_0\;\;\;\text{ Mapping }\{0,1\}^*\to \mathbb Z_p^*$$ where $p$ is a ...
2
votes
1answer
126 views

Questions about a SHA3 cipher stream encryption scheme

I have written an encryption implementation using a hash as a cipherstream for demonstration purposes. I know it is slower than more sensible options such as AES but I am interested in several things, ...
0
votes
1answer
71 views

Are these hash function compositions collision resistant?

If a hash function $H$ is collision resistant, are the following two hash functions collision resistant or not? ($||$ is concatenation) $H'(m) = H(H(m)) || H(m)$ $H''(m) = H(m) || H(m)$ My first ...
1
vote
1answer
69 views

What effect does a salt have on attacks against hashes's fundamental properties?

I am interested in analyzing how adding a salt to our hashed passwords affects the three types of attacks we can use. The three types of attacks against hashes are as follows: We have the hashed ...
0
votes
1answer
26 views

Vulnerabilities in specifying the hash algorithm used for signature verification on a per-message basis

Let's say that I have a 4096-bit RSA key and when I sign data, I typically use SHA-512. As far as I understand it, the hash algorithm used to sign/verify a message is specified in the message. If a ...
1
vote
1answer
92 views

Why does a fixed key not make MACs like CBC-MAC or GMAC into secure hash functions? [duplicate]

Why does setting the secret key to a fixed, public value not make MACs like CBC-MAC or EMAC into secure unkeyed cryptographic hash functions? In other words, why is the resulting hash function not ...
3
votes
1answer
81 views

What is wrong with simple concatenation in salted password hashes?

I once heard that if implementing a password hashing scheme, simply concatenating the password and salt together before hashing could lead to some subtle vulnerabilities, and I'm trying to figure out ...
1
vote
2answers
77 views

Secure randomized data matching?

This might be a dumb question but I will go for it. Let's say we have a data set $D$ consisting of sensitive data, and we want to be able to match if a new piece of data $S$ already exists in $D$ ...
0
votes
1answer
49 views

Can OTP be made practical by using stretched hash algorithms? [duplicate]

One of the main reasons for not using OTP in everydays life is that it is highly impractical - for encrypting 4GB of files we need a 4GB key that needs to be exchanged secure. I've had an idea on how ...
0
votes
1answer
73 views

What is the complexity to break second preimage resistance?

In the context an of hash functions we have three required properties. Preimage resistance Second preimage resistance Collision resistance. The bounds for Pre image collision is $O(2^{n-1})$, the ...
3
votes
2answers
91 views

Long passwords and Bcrypt

I need to store passwords for a web application, and was looking at Bcrypt for a possible solution. After some research, it appears only the first 72 bytes influence the final hash output. While it is ...
1
vote
2answers
68 views

Is there a standard for hashing a list of strings?

I'm working in Python, and my goal is to hash a list of strings with a cryptographic hash function such as sha256. It would need the property that a change in any string, or the order of the strings, ...
4
votes
2answers
117 views

Is there such a thing as a hash function with a fixed size input?

That seems like it would be a useful primitive. Using it in place of a block cipher in the Merkle–Damgård construction would give a variable-length hash, maybe without the tricky business with related ...
4
votes
3answers
338 views

Parallel-resistant proof-of-work scheme?

I am looking for a proof-of-work scheme which cannot be effectively parallelized. For example, in hashcash (and by extension bitcoin) you have some collision-resistant hash function $f()$, a target ...
1
vote
0answers
41 views

Vulnerabilities in SHA-1 [duplicate]

Are there any known vulnerabilities in SHA-1 that can be exploited? Certain patterns that it shows? I recently performed a frequency analysis using 20,000 common words, and found nothing exploitable. ...
4
votes
1answer
242 views

What is the “compression function” in Merkle-Damgård?

Is the "compression function" in Merkle-Damgård just a collision-resistant, one-way hash function but one that operates only on fixed size inputs? If so, is MD just a way to extend it to work on ...
1
vote
0answers
19 views

Security issues with self encryption? [duplicate]

I'm thinking about the scenario of using a set of (potentially untrusted) hosts to store (potentially private) files. Think something like distributed backup where you contribute some disk space and ...
0
votes
1answer
61 views

Function with no fast path and with fast proof

When a function is iterated and each time a previous result is used as input to the next iteration (feedback), so that there is a limited benefit from parallel computing, is there such function that: ...
6
votes
2answers
183 views

What is wrong in the following algorithm for computing a hash function using RSA?

I'm studying for a cryto exam and have run across this question which has stumped me. What is wrong in the following algorithm for computing a hash function? Take a message $M$, generate a random ...
6
votes
4answers
2k views

Constructing a block-cipher from a hash function

It is possible to use a hash function to construct a block cipher with a structure similar to DES? Because a hash function is one way and a block cipher must be reversible (to decrypt), how is it ...
0
votes
2answers
85 views

Discrete logarithm hash function Exercises

I have a problem with this exercise: Let $G$ be a group of order a prime $q$ and let $g, h$, be two randomly selected elements of $G$, with $g,h\ne 1$. Consider the following hash function on ...
2
votes
3answers
107 views

Proving that a node is the only child

Say I have a graph of messages like this: A | B / \ C D By including the parent hash in the message to be hashed I can show that B is a child of A, ...
8
votes
4answers
635 views

Hashing a password before using for online accounts

I don't actually know what I'm talking about, so apologies if I get anything wrong. At the moment I have a password naming system for most of my online accounts that looks something like this: ...
4
votes
1answer
101 views

How does the Flickr length extension attack work?

I am currently reading about the length extension attack on Flickr (pdf) but not understanding what's going on there. ...
2
votes
1answer
116 views

Are there any successful preimage attacks?

Are there any successful preimage attacks on any serious cryptographic hash algorithm or at least on serious-looking non-cryptographic hashes (like MurmurHash)?
1
vote
1answer
86 views

Cycling hashing in PBKDF's and their limitations in strength?

I hope this question isn't too similar to one that's already been asked. I also want to point out I know part the answer already, AFAIK: I just want some expert input on this. Let's model a hash that ...