Skip to main content
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

Questions tagged [hamming]

Hamming distance is the number of symbols that differ between two strings. Hamming weight is the distance between a string and the zero string of the same length; i.e. the number of 1 bits for binary strings.

Filter by
Sorted by
Tagged with
6 votes
3 answers

Is it possible: delayed secure hamming distance

I am a professional developer with a mathematics background, but know next to nothing related to cryptography. I would like to know if the following scenario is even possible. Let's say Alice and Bob ...
Benjamin Lefebvre's user avatar
1 vote
2 answers

Hamming Distance and Avalanche effect in Cryptography?

I am new to Cryptography and I know there are better ways to test a cipher's effectiveness out there but in this case I am trying to test a cryptographic algorithm's(AES,xchacha20,twofish) hamming ...
Jake's user avatar
  • 43
0 votes
1 answer

What are the parity bits in a (7,3)-linear code

If I have a linear (7,4)-Hamming Code I know that the last 3 bits are the parity bits but I just have seen that there are multiple linear codes like (7,3) for example the code with basis: $$\begin{...
B0BBY's user avatar
  • 103
1 vote
1 answer

Minimal Hamming distance of SHA512 hashes at bit flip

For $n\in\mathbb{N}$ let $\{0,1\}^n$ denote the set of $\{0,1\}$-vectors of length $n$. Let $\{0,1\}^* = \bigcup_{n\in\mathbb{N}}\{0,1\}^n$ denote the collection of all finite-length $\{0,1\}$-strings....
Dominic van der Zypen's user avatar
2 votes
3 answers

Earliest citation for truth density

I am searching for a citation of a formula that calculates the proportion of true (1) outcomes in the corresponding truth table of a boolean function. Searching a little bit in the Cryptography ...
John's user avatar
  • 123
3 votes
1 answer

References about a boolean function involving hamming weight

Some weeks ago, I read an article about an interesting boolean function with some applications to cryptography. Then, I forgot about the article and now I cannot find it. Hence here I am asking if ...
Molan's user avatar
  • 31
1 vote
1 answer

Metrics for Measuring the Distance of Two Numbers in Cryptography

Hamming Distance (HD) has been used to measure the distance of two numbers when they are converted into binary representations. e.g., $Ham(1, 2)=2$ as ...
Paxton's user avatar
  • 13
1 vote
0 answers

Low weight linear $\varepsilon$-universal hash function

According to the definition, an $\varepsilon$-universal linear hash function family, given a field $\mathbb{F}$, is a set of linear transformations $\mathcal{H} \subseteq \mathbb{F}^{m,n}$ such that ...
JayTuma's user avatar
  • 71
6 votes
1 answer

Is it possible to construct a PRNG where the output numbers have a certain distribution of hamming weights?

I am in need of a non-uniform random number generator where each n-bit output has a hamming weight with a certain binomial distribution. For example, I would like a non-uniform PRNG which generates ...
Ollie's user avatar
  • 163
2 votes
1 answer

Is it possible to perform CPA(Correlation Power Analysis) when attacker has only specific round's waveform?

I read Quite a lot document about breaking AES using CPA. But most of them, assuming that attacker has the first or last round of the waveform(trace) and exploit SubBytes. My question is if the AES-...
Lee Anon's user avatar
1 vote
0 answers

Hamming distance in XOR decryption

I've been working on cryptopals 1.6, breaking XOR, and have got it working. I found this answer that explains why hamming distance works, and after some consideration I believe I'm starting to ...
dutt's user avatar
  • 171
0 votes
1 answer

Caculating Correlation for CPA attack on AES

I am having some trouble understanding how to calculate the correlation coefficient for CPA attack on AES. In the article Study of Deep Learning Techniques for Side-Channel Analysis and Introduction ...
abdul rahman taleb's user avatar
2 votes
0 answers

Closest Keccak256 hashes by Hamming distance? [closed]

What are the two "closest" known Keccak256 (not SHA-3 256) hashes in terms of the Hamming distance between the pair of hashes? EDIT: This was marked as opinion based, so to clarify, when I asked this ...
Lev Knoblock's user avatar
2 votes
1 answer

Why is PRESENT 31 rounds?

I tried a number of different inputs and keys and checked their respective hamming distances after each round. It seems PRESENT has an ideal or near ideal hamming distance (31 to 33) after only a few ...
Red Book 1's user avatar
  • 1,025
2 votes
0 answers

How many Affine function can be made from $4 \times 4$ and $8 \times 8$ S-boxes?

The nonlinearity of an S-Box is defined as the non-linearity of its vectorial Boolean Function. Let $F$ be the hamming distance between the set of all non-constant linear combinations of component ...
sam's user avatar
  • 21
2 votes
2 answers

BOOLEAN FUNCTIONS: generate a function $f: \{0, 1\}^n \rightarrow \{0, 1\}$ from a $n \times n$ S-Box

I want to calculate the hamming weight of a S-Box using this formula: $\text{hw}(f) = \sum_{x=0}^{2^n-1} f(x)$. Where $f: \{0, 1\}^n \rightarrow \{0, 1\}$ My problem is that I don't know how to get ...
Targunitoth's user avatar
3 votes
2 answers

Calculating XOR Key Sizes [duplicate]

I've been playing around with the Matasano crypto challenges ( I had a couple false-starts on the challenge that has you creating a program to calculate the key size of a XOR encrypted ...
Dave Hull's user avatar
7 votes
1 answer

HMAC ipad and opad choice

It is written in the HMAC paper that the ipad=0x36 and opad=0x5C were chosen such that it maximize the Hamming-Distance of the ...
Bush's user avatar
  • 2,140
6 votes
1 answer

Hamming Distance vs. Index of Coincidence

When analyzing a repeating-key xor cipher to find the key length, I've read about two key methods (assuming there aren't just repeating chunks of ciphertext for Kasiski's method), for some assumed key ...
Brownbat's user avatar
  • 623