Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [xor]

XOR, often written ⊕, is one of the basic operations on bits and bit-sequences. It is a building block of many cryptographic primitives (and some higher-level algorithms, like modes of operations).

8
votes
1answer
93 views

GCM mode of operation with long-term keys

Cross-post: https://cstheory.stackexchange.com/q/41435/873 Regarding GCM, NIST specifies the following: The total number of invocations of the authenticated encryption function shall not exceed $2^...
4
votes
1answer
370 views

Salsa20 Implementation: Sum of 2 Words with Carries Suppressed

I'm working on the 2nd part of the Salsa20 spec, and I want to implement a closure for the exclusive-or of two words(u32). The author defines the operation as the sum of two words with carries ...
4
votes
2answers
105 views

Why is this MAC flawed?

Consider a function to create a tamperproof cookie as follows: $$\text{cookie}(m, k) = m \| \text{hash}(m \oplus k)$$ where $m$ is a message provided by Alice, and k is a secret key known only to ...
1
vote
1answer
85 views

Reducing the XOR's in Implementation Cost

Suppose that we want to implement the following equations in binary finite field. $$ \begin{array}{l}\tag{1} y_{{1}}=x_{{1}}\oplus x_{{2}}\oplus x_{{7}}\oplus x_{{8}},\\ y_{{2}}=x_{{1}}\oplus x_{{2}}\...
0
votes
1answer
72 views

Multiplication instead of Key Derivation Function?

context In a one message communication. We are right after 2 DHKE (instead of one). Both users then have 2 secret numbers, J and K. question Is it a risk to replace the use of a Key Derivation ...
24
votes
3answers
7k views

repeating-key xor and hamming distance

I read that to break repeating-key xor you can do the following: try a keysize $n$ and compute the hamming distance between the first $n$ bits of the encrypted string and the bits $n+1$ to $2n$ of the ...
1
vote
1answer
96 views

Decrypt simple CBC with XOR

I have searched and my problem is exactly the same as shown here: Decrypt simple CBC message with known IV using XOR encryption However, when I implement the solution it doesn't work, neither does ...
0
votes
1answer
72 views

How to break RSA signature on XOR of hashed blocks

I'm trying to figure out if there's a way of breaking or weakening the following method of signing long messages Given $M=m_{1}m_{2}...m_{n},\,\,|m_i|=64b, \,\,h=h(m_{1})\oplus h(m_{2})\oplus\cdots\...
2
votes
1answer
78 views

Attacks on one-time pad, given a property of keys

An adversary $A$, eavesdrops $n$ cipher-texts, $c_{1}, c_{2} ..., c{_n}$. It also knows a value $v$ and a function $f$ such that $$f(k_{1}, k_{2}, ..., k_{n}) = v$$ where, $k_{i}$ is used to encrypt $...
1
vote
1answer
72 views

Is this MAC correct and secure?

