Score:0

Is multiple encryption with XORs between each encryption operation susceptible to meet-in-the-middle attacks?

pf flag

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 and XOR a third random block. It would be XOR->Encrypt->XOR->Encrypt->XOR.

/\ Is this scheme vulnerable to Meet-in-the-middle attacks or another kind of attack?

I received an answer in another question saying that a XORed block with an IV when encrypted twice increase security to [block size] * [key size], that's why I'm asking this question.

kelalaka avatar
in flag
It is not clear where are you heading and what is your aim? What do you want to achieve? Are you looking for securing your disk encryption? This you see XEX, XTS? How the x-ored random blocks are stored per encryption?
phantomcraft avatar
pf flag
@kelalaka I'm planning to write a disk encryption program in the future that will use large keys up to 32768-bits.. I know that this scheme looks like XEX/XTS. This program I'm planning to write will use raw keys and it will be responsibility of the user in keeping them safe. Maybe you think I'm crazy, but i don't care. =)
phantomcraft avatar
pf flag
@kelalaka I would appreciate if you answer my question.
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.