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)

0
votes
1answer
175 views

What is difference between Cryptographic Transformation, Encryption and Hash? [duplicate]

I read in a book that: let $f(K,R)$ is cryptographic transformation of $R$ using $K$, $K\{R\}$ means $R$ is encrypted using $K$ and $h\{R\}$ is the hash of $R$ and then the example follows. I want to ...
0
votes
1answer
84 views

What is the difference between H(M) and H3(M, s, IDA)? [closed]

What is the difference between H(M) and H3(M, s, IDA)? I am aware of Hash function with a Message and a Key, but there are three parameters in: H3(M, s, IDA). Here M is the message, s is the key, ...
0
votes
1answer
121 views

Huffman encoding of hashes

I have a huge list of MD5 hashes, which takes up quite some space. I was wondering if I would acheive (some) compression, by encoding the characters (which are A-F 0-9), with huffman coding. I made a ...
0
votes
1answer
138 views

Has a collision ever been found for SHA-1/2/3 when truncated to 128 bits?

I'm aware that MD5 is broken, and collisions have been found for it. I'm interested in other hashes (SHA-1, SHA-2, SHA-3) when truncated to the same digest size, i.e. 128 bits. The time complexity of ...
0
votes
1answer
93 views

What is the meaning of h(r) in this protocol?

Could somebody tell me what the meaning is of $h(r)$ in the protocol below? ‎‎$A‎\leftarrow‎{B}\quad:{h(r)‎‎}{,B}{,P{_A(r,B)}}‎ \\A‎\rightarrow‎{B}\quad:r$
0
votes
1answer
217 views

How to compare between two cryptographic algorithms in terms of security? [closed]

How to compare between two cryptographic algorithms (e.g. SHA-1 and SipHash) in terms of security? That is, how could one prove that algorithm X is more secure than algorithm Y?
0
votes
1answer
659 views

How many attempts does it take to crack a 32-bit password hash with this scenario?

How many attempts does it take to crack (match) a 32-bit password hash from a database of 4 million password hashes? Correct me if I'm wrong, but to crack a 32-bit password hash would take roughly 2^...
0
votes
1answer
374 views

Help converting sha256 to 32-bit stream

