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).

Filter by
Sorted by
Tagged with
0
votes
0answers
14 views

xor DECODING without a key [closed]

How do I find the binary key that decodes FA41086EF9153F into a readable word in English. So Far, I have tried several keys of different lengths and nothing makes sense .. any one has any hints?
2
votes
1answer
39 views

Need help finding keysize for Vigenere cipher

I am doing a crypto challenge for breaking a Vigenere style repeating XOR encryption (https://cryptopals.com/sets/1/challenges/6). I have looked at similar questions asked here, mainly this one: ...
3
votes
2answers
167 views

Formula for bits of entropy per bit, when combining bits with XOR

Assume that bits $A$ and $B$ each have .5 bits of entropy per bit. The two-bit result of the concatenation $A‖B$ has 1 bit of entropy total, and it retains the entropy density of .5 bits of entropy ...
1
vote
3answers
100 views

Using sha3 as a deterministic source of psuedo-random bytes for xor encryption

The following code generates a deterministic stream of pseudo-random bytes, using SHA3. ...
2
votes
2answers
97 views

Is it safe to XOR-combine hashes by rotating them first?

I have a small number of hashes. I would like to combine them into a single hash. XORing the hashes ignores their order, which is important. Also, it could lead to a result of zero if there were an ...
0
votes
1answer
63 views

Using xor encryption in the following use case

I use an encryption scheme based on a symmetric cipher, with the corresponding symmetric key encrypted with RSA/OAEP using the public RSA key of the recipient. I now want to use ECC crypto in ...
1
vote
0answers
109 views

Generating a XOR Hash function for a given group of numbers to maximise collisions

Given $x$, a vector of $m$ distinct bit vectors of bit length $N$, I want to use an XOR-hash $h$ such that all $x_i$ collide to the same value. I define an XOR hash $h$ which takes bit vector $q$ as ...
0
votes
1answer
56 views

Can i XOR an array of bytes with an equal length key securely

If i have say 64 bytes, can i XOR those bytes with another 64 random bytes, and have two new arrays, where both are needed to reconstruct the first? Intuetively i need some symmetric encryption like ...
2
votes
0answers
81 views

Assignment: XOR-cipher [duplicate]

I am currently attending a IT-Security course at the Tel Aviv University and I stuck with the an assignment task. Please DO NOT post the solution if you know it. But I would be very grateful for any ...
13
votes
7answers
6k views

Can I encrypt a message by swapping bits in the text?

I have tried out an encryption method, in which I swap bits in the text. The text length is N bit, then I generate several random number pairs in the range 0..N-1, as [n,k] pairs. After that I swap ...
0
votes
0answers
35 views

Approach used with XOR cipher in black box scenery

What's the approach used in cryptanalysis to make an decrypter for a simple xor stream cipher in a Black Box scenery with only the output?
3
votes
2answers
211 views

XOR cipher with fixed key and known relation among plaintexts

I have three messages, each known to be XOR-encoded, with the same key used for each message of this XOR cipher. Encoded message 1: $e_1\,=\,00100111010$ Encoded message 2: $e_2\,=\,01001110110$ ...
1
vote
2answers
130 views

Secret sharing scheme WITHOUT Shamir Secrete Sharing

I am planning to use the following XOR scheme to divide a secret into only 2 shares (I do not want to use Shamir Secret Sharing for different reasons that are beyond the scope of this post). Here's ...
1
vote
1answer
78 views

Potential weaknesses when combining hash functions?

For consistency's sake, M is the message, H1 and H2 are separate hash functions. I've heard that concatenation or XORing hash outputs together do not provide improved security against preimage and ...
2
votes
2answers
97 views

Weakness in a CBC-like XOR cipher

A simple symmetric encryption algorithm can be written as follows: Input message M and 64 bit key $K$ Divide M into 64 bit size blocks $B_1...B_n$ Get first block $B_1$ and perform bit-wise $\oplus$ ...
0
votes
1answer
70 views

Boolean XOR function a valid way to verify the integrity of a message

Does the Boolean XOR function represent a valid way to verify the integrity of a message ?
1
vote
2answers
69 views

GMW Multiplication AND for 2 parties

I am looking into the GMW protocol's evaluation for multiplication in 2 parties. I have referred to different materials on it but I didn't exactly understand how $a_i b_j + a_j b_i$ is calculated in a ...
0
votes
1answer
54 views

Example of a Two-party GMW Protocol

I have been looking for a concrete example of GMW protocol for two parties. I was trying with the following example for computing $XOR$ of two parties: A's secret bit is $a = 0$, B's secret bit is $b ...
4
votes
1answer
157 views

Using Diffie–Hellman without a key derivation function

In an answer to another question, it was suggested that the shared secret derived from Diffie–Hellman key exchange could then be used directly as a one-time pad to encrypt a message (by XORing the ...
2
votes
1answer
60 views

Meaning of difference Δ delta

I tried to understand some crypto text but I am new to this. Does this: Let $X,X'$ be $\ell$-bit values, and $\Delta X=X\oplus X'$ means that $X$ and $X'$ have $\ell$ bits and $\Delta X=X-X'$ or ...
0
votes
0answers
103 views

What does a repeated byte between two XORed hexadecimal ciphers mean?

I have two different hexadecimal strings (of same length) that I think are encoded plain text strings. Out of curiosity I XORed them and I found a single hex byte repeated for the length of the two ...
1
vote
0answers
96 views

How to reverse this simple xor encryption function? [closed]

this code decrypts encrypted rom code from an arcade game pcb (it is from source code of Mame emulator) for each byte in rom... ...
1
vote
0answers
39 views

Dining-Cryptographer Net (DC-Net) Scheme that Handles Collisions?

[Question edited at the request of Mods] I recently became fascinated with the elegant and simple solution that Chaum proposed for the Dining Cryptographers problem. If you are unfamiliar, please ...
3
votes
1answer
102 views

Solving a system of equations using both arithmetic and bitwise operations

At first I asked this question on Stackoverflow, where I was advised to ask here. So there is the question: I have a system of pretty simple equations: $x + y = A$ $f(x,y) + y = B$ $A, B$ are known....
0
votes
1answer
53 views

XOR PSK with random buffer

I need some guidance here: assuming I have the following: (PreSharedKey of 32 bytes) XOR (one time Random Buffer of 32 bytes) The only way to crack this should be brute forcing, correct? One of the ...
1
vote
0answers
87 views

Break an encryption made with XOR of a key and a known Nonce

My questions is general, but in my case regards the Kerberos protocol and the communication between the client first message and the KDC. Is there some problem in encrypting using a: (secret key XOR ...
0
votes
1answer
66 views

Is there any security issue if an attacker recovers the key stream generated by a stream cipher?

I've learned that a stream cipher like ChaCha20 generates a key stream that gets XORed with the plaintext to get the ciphertext... If an attacker knows the plaintext, he could just simply XOR that ...
1
vote
1answer
109 views

XOR of 16-bytes variables gives a result of size not equal to 16

I'm trying to write a XOR code for implementing CBC mode of operation from scratch but i seem to have some problem.The function takes two byte variables of 16bytes and the expected output should be ...
-1
votes
2answers
95 views

Is there any vulnerability in this scheme?

We want to design a symmetric encryption scheme. Note that the following things are true for our system: The plaintext P will change every time for a given user. A user will choose a password which ...
2
votes
1answer
83 views

Why is the second XOR operation in OCB mode necessary?

In Rogaway's OCB mode, the offset (derived from the key) ist XOR-added twice: Once to the plaintext block, and a second time after the Encryption. I am wondering, why the second XOR operation is ...
0
votes
3answers
294 views

How secure is XOR-CBC?

How secure would this be? To be clear, I mean replacing the block cipher encryption step in the Wikipedia diagram explaining CBC with plain old XOR? EDIT: Replace ...
1
vote
1answer
61 views

Stream cipher - Many time pad

I understand the concept that when you xor the cipher texts you get the XOR messages cause the keys get XOR-ed and cancel out... This is at least the case when both the messages are of equal lengths. ...
1
vote
0answers
42 views

OTP Random Pad Renewal Without Extending Message

So I recently learned about the concept of a One Time Pad; and I from what I understand it means that if a XOR key is completely random and equal to or longer than the plaintext, it makes it so that ...
0
votes
1answer
83 views

PRNG XOR Pipeline

For an OTP I need the 'best' random data I can acquire. Please check if my thinking for stacking PRNGs together in a pipeline can only make the output statistically better, never worse?! So take a ...
0
votes
0answers
55 views

Key size of a repeating key XOR-encrypted message using Hamming distance

To find possible key sizes for an encrypted message, I break the message into blocks with length s, ...
1
vote
3answers
564 views

How strong is XOR encryption of 256 bit plain text with 256 bit key?

I was wondering if we take just 256 bits of plain text and simply XOR every bit with a 256 bit key, how strong can it be ?
0
votes
2answers
103 views

Would XOR'ing two Argon2 keys add extra security?

When a user registers on the app, they need to provide a password they create and we provide them with a randomly generated passphrase (e.g. Apple Cat Ladder Fire). We then use Libsodium's ...
1
vote
1answer
249 views

Simple block cipher

I came up with this concept, which I thought would be pretty secure. So the idea is this, you have a message $M$, which you split up in blocks of each 256 bits. You generate a random (pseudo-random ...
0
votes
1answer
86 views

Secret Sharing between $x$ parties

So for an unknown number of parties $x$, I make $x-1$ random $n$-bit strings represented by {$r_1, r_2,...,r_{x-1}$}. Where $s$ is the complete string split up between $x$ parties (yes?). I then ...
1
vote
1answer
56 views

Definition of diffusion matrix

I've been studying this article and since I'm not studying cryptography in English and it is not my native language, I don't understand some of the terminology. More precisely: what are diffusion ...
2
votes
1answer
966 views

ChaCha20: is this a potentially safe way of using nonce derived from private key if the key/nonce pair is never reused, for a given plaintext?

Note: I realize in ChaCha20 the nonce should be random and unique each time follow certain constraints but am trying to determine whether there could be a safe way to use it just once if other ...
0
votes
1answer
96 views

Why is this OTP decryption wrong? [closed]

i have a problem that goes: ...
1
vote
2answers
382 views

XOR and key reuse [duplicate]

I've been doing a bit of reading on the use of XOR and the dangers of key reuse. I'm aware that reusing a key can open a door for a frequency analysis attack on my plain text. So far, everything ...
3
votes
1answer
187 views

Circular hash collision where digest is pre-image: Could hash(a) = b, hash(b)=c, then hash(c)=a?

For any SHA-family of algorithms (including Keccak) except for SHA1, would it be theoretically possible for there to exist a pre-image a whose hash digest ...
2
votes
1answer
733 views

Does XOR'ing a random number with its inverse reduce its security if the result is a palindrome?

[And four related questions/examples below:] 2) If a random 256-bit number is XOR'ed with its reverse (i.e. the big-endian version XOR'ed with the little-endian version), does this reduce the ...
1
vote
1answer
47 views

How to handle multiple key-agreements

If I would use two different key-agreements e.g. SIDH and ECDH how would I handle these both derived keys? Is there a different between XOR or SHA-256 the two keys? (Would one reduce the level of ...
5
votes
2answers
268 views

Collision resistance of partial SHA-256 hashes XOR'ed

My hashing algorithm computes the SHA-256 for each of 12 input strings and XORs them to get the final hash. Is there a risk of an attacker being able to forge 2 sets of inputs that yield the same ...
0
votes
1answer
328 views

What's the number of unique possible Cayley tables in a 16*16 grid for XOR'ing single hex characters?

A few days ago, I designed and s-box then derived the following Cayley table of all possible XOR outputs of hex digits in the range of ${2^4}$ and was curious how many such "valid" possible ...
2
votes
2answers
154 views

OTP with fixed plaintext

I have just learned about the OTP, how it uses XOR, and how it's secure if the keys are random. But what will happen when the same plaintext is used again with a new key? $c_1 = k_1 ⊕ p$ $c_2 = k_2 ...
-1
votes
2answers
908 views

How to find the key of XOR encryption in Java?

I am trying to find the key of an XOR-encrypted string in Java. It is very probable that the key is eight characters long. I have the encrypted string. I do not understand how to go backwards and ...

1
2 3 4 5