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).
307
questions
0
votes
1
answer
104
views
Advantages of AES vs XOR on a plain text file
Currently, I am using AES-GCM to encode and decode a plain text file. The key is derived from a plain text password using PBKDF2 and a random salt with SHA-256. However, I have been thinking and came ...
- 1
0
votes
0
answers
30
views
Solving XOR modular system of equations
I have the following problem.
Here's a rephrased version of your problem, keeping the LaTeX commands unchanged:
We are given $n \in \mathbb{N}$, $p, q \in \mathbb{N}$, and $y \in \mathbb{N}^{n+2}$. ...
- 101
1
vote
1
answer
86
views
Solving equation of xor and mod operation
How do I solve equations like this
$$(aX \oplus X+b) \bmod M = c$$
If a,b and c are known?
and if i have system of of equation with different b values, is it solvable? I am particularly interested in ...
- 11
1
vote
1
answer
155
views
What is the inverse of this generalised automaton (based on bitwise XOR and modular addition)?
Section 4.1 of the paper “Nonlinear Diffusion Layers” [Y. Liu, V. Rijmen, G. Leander] defines the nonlinear function $\rho$ over $\mathbb{F}_{2^m}$ as follows: $$\rho : \mathbb{F}_{2^m}^4 \to \mathbb{...
- 1,327
0
votes
0
answers
41
views
2 XORed AES-ECB ciphertexts, zero key and piece of plaintext
I have $C_1 \oplus C_2$ where $C_1$ = $AES128_k(P_1)$ and $C_2$ = $AES128_k(P_2)$.
I know the k, it is 0 (i.e. 16 bytes of zeros).
I know the piece of $P_1$ (7 ...
- 1
1
vote
1
answer
77
views
Biasedness of the XOR variable of two independent biased boolean variable
My question is very basic one. Suppose there are two independent boolean variable $X_1$ and $X_2$. It is given that $X_1$ is biased towards $0$ and $X_2$ is biased towards $1$ with same amount of bias....
- 145
0
votes
0
answers
40
views
Implementation of Ring Signature
I have implemented a ring signature in a Python program, To keep it simple, I have Alice and Bob. Based on this ring equation:
$$ v = E_k(y_s⊕E_k(y_i⊕v))$$
I will get:
$$ y_s = E_k^{-1}(v)⊕E_k(y_i⊕v) \...
- 11
2
votes
3
answers
120
views
Long Random Key and XOR - How Secure?
I have an application that encrypts files in the following manner (I think I can hear sighs already but bear with me):
Start with two byte arrays generated from random strings of lengths l1 and l2 (...
- 23
1
vote
1
answer
42
views
Security of keys that are as long as the data
If both communicating sides end up with the same secret 3000-bit key, is it enough to XOR each byte of the messages with each byte of the secret key to make it secure?
Wikipedia says it is, but I ...
- 139
2
votes
1
answer
47
views
A problem related to two bitwise sums of rotations of two different bitstrings
Let $r(b, t)$ denote the bitstring $b$ rotated to the left by $t$ bits: for example, $r(00110101, 5) = 10100110.$
Consider the following game. Player A picks two (different) $n$-bit strings $(T_1, T_2)...
- 1,327
4
votes
2
answers
134
views
XOR for more TRNG data?
If I have TRNG data as input (A1,A2,B1,B2,C1,C2) - can I xor it to provide more TRNG data A,B,C,D,E,F,G,H ?
...
- 41
2
votes
1
answer
71
views
Bit flipping attack in hash function for message authentication
In this picture we have a use of a hash function for message authentication.
M is plaintext message. H is hash function. E is encryption block with K symmetric key. || is concatenation of plaintext M ...
- 139
1
vote
0
answers
48
views
What happens if the column mixing in AES is replaced by simple XOR and subtraction? [closed]
This is https://github.com/kokke/tiny-AES-c The column mixing function in the AES algorithm implemented.
...
- 129
1
vote
1
answer
243
views
Can I use Argon2 to encrypt data?
Normally I use Argon2 to generate an encryption key, and then use AES to encrypt data with that key.
Can I just set the hash size to be equal to the data size, set the associated data to a random ...
- 11
0
votes
1
answer
132
views
If I encrypt two plaintexts with different keys, XOR the ciphertexts and send to an adversary, what can he/she do with what I sent?
Let's suppose I encrypt two blocks of 1MiB with AES-256 in CBC mode, each one using different keys, XOR the resulting ciphertexts and send this XORed block to an adversary. Remembering that the ...
- 391
1
vote
1
answer
383
views
Cracking an XOR crypt with a know key length [closed]
I'm trying to crack a crypt with a known key length. I deduced that the operation made was a hex XOR. Here is the crypt:
...
0
votes
1
answer
158
views
How many bits of encryption are enforced in WEP (wired equivalent protocol)
I'm currently taking a computer security module in University and as part of a problem have been asked:
My thought for the question is that no it does not provide 64 bits of security strength. This ...
- 77
0
votes
1
answer
56
views
Use same key k in deterministic counter mode to encrypt two different plaintext
What goes wrong if we use the same key k in deterministic counter mode to encrypt two different plaintext messages m0 /= m1.
It is not true that c0 = c1, because we XOR output of m0 with input of m1 ...
- 185
2
votes
1
answer
134
views
blake3 keyed hash compression output xor'ed with key secure?
I'm currently trying to write the blake3 algorithm in JS using the official whitepaper or what it's called.
If I understand correctly then... after the 7 round keyed permutation (at the end of the ...
- 25
4
votes
6
answers
2k
views
why XOR is recommended/Used in every paper I read for encryption and decryption stream cipher?
Stream ciphers use a deceptively simple mechanism: you combine the plaintext data, bit by bit, with “key” bits, using the exclusive or operation.
Why can't I use other opeartions such as NAND, AND, ...
8
votes
1
answer
184
views
AES vs. SHA2 in key-stream generation
A KDF in Counter Mode (e.g., see NIST SP 800-108r1, Section 4.1, similar to HKDF) produces the output as what AES-CTR would do if one replaces AES with SHA2 (or, to be exact, with HMAC).
However, NIST,...
- 129
1
vote
0
answers
24
views
Encrypting an IV with XEX using a block cipher and XORing on the plaintext: Is this scheme valid?
I had an idea to make XEX mode parallelizable at CPU level.
Let's suppose I take an IV, XOR with random data, encrypt, XOR again with another data, and XOR on the plaintext
Would this encipherment ...
- 877
1
vote
1
answer
166
views
Is the xor of a prg and a function still a prg?
I have this couple of deterministic functions $G_1$ and $G_2$. Suppose at least I of them is a PRG. Take $G^*=G_1(x)$ xor $G_2(x)$ with the same $x$. I have to show whether this is still a PRG. I ...
- 93
3
votes
1
answer
179
views
Will XORing two bad hashes lead to a collision resistant hash?
I'm reading the fourth edition of "Cryptography: Theory and Practice" by D.R. Stinson and M.B. Paterson.
In the book, they have mentioned the concept of "collision-resistant hash" ...
- 31
1
vote
1
answer
97
views
Encrypting with CBC then XORing repeatedly a chunk of random data smaller than the plaintext: Is there a gain in security?
If I encrypt a 1MiB file with AES-CBC (or any other cipher) and XOR a 128KiB of (truly) unpredictable random data repeating until the end of file, will I have a security of 1048576-bits (128KiB*8)?
...
- 877
1
vote
0
answers
57
views
DES next round key
I don't understand which DES key is used in the next round of Feistel construction.
As you can see below, we use our original key that has been inserted in permuted choice 1, where we got 56 bits, ...
- 11
2
votes
2
answers
977
views
What are the performance reasons behind "xor-a-rotated-sum" instead of "add-a-rotated-xor" in Salsa20?
I'm currently reading the specification of Salsa20 (link). DJB on whether he chooses
"xor-a-rotated-sum" instead of "add-a-rotated-xor" states the following :
Should there be ...
- 878
1
vote
1
answer
172
views
Reversing an XOR encryption/decryption function
I have a help recommended high-school project that I'm stuck with. To basically explain the problem: I have an encryption function that is used as the decryption function and I need to reverse it to ...
- 13
1
vote
1
answer
177
views
The XOR operation, is it a quantum resistant operation and why is that? if not, what is the most lightweight alternatives?
The XOR operation is an important part of most of the existing end-to-end authentication protocols. Will it be part of the post-quantum authentication protocols?.
- 11
3
votes
2
answers
2k
views
How to securely XOR two passphrases in JavaScript?
Is following approach secure?
Planning on using implementation to XOR two passphrases before feeding result to Argon2.
...
- 189
2
votes
1
answer
127
views
What is the name of this kind of logic diagram?
I want to read this kind of diagram, but I haven't found the name of this, or somewhere I can find a legend of symbols used, or a tutorial to learn reading this...
I've googled this for over an hour, ...
- 23
2
votes
1
answer
133
views
What is the security of multiple encryption using Even–Mansour scheme (XEX)?
As I know, the best attack on single or double Even-Mansour scheme is N/2, being N the key size (or size of one of the two keys used).
I know that encrypting two times using this scheme is susceptible ...
- 877
4
votes
2
answers
394
views
Proof that the Family of Toeplitz Matrices is XOR-Universal
Definition of XOR-Universal hash functions by Abidin[1]:
A class $H$ of hash functions from $M$ to $T$ is XOR-Universal$_2$ ($XU_2$) if there exist at most $|H|/|T|$ hash functions $h$ $\in$ $H$ such ...
2
votes
3
answers
238
views
What does $(a+b) \bmod{256}$ and $a$ XOR $b$ reveal about $a, b$?
Say $a$ and $b$ are some uniform random $8$ bits so that the entropy of $a$ and $b$ is 8 bits each.
If I show you $(a+b) \bmod{256}$ and $a$ XOR $b$, then what can you tell about $a$ and $b$? Or how ...
- 563
1
vote
0
answers
47
views
What is the security of XORing SHAKE256_XOF with itself?
After reading "Can the xor of two RNG outputs ever be less secure than one of them?" I wondered if you can increase security of SHAKE256_XOF by using ...
- 175
0
votes
1
answer
2k
views
How can I decode a XOR cipher with a string key I know?
I have a text that has been XORed with the key "77U" (I am sure of this as it is a file created by a code I have, so I have seen every entry getting XORed by 77U.
However, none of the online ...
- 3
0
votes
0
answers
46
views
Is multiple encryption with XORs between each encryption operation susceptible to meet-in-the-middle attacks?
Let's suppose I take a cipher with key size equal to the block size (Threefish).
I XOR a random block in the ciphertext, encrypt with a key, XOR another random block, encrypt again with another key ...
- 877
0
votes
0
answers
115
views
Hamming distance between product and carry-less product
Motivation. There is a fast approximation to conventional multiplication. It conceptually works like long multiplication except for the fact that the carry is discarded instead of applied to the more ...
0
votes
1
answer
314
views
Why is this code working
I was doing some introductory challenges at CryptoHack and one of the challenges, more precisely it was Favourite Byte, XOR with a single byte.
I did my solution with XORing given string and single ...
- 103
2
votes
1
answer
156
views
Does adding more XOR layers in the XEX block cipher mode increase its security or double it?
I read about XEX mode of operation in Wikipedia
My question is:
There are two keys that are XORed against plaintext, if instead of two XORed keys I add 4 or 6, does it increase the security of block ...
- 877
13
votes
5
answers
4k
views
What is wrong with XOR encryption with secure PRNG?
Suppose I want to encrypt a message with a password.
Couldn't I just XOR the bytes with bytes from a cryptographically secure pseudorandom number generator (CSPRNG) with seed being the password, or a ...
- 141
2
votes
1
answer
977
views
Nexor, an encryption algorithm that promises unlimited key sizes: Is it safe?
My intention is not to make spam here, but I came across this project in Github: https://github.com/andrewhodel/nexor
It's an algorithm called Nexor, it promises encryption with unlimited key sizes.
...
- 877
4
votes
1
answer
352
views
Is there any result which states that if the output of these two functions is XOR'd, the XOR'd output is pseudorandom
Let $\mathbb{G}$ be a group of prime order $p$ with generator $g$. Suppose that I randomly pick $r_1,z_1 \leftarrow \mathbb{Z}_p$ and $r_2, z_2 \leftarrow \mathbb{Z}_p$ and $c \leftarrow \mathbb{G}$. ...
- 163
0
votes
0
answers
127
views
What happens when we hash already hashed values, concatenated together?
I read on the page 16 of On the Security of Hash Function Combiners that
the classical combiner for collision-resistance simply concatenates the outputs of
both hash functions $Comb_{\mathbin\|}(M) = ...
1
vote
0
answers
494
views
How to show the PRF in 4.8(b) is not secure? [closed]
Let F be a PRF defined over $F:\{0, 1\}^n \times \{0, 1\}^n \to Y$.
We say that $F$ is XOR-malleable if $F(k, x \oplus c) = F(k, x) \oplus c$ for all $k, x, c \in \{0, 1\}^n$.
We say that $F$ is key ...
- 11
3
votes
1
answer
88
views
Fastest order-sensitive operations
For any $v$ many $b$-bits vectors $(\mathbf{x}_0, \mathbf{x}_1, \ldots, \mathbf{x}_{v-1}) \in \{\{0, 1\}^b\}^v$, what's the fastest way to combine $\mathbf{x}_0, \mathbf{x}_1, \ldots, \mathbf{x}_{v-1}$...
- 563
1
vote
2
answers
2k
views
Is XORing a Base64-encoded string secure?
Theoretically, is it secure to first encode a string using Base64 and then XOR it with a random key or are there potential weaknesses that could be exploited?
Obviously this doesn't make any sense in ...
- 13
4
votes
1
answer
859
views
Weakness of XORing random bytes with secret key
Side A generates 16 (high quality) random bytes and performs XOR with a 16-byte secret key, then data transfers to side B, where the same secret key is used to recover the original 16 random bytes.
Is ...
0
votes
1
answer
176
views
Showing the pairwise XORed random variables are independent
If $X_i$'s are $3$ independent random variables defined over $\{0,1\}$ with biases $\epsilon_i$'s for $1\le i \le 3 \;$ and $\epsilon_1 = \epsilon_3 = 0.$ Then $X_1 \oplus X_2$ and $X_2 \oplus X_3$ ...
- 145
0
votes
1
answer
75
views
Does XORing a random block into a layer of CBC encrypted message add some bit strenght?
Let's suppose I encrypt a message with a block cipher in CBC mode, keep the key and IV secret and XOR a random block of data in each encrypted CBC block, being the XORed block the same for each CBC ...
- 877