I need some help with hash value calculation. I am a bit confused by this statement that I found on w3 website on calculation of a DigestValue for xmldsig ( http://www.w3.org/TR/2002/REC-xmlenc-core-...
0
votes
2answers
173 views

Possible hashing scheme

Plaintext(binary) : 10101100 //very short for easy understanding Suppose we have 4 predefined schemes/functions, rotate (101 -> 011) flip (1101 -> 1011) exchange (11011 -> 10111) stretch (1100 -> ...
0
votes
1answer
52 views

Is there (this) a case in which salting is dispensable?

tl;dr this is not a duplicate of "what is a salt/why use salt?" question. Instead it is specificly asking when salt may not be necessary for hashing securly? (i.e. when the data being hashed is ...
0
votes
1answer
70 views

What cipher algorithm is this routine using? [closed]

I transfered a code routine from Java to Python: ...
0
votes
1answer
2k views

SHA1 - SSL/TLS Cipher Suite

SHA-1 is on the way to deprecation, in particular for digital certification (x509). But I can't find ressources about SHA-1 deprecation from SSL/TLS Cipher Suites. Is it implicit, as deprecation ...
0
votes
1answer
319 views

RC4 encryption/ decryption with hashing

I am working on RC4 encryption/ decryption algorithm based on the following: A wants to send M to B, for that A did: H = Hash (K||M) C = Ek (M||H) A sent ...
0
votes
1answer
84 views

Hash function and indifferentiability [closed]

What are the properties derived from the fact that a hash function is indifferentiable from a random oracle?
0
votes
1answer
433 views

How Does Progressive Hashing Work?

Example: http://jsfiddle.net/KGtUE/ https://code.google.com/p/crypto-js/#Progressive_Hashing sha256.update("abc"); sha256.update("def"); sha256.update("ghi"); ...
0
votes
0answers
5 views

In which situation a HMAC is mandatory ? (rather than digital signature)

I’ve seen that the question has been asked already but this is still confusing to me. In digital signature, Alice send a message M and the ...
0
votes
0answers
7 views

Entropy of Hash function [duplicate]

How is the entropy of the output of hash functions are defined? More specifically I saw in the paper https://eprint.iacr.org/2013/383.pdf Table 3 page 24. The entropy of challenge is mentioned which ...
0
votes
1answer
21 views

Hash system to generate same (specified) hash from multiple datasets?

I have a hashed value $X$ and need to ensure that any of the data sets $D_1...D_n$ can be concatenated with a correctional value $C_1...C_n$ and passed into a hashing algorithm to result in the value ...
0
votes
0answers
40 views

Is this Commitment Scheme binding?

Commitment scheme is given as follows: Alice chooses a random r the same size as x and calculates $y = h(x||r)$ where $||$ represents concatenation. Open: Alice sends x to Bob, and Bob calculates $y ...
0
votes
0answers
11 views

Rotate values in predefined manner

I want to create a Server S1, that publish a different value every 10 minutes on the internet. The value looks something like f7826da6-4fa2-4e98-8024-bc5b71e0893e. ...
0
votes
0answers
28 views

PHP Apple News HASH HHMAC

I am having a problem generating the signature key in PHP as describred in the Apple nes API documentation found here: https://developer.apple.com/library/ios/documentation/General/Conceptual/...
0
votes
0answers
16 views

What are the advatages or disadvatages of using seperate chaining over linear or quadratic probing?

I was looking through different hash methods the other day and was curious as to what the advantages or disadvantages of using separate chaining over linear or quadratic probing. I know that with ...
0
votes
0answers
80 views

Why are hash functions like SpookyHash and MurmurHash so highly collision resistant?

Why are hash functions like SpookyHash and MurmurHash so highly collision resistant? I tried to test these hash functions using a few billion input messages and I found that there is no hash value ...
0
votes
0answers
27 views

MAC is constructed by hashing and then encrypting

Suppose the MAC is constructed by hashing and then encrypting, that is $MAC(m, k2)=E_{k2}(H(m))$ where H is a public hash function. There can be several alternatives in how the transmitted message is ...
0
votes
0answers
50 views

signature, hashing schemes

I have 20 friends. we create message(s) (1...i) and tar them up with a file messages.hashes(1..i). We sign these tars with our ...
0
votes
0answers
27 views

Composing hash functions

Suppose there is a cryptographic hash function $H : \{0,1\}^* \to \mathbb G$. Now, we want to define a hash function $H' : \{0,1\}^* \to \mathbb G \times \mathbb G $. My first idea is to define $H'$ ...
0
votes
1answer
101 views

Large Volumes of Asymmetric Encryption

First of all, I apologize in advance if I use any incorrect terminology. I am just getting my feet wet when it comes to cryptography and there is a lot to learn. For the past 12 months we have been ...
0
votes
0answers
24 views

Filling in MD5 input variables

I have a majority of an input string(as well as the total length) and the output for an MD5 hash. Is there a way to calculate the remaining input bytes that I am missing?
0
votes
0answers
40 views

Does encrypting with MGF1/SHA-512/1024-bit seed equal to a 1024-bit key block cipher?

Suppose: Alice uses SHA-512 with MGF1(as in PKCS#1 V2) and a 1024-bit random seed to generate a mask, XORs the mask with a message(M), gets a cipher text (CT), and sends the CT to her old friend ...
0
votes
0answers
173 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 ...
0
votes
1answer
53 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: ...
0
votes
1answer
93 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. ...
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: ...
0
votes
0answers
34 views

NTRUSign Hashing

I have some trouble understanding the inner workings of NTRUSign. So what I have understood so far is, that when Alice wants to sign a message she does the following steps Convert Alice's message ...
0
votes
0answers
33 views

Can knowing part of what was used to generate an md5 hash make it vulnerable? [duplicate]

Say I am able to ask a black box MD5 generator to generate 1,000,000 hashes given input $STRING$ Where $STRING$ is an arbitrary ...
0
votes
0answers
49 views

Reversible hash function

I met the following 'reversible hash' function applied on a data $d$ consisting of $d_1, \ldots, d_n$ words: $h_0(d) = 0, h_i(d) = c ∗ (d_i + h_{i−1}(d))$, for $0 < i \leq n$. $c$ is a small, odd ...
0
votes
0answers
19 views

Encrypted vs unencrypted digital signatures [duplicate]

Is there a difference in terms of security between An encrypted stream of bits obtained by encrypting a plaintext concatenated with it's signature $ C = E_k(plaintext||\sigma)$ where $E$ is a ...
0
votes
1answer
151 views

SHA-256 Hash over multiple SHA-256 Hashes

I am trying to implement a checksum over multiple files. We can assume, that i have a package containing N files. I want to identify such a package uniquely by following calculation: SHA256-Hash ...
0
votes
0answers
56 views

Detecting Software Changes - Verifying untampered code

This question assumes an environment devoid of any internet connections, the software in questions operates in a non-connected environment on a single machine. I have a piece of software that may be ...
0
votes
0answers
32 views

Number of qubits and breaking hashes [duplicate]

Noting D-Wave's press release on a 1000 qubits quantum computer had me wondering... Does the number of qubits nonlinearly change the speed/rate at breaking a SHA256 hash? If someone makes a say 10,...
0
votes
0answers
72 views

MD5 SSL Collision Attack

I want to create fake certificate for test purposes. I have read about the http://marc-stevens.nl/p/hashclash/index.php project but I am unable to understand the two files that I have to put as input ...
0
votes
0answers
30 views

Is a timing side channel attack effective when the leaked information is related to the result of a hash?

I'm writing a function to act as a cryptographic hash of a number within a range that returns another number of the same range. The catch is that the result needs to have certain properties. I run a ...
0
votes
0answers
29 views

Is it bad practice to use the message digest of the plaintext as the initialization vector? [duplicate]

Data is being encrypted in a database. A message digest is being created for deduplication purposes. Is it ok to use the message digest that will be the key of the table that houses the encrypted ...
0
votes
0answers
134 views

How can I compare two hash algorithms? [closed]

In studying the algorithms of cryptographic hash functions, I have tried out a few (educated) modifications to the code for academic purposes only. For example, I modified the algorithm by applying an ...
0
votes
0answers
25 views

How to reconstruct hash value to the original format? [duplicate]

I would like to know how I can reconstruct a hash value such as 558f68181d2b0c9d57d41ce7aa36b71d9 to its original format (734). I have used a code in matlab, which provided me with an hash output, ...
0
votes
0answers
36 views

Establish authentication

I have designed a basic authentication scheme where two nodes will mutually authenticate that other holds a shared secret. I have very limited RAM/ROM (its on uC) and bandwidth. Here it goes: ...
0
votes
0answers
66 views

Anyone familiar with domain of hash functions in bilinear pairing based system?

I need a clarification regarding domain of hash functions. I have defined a bilinear pairing based system as follows: Let G1 and G2 be cyclic multiplicative groups of prime order p generated by g1 ...
0
votes
0answers
157 views

What can cause similar MD5 hashes

I have a set of MD5 hashes with huge similarities in the second half of the hash, (made up) examples: ...
0
votes
0answers
148 views

Key exchange using hash function

Consider two types of attackers on a key exchange (KE) protocol and subsequent communication between the parties which used this KE instance to establish a secure communication key. Attacker Eve ...