Questions tagged [known-plaintext-attack]

The attacker knows at least one sample of both the plain text and the cipher text.

Filter by
Sorted by
Tagged with
1
vote
0answers
64 views

Question on recovering a key in the algorithm

Let $E$ be a block cipher that has block size and key size both equal to 64 bits. Let $E'$ be a block cipher that has 64-bit block size and is defined as follows: For a 128 bits key $K \mathbin\Vert ...
1
vote
2answers
139 views

Multiple XML files and known-plaintext attack

I have created an app which collects data in sets which may contain up to 20000 XML files of an average size of about 5 KB, and all with the same header and XML structure, so that only the data they ...
2
votes
0answers
114 views

Known Plaintext Attack A5/2

I am trying to understand the non-optimized known plaintext attack on A5/2 from Barkan, Bikan and Keller. I don't understand the construction of the equation system: $$S_{R4_1} * S_1 = k$$ Where $S$ ...
2
votes
2answers
3k 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 <...
4
votes
2answers
723 views

Why does DESX break if one removed post whitening?

DESX uses whitening to strengthen against brute force attacks. What is an attack one could use to recover DESX's pre-whitening key with only two known ciphertext/plaintext pairs, given that the ...
1
vote
0answers
681 views

Known plaintext attack against Feistel ciphers

Assuming we have a Feistel cipher, with let's say 2 rounds i.e: Plaintext $P=(L_{0},R_{0})$ $L_{1}=R_{0}$ $R_{1}=L_{0}\oplus f_{{K}_{1}}(R_{0})$ $L_{2}=R_{1}$ $R_{2}=L_{1}\oplus f_{{K}_{2}}(R_{1})...
1
vote
1answer
59 views

While encrypting what can happen between words

From some time I am working with "pen and paper" encrypted text. Keys are not known, algorithm is not known. I managed to find simple algorithm and key that seems to be nearly perfect. Nearly perfect ...
0
votes
1answer
185 views

Whats the most secure way to encrypt a string without the use of a computer? [duplicate]

I want to decrease attack surface by preventing the plaintext string or encryption key from ever being typed or otherwise entered into a computer. Ideally the decryption key would be something that ...
2
votes
1answer
5k views

AES-ECB known ciphertext/plaintext attack

i'm new to crypto and am working on a little exercise to understand the weakness of ECB mode encryption. Here is the scenario. I have the plain text ...
1
vote
1answer
518 views

Is my XTEA encryption key safe if I publish my firmware both as plain text and encrypted?

I'm using this bootloader that implements XTEA encryption for uploading an encrypted firmware to small MCU: https://github.com/nyholku/diolan-plus2 the actual XTEA code is here: https://github.com/...
1
vote
2answers
4k views

Brute force, get AES keys by multiple plain-texts with their cipher-texts

I know that the encryption is AES, and I have multiple plain-texts with their cipher-texts, I don't know the encryption mode (ECB, CFB, etc ...) actually, but I know that the keys and the IV Key (if ...
-1
votes
1answer
127 views

Preventing predictable modifications to AES encrypted data

I'm fairly new to cryptography and am trying to find out best practice for this situation. Let's say I have some code which is going to be used to pass around an encrypted e-mail address. I encrypt it ...
0
votes
2answers
917 views

Recover key given partial key, IV and cipher text using CBC mode

Given a known IV and a small part of the key (not enough to use brute force) is there are any way to break CBC encryption with only one cipher text?
2
votes
2answers
2k views

AES-CBC-128 Known plain, IV, Cipher attack

Let's say we have a single char 'A' and we encrypted it as much times as we want with a fixed Key and a random IV So now we have list of the IVs used, the result ciphers and ofc the known text "A" ...
0
votes
1answer
12k views

RC4, finding key if we know plain text and ciphertext [duplicate]

Having plain text A , and cipher text B. Can we somehow retrieve key , when we want to decrypt text C which was also crypted with the same key?
3
votes
1answer
337 views

Security of a cryptosystem where the encryption is swapped with decryption

For any given one-key cipher $(M,C,K,E_k,D_k)$, we may modify it into $(M,C,K,D_k,E_k)$. In other words, we swap the encryption function with the decryption in the modified cipher. Are the two ...
1
vote
0answers
417 views

Encryption with both plaintext and ciphertext public