Let $m \in \{0, 1\}^{2n} = m_1 || m_2$. Let's also assume that $F_k$ is a PRF and $G$ is a PRG defined as $G: \{0, 1\}^n \rightarrow \{0, 1\}^n$. Now, Let's define the $MAC$ scheme as follows: $$MAC(...
1
vote
1answer
84 views

Decrypting a vigenere cipher with a reused one-time pad

I understand that when a plaintext is encrypted with a key of the same length, it is referred to as a one-time pad. Now when this key is reused to encrypt another plaintext, there is potential for ...
1
vote
1answer
95 views

What are the disadvantages of XOR key derivation?

Assume a 256-bit Key and a 256-bit Salt, with uniformly distributed entropy, both fully independent. Assume ...
4
votes
0answers
58 views

Upgrading key derivation by adding a XOR with a known value

In general keys for password based key derivation are derived from a password hash such as the old PBKDF2 function or Argon2, possibly followed by another derivation function to derive data and ...
1
vote
2answers
70 views

How is n-bit security calculated with nested encryption?

What will the total $n$-bit security be if I encrypt a message with a 128-bit XOR cipher and then take that ciphertext and encrypt it with a 128-bit key. Is the total security level now 256? One ...
1
vote
0answers
62 views

Is this a PRP? How can I create a distinguisher to show it isn't?

Consider the keyed permutation $F_k : \{0,1\}^2 \to \{0,1\}^2$ with two-bit keys defined as $F_k(x) = k\oplus x$. Is this F a PRP? How can I create a distinguisher D and calculate the difference ...
1
vote
2answers
115 views

Is it possible to use crib drag on base64 cipher text?

I am pretty new to the cryptography scene but I wanted to know if it is possible to use crib dragging on cipher text which doesn't contain words? This data would be encrypted using the same key with a ...
17
votes
1answer
26k views

How to attack a “many-time pad” based on what happens when an ASCII space is XORed with a letter?

I've already sent my correct solution to a homework exercise from Dan Boneh's Introduction to Cryptography class on Coursera: "Let us see what goes wrong when a stream cipher key is used more than ...
2
votes
2answers
133 views

Replacement for XOR in CBC?

In CBC mode, the XOR operation is used to combine the previous encrypted block with the current plaintext, to be used as the block to encrypt. Apart from other known disadvantages inherent to the mode ...
0
votes
1answer
53 views

Does repeated xoring of the (same) key K lower the entropy of K?

If a symmetric encryption key $K$ has been generated by some recommended (NIST for example) RBG then we should have a key with high entropy. But if we xor other bit-strings (e.g. IVs, other keys, etc....
-3
votes
1answer
102 views

How to decode function that returns number of 1s of the XOR of (target, a number you choose, and a biased random value)?

I received this problem and unsure how to figure it out. Apparently it is possible to decode the value correctly 99% of the time. An example: Suppose the target is 20, and there is a function (let's ...
0
votes
1answer
517 views

How can a XOR encryption be cracked systematically?

It's given that a string, encoded in hex format, is obtained by XOR encryption of a plain text and a key. The key is unknown (not even the length). What are the ...
2
votes
1answer
40 views

Common cyphers where the plaintext is the same length as the cyphertext

What are the common cyphers where the cyphertext is always the same length as the plaintext? I can think of XOR cyphers, and letter-substitution cyphers, what others are there?
2
votes
1answer
72 views

Is using derived keys for HKDF + AES-GCM safe

I have an existing system which takes a cryptographically secure BLOB from user and pass it to lower API which calls HKDF-Expand to get 2 keys: one is effectively discarded in this scenario and second ...
23
votes
3answers
43k views

How is XOR used for encryption?

I am a programmer, so when I hear XOR, I think about the bitwise operator (e.g. 0110 ^ 1110 = 1000). The mention of "XOR" comes ...
2
votes
2answers
60 views

Can one trade off the number of iterations for key length with the PBKDF2?

When using the PBKDF2, is one taking on significant risk if one chooses to lower the number of iterations and choose to have very long keys? Can I XOR my message with a a very long key (plain-text ...
1
vote
0answers
37 views

Is “hash-then-XOR” a good way of incrementally hashing an unordered set? [duplicate]

Is hashing the individual items, and then XOR-ing the results together, a good way of uniquely hashing an arbitrary unordered set of items? I am thinking of using hash-then-XOR since I want some sort ...
-3
votes
3answers
517 views

Practical perfect security in bitwise XOR vs integer addition/subtraction cipher

XOR already provides perfect security in theory but it's hard to apply it in practice due to strict requirements. I was thinking about whether simple addition/subtraction in integer format would not ...
4
votes
1answer
143 views

A problem in secret sharing and mixed operators over $\mathbb{Z}$

Recently, I studied an article in which it was written that having $(A-B)\oplus C$ and $B\oplus C$, we cannot find $A$. The authors used this result to build a secret sharing scheme, but they did not ...
3
votes
2answers
338 views

XOR Encryption with bcrypt password de-biasing

Objective: To have a very simple to verify, but very secure small message encryption. Idea: Message ⊕ bcrypt( Password). We remove password biases with bcrypt ...
2
votes
1answer
63 views

Password protection in ARJ: 3 characters of password are retrievable

On this site there is information that one can know first 3 characters (bytes) of the password without brute force. I know that ARJ in older versions has very simple encryption, i.e. XOR with ...
1
vote
2answers
193 views

mapping a 256 bit random number to a 3 bit number

I am making a 2 player dice game that runs for n rounds. To create random dice roles im using a concept a understood from randao. each user generates n sha3 hashes recursively of a random seed : e.g. ...
0
votes
0answers
61 views

find keylength in xor-based encryption

I have found interesting answer, written by GeneQ and now want to understand and implement it. I think, that first point of this answer can be rewritten in follwing way: suppose we have n bytes of ...
1
vote
4answers
240 views

If you XOR a random input with a biased input, the output is random - why?

Ive seen in an answer to this question here : https://stackoverflow.com/questions/5889238/why-is-xor-the-default-way-to-combine-hashes/5889288#5889288 that If you XOR a random input with a biased ...
4
votes
1answer
116 views

How many primitive cryptography operations are there? [closed]

Every cipher I've encountered seems to be built from slight variations of only three basic operations: the S-box, the P-box, and the XOR. I’m just wondering, are there any others? And if there aren'...
0
votes
1answer
108 views

is XOR-hash difference-unpredictable

Let $F$ be a PRF. The $XOR\text{-hash}$ is defined as: ...
1
vote
1answer
2k views

Breaking a XOR cipher of known key length?

For a challenge, I need to find the key that enciphered a text. I know that the key is of length N (invariable). There is no assurance that the key is only alphabetical or alphanumeric, but it could ...
2
votes
1answer
124 views

Solve System of Equations including XOR and Modular Addition

A Dummy cipher is shown in figure below. Plaintext is 16 bits ($X_1$ and $X_2$ are 8 bit each). Ciphertext is computed after two rounds using two round keys $K_1$ and $K_2$. Can the round keys $K_1$ ...
1
vote
1answer
99 views

Counting the $\operatorname{XOR}$ of an Element over the Finite Field $\operatorname{GF}(2^q)$

Definition: The $\operatorname{XOR}$ count of an element $\alpha$ in the finite field $\operatorname{GF}(2^q)$ is the number of $\operatorname{XOR}s$ required to implement the multiplication of $\...
3
votes
0answers
178 views

Why is XOR preferred over XNOR in cryptography? [duplicate]

The advantages and properties exhibited by XOR are also exhibited by XNOR, like the ones mentioned in many answers like this one Information is preserved. $c = a \oplus b$. One may recover $a = c \...
0
votes
1answer
102 views

Combining keys after key expansion: is it secure?

I've found an algorithm taht performs the following: expand the two keys using cryptographic hashing functions so the final keys will look like nonsense ASCII, then XOR them together to create a ...
-2
votes
2answers
549 views

Why the AES perform encryption in 10 rounds Instead of one?

I'm a Master's Degree student and researching about AES-128 encryption. My Advisor asked me a question about necessity of iterative rounds in AES. he asked:"why we couldn't encrypt a 128-bit plaintext ...
1
vote
4answers
170 views

Cryptography XOR Question

Recently I encountered an interview question related to XOR and I have no idea how to figure it out. The question is as below: The algorithm is: $A\oplus B$ (operation) $C = D$ We have the value of $...
2
votes
2answers
96 views

Is it possible to find two sets such that their hash xor summation is the same?

Consider two sets $A=\{a_1,a_2,\cdots,a_n\}, B=\{b_1,b_2,\cdots,b_m\}$; $m,n$ can be different. we can calculate the xor summation of each element's hash value: $XOR(A)=(hash(a_1)\oplus hash(a_2) \...
0
votes
2answers
77 views

Shortest key in symmetric algorithm used only once is unsecured?

Considering a message of n bits, one ridiculously short key of 1 bit and using this cryptographic function which performs the <...
0
votes
1answer
34 views

Reversing ITUbee's diffusion operation

One of the functions used in ITUbee's round function is $L$ which is defined as $L(A, B, C, D, E) = [E \oplus A \oplus B, A \oplus B \oplus C, B \oplus C \oplus D, C \oplus D \oplus E, D \oplus E \...
1
vote
1answer
141 views

Practical BCrypt plus XOR encryption for small messages

This is a practical solution available and potentially useful to everyone, so please give some leeway not banning this question. Details are at the end, but here is the question: How secure is the ...
1
vote
1answer
360 views

Security of a sha-256 based stream xor cipher?

Provided that I have some data I want to cipher and a password to do it: I generate a random IV I define c = sha256(password) I generate an infinite stream where <...
2
votes
2answers
1k views

Known plaintext attack without knowing the location of the plaintext

I'm trying to understand known plaintext attacks and since I best learn by doing I broke out Python and did the following: I have a plaintext string s and a key <...
3
votes
2answers
75 views

Can a CSPRNG, seeded with a key, be used to generate a byte sequence as long as the plaintext to XOR it with that?

Given a “safe” (meaning: brute-force is your only shot) cryptographically strong PRNG, wouldn't it be safe to encrypt data using the CSPRNG to create a key as long as the data and then encrypt the ...
0
votes
1answer
193 views

XORing to detect decrypted value?

So I am doing a CTF and I have found a text that is full with hexadecimal encrypted value with XOR (that was a given hint from the previous flag). I don't have the key but I know the length of the key ...