Does there exist a system wherein the encryption key/algorithm can be made indecipherable despite making arbitrarily many plaintext and ciphertext pairs available to the cracker? (Does this qualify as ...
19
votes
1answer
4k views

What do the signature security abbreviations like EUF-CMA mean?

From time to time, one stumbles across formal security definitions. This includes security definitions for signature schemes. The most common ones are the *UF-* ...
5
votes
2answers
458 views

Affine plaintext attack with GCD != 1

I'm trying to crack an affine cipher, but when cracking I cannot find the inverse of a number because the GCD is not 1. This is my plaintext and this is my ciphertext: ...
1
vote
0answers
285 views

Affine cipher finding the decryption map

Given two letters of the plaintext 'ZP' corresponding to the ciphertext 'AE' respectively, I have found the key to be (a,b)=(10,10) (modulo 26). Therefore the decryption map $D(x)=a^{-1}(x-a)\bmod26$ ...
2
votes
1answer
801 views

Encrypting decimal values with AES

I have a column in a database table called "Amount" that will store decimal values encrypted with AES. It's highly likely that the same amount will exist in multiple rows in the table and be encrypted ...
4
votes
1answer
5k views

Hill's Cipher - Known Plaintext Attack

I know this question has already been asked few times but I'm struggling a bit on a problem. I have a plaintext FRIDAY and its ciphertext PQCFKU, using $M = 2$, with corresponding integers $x = fr ...
2
votes
0answers
165 views

AES-128: How to find cipherkey comparing wrong and right ciphertexts?

I have a .mat file which contains 10 plaintexts and 10 ciphertexts which are correctly encrypted with AES-128 algorithm. It also contains 10 more ciphertexts which are wrongly encrypted. The fault is ...
3
votes
2answers
1k views

How to defend AES against chosen-plaintext attack?

I have a server which encrypts files with the same AES key. Users can upload a file and download its encrypted version. A user can upload as many files as he wants. Users can decrypt the documents via ...
0
votes
2answers
2k views

What's wrong with RSA and OpenSSL?

We all know that signing a document is to encrypt its hash using signer's private key. https://commons.wikimedia.org/wiki/File:Digital_Signature_diagram.svg I've been searching the web for days, ...
1
vote
1answer
1k views

Counter Mode Known plain text attacks

Counter mode uses a counter that is incremented for each block. Doesnt predictability of this counter expose the scheme to attack? I mean if you are incrementing some nonce, then I have a good chance ...
2
votes
1answer
208 views

Can encrypting well known files hurt the security of the key?

I wanted to know if mass encrypting files (both well known and not so well known) on my external HDD would somehow hurt the security of my private key. As for the details: I am using GPG with a key ...
1
vote
2answers
620 views

Does having a bunch of plaintext/ciphertext pairs help you break a ciphertext with unknown plaintext?

Let say we have $N$ ciphertexts and each of them looks like this: ...
13
votes
4answers
6k views

Why is a known-plaintext attack considered a complete break?

I read somewhere that if a cipher has a known-plaintext attack, then it is considered completely broken. Say there is a cipher that someone uses where the algorithm is understood and a known-...
4
votes
1answer
516 views

Do all ciphers have equivalent decryption keys?

Do all ciphers suffer from the problem of multiple equivalent decryption keys? Is the existence of equivalent keys an essential property for the security of a cipher? If you could prove that a cipher ...
2
votes
1answer
342 views

Is predictable ciphertext/plaintext bad?

I have a cryptosystem that I'm using for secure chat. It is using AES 256 (with RSA 2048 for key exchange). Would a predictable, and repetitively sent ciphertext plaintext compromise the ...
4
votes
2answers
22k views

How to find the keyword of the Playfair cipher, given the plaintext and the ciphertext?

I know how the Playfair cipher works. I would like to know how to find the keyword of the Playfair cipher, given some ciphertext and the corresponding plaintext. For example: encrypted: ...
2
votes
3answers
475 views

Can an adversary distinguish a private key from a pseudo-random string of the same length?

Apologies if this is a dumb question but allow me to describe the dilemma I have: Suppose that I am protecting a private key on a device using a password & PBKDF2. The obvious attack would be an ...
3
votes
1answer
149 views

Known Plaintext Attack against 3-round SPECK48/96

I am attempting to break 3-round SPECK48/96 using a known-plaintext attack, provided with 10 PT-CT pairs. Here is a diagram: I have seemed to almost figure this out, but I cannot figure out how the ...
5
votes
1answer
154 views

Could a strong round function be immune to slide attacks

An excerpt from the wikipedia article on slide attacks states: ...The only requirements for a slide attack to work on a cipher is that it can be broken down into multiple rounds of an identical F ...
1
vote
1answer
58 views

How many bits of plaintext are required to verify a stream cipher key?

If a stream cipher has an $n$-bit internal state, how many bits of known plaintext are required to confirm that particular key is the key? I believe that the answer is at least $n$-bit's of plaintext....
9
votes
3answers
218 views

Would adding daily changing nulls in front of their messages have made the Engima harder to crack?

The British decrypted the German enigma because they knew that they would repeat the message key twice at the start of every message. Of course, technology to encrypt enigma without the repetition ...
0
votes
2answers
352 views

Can an AES-256 key be generated for a large number of cribs? [duplicate]

I have a question in regards to Ransomware type viruses. I know that a number of these viruses use the AES-256 algorithm to encrypt user's files using a randomly generated key. I work in IT support ...
2
votes
1answer
767 views

Understanding ransomware – What makes plain-text-attacks or brute-forcing so hard?

Say I have four files. Two are completely unencrypted, while the other two are the exact same files other than that they have been encrypted with (apparently) the same public key (via a ransomware ...
2
votes
0answers
75 views

Recover secret $x$ when $c\equiv m^x \pmod p$ with public $p$ (modified)

Given an encryption system where $c\equiv m^x \pmod p$, $p$ is a known prime, 1. Is it possible to recover $x$ with a known plaintext attack? Given $(p,\text{factorization of }\varphi(p),m,c)$ 2. Is ...
2
votes
1answer
815 views

Attack on textbook RSA with small messages

We learned in class that if Alice wants to send a small message $m$, such that $m < N^{\frac{1}{e}}$, so we can break the system using $e$-th square of $m^e$. But what if Alice knows this flaw and ...
1
vote
0answers
786 views

Obtain Enigma key having a encrypted text and the plain text

I have an Enigma message and I know what the original message is (a repetition of the same letter). Is it possible obtain the enigma key? I only know what kind of Enigma machine is it, but I need to ...
1
vote
0answers
383 views

Carrying out a known-plaintext attack on a cipher [closed]

Previously posted here. Someone suggested I could post it here to get some answers. I am trying to solve a CTF challenge, here. Basically we're given message and key inputs to a cipher and its ...
4
votes
1answer
287 views

Fixed-points in block ciphers; why don't they indicate a vulnerability?

I've seen a few questions here on fixed-points in ciphers, most asking about the possibility and existence. Most of the answers however pointed out that fixed points are not exactly a security threat. ...
5
votes
1answer
2k views

Using same modulus for RSA

I know that there exist some attack when using same modulus. Can two different pairs of RSA key have the same modulus? RSA cracking: The same message is sent to two different people problem But ...
0
votes
1answer
101 views

Request for review: known plaintext mitigation by rotation and xor encoding

When using structured data inside a plaintext (such as gzip headers, xml, etc.) they generate known plaintext which may be useful in cracking the ciphertext. So I had these two ideas on how to make ...
2
votes
1answer
751 views

Finding keys of modified DES encryption

This is a question I had in my exam today, and I'll be glad if someone can help me to find the answer. A student built an encryption algorithm (something between DES and 3DES), in which the ...
4
votes
2answers
1k views

Determine AES key given encrypted and unencrypted files

Given an encrypted file, the original unencrypted (cleartext) file, and knowledge of which AES encryption algorithm was used, is it possible to determine the key that was used to encrypt the data in a ...
3
votes
4answers
558 views

One time pad in CBC mode?

I have been searching about if it is more secure to use CBC mode in OTP but I can't find anywhere where people have sad that it is more secure. Question: Is CBC mode in OTP more secure? Because I ...
3
votes
0answers
558 views

Avoiding known plaintext attacks with an additional XOR-Layer

Can a cipher that is vulnerable to an known plaintext attack be made secure by adding an additional XOR-encryption? That is: suppose I have an (w.l.o.g. symmetric) encryption algorithm E were the ...