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
2
votes
2answers
82 views

Construction of a “simple”, nothing-up-my-sleeves, provably KPA resistant symmetric cipher

Why is AES secure? Apparently there is no answer - Why is AES resistant to known-plaintext attacks?. With this in mind, one would obviously want a cipher that is mathematically provable to be ...
0
votes
0answers
79 views

RNG to hide some bits

Suppose I have a sequence of bits of length M. I need to hide N out of M bits (hiding means forcing them to be 0) using RNG with a key. How I can relate the output of RNG to the number and positions ...
0
votes
0answers
32 views

What kind of approach can I use to reverse the following encryption scheme?

I'm trying to reverse an encryption scheme without success. I have several pairs of ciphertext + plaintext and found the encryption method to be something like this: ...
0
votes
0answers
15 views

Generating RSA keys with plain and ciphertext [duplicate]

I have plaintext and ciphertext. Is it possible to generate an RSA key pair that encrypts the plaintext to ciphertext and decrypts ciphertext to plaintext. I don't need to find the original key pair ...
1
vote
0answers
35 views

Memory required for known plaintext attack on general block cipher

Consider a block cipher on binary strings of length $k$ and keys which can be any binary string of length $n$. With $k2^n+k$ memory we can store all key/ciphertext pairs for a fixed plaintext and this ...
0
votes
2answers
60 views

would this be classed as a cipher text attack?

Say i'm given a cipher text to decrypt, however i also have access to a server that performed the encryption; where i could enter any plaintext and observe the result of encryption. would it be ...
7
votes
2answers
204 views

One round of AES-128

Maybe it’s a silly question, I’m interested in the best known/chosen plaintext attack on only one round of AES-128. More specifically, what is the smallest number of known/chosen plaintext/ciphertext ...
2
votes
1answer
56 views

Is it possible to perform CPA(Correlation Power Analysis) when attacker has only specific round's waveform?

I read Quite a lot document about breaking AES using CPA. But most of them, assuming that attacker has the first or last round of the waveform(trace) and exploit SubBytes. My question is if the AES-...
1
vote
1answer
36 views

Is it safe to distribute different portions of the same data encrypted with different AES keys?

Assume I have a block of data consisting of three segments A, B and C. With "segments" I mean a particular section of a bit stream, so if the whole binary data was simply ...
5
votes
2answers
150 views

Is the ChaCha20 block function reversible using known plaintext?

I've been recently implementing the chacha20 stream cipher with Poly1305. As the core operations which make up the Quarter Round of chacha20 (ARX - Addition Rotation Xor) are indeed reversible, does ...
2
votes
1answer
136 views

How does one conduct a known-plaintext attack on an algorithm?

My question is two-fold: Say I am given a total black box and I have n number of plaintexts as inputs that map directly to $n$-number of ciphertexts as outputs. This is all I know, and I do not have ...
3
votes
1answer
156 views

How to secure Elliptic Curve ElGamal encryption against known plaintext attacks?

If I have an encoding function $f(x)$ that maps a message $m$ to a point $P$ on a suitable Elliptic Curve $E$ . If I have the public key $Q$ of my recepient then I can encrypt the message as follows: ...
0
votes
1answer
95 views

Recognizing and decrypting custom cipher with known plaintext and ciphertext

I've been trying to reconstruct an encryption algorithm that produces a known ciphertext from a know plaintext. I have done some analysis: the algorithm operates on single bytes a plain text can be ...
1
vote
0answers
28 views

Known plain-text attack on Kerberos

This is a form of the Kerberos protocol I have two questions. Why does this protocol give the opportunity of a known plain-text attack because of no authentication of Joe? And how would an attacker ...
3
votes
0answers
135 views

Why are cyclic keys in Feistel Networks insecure?

So everyone seems to agree that recurring round keys in a Feistel network (eg. using the same key for every round) are a massive security leak. When researching this, the only thing I found is the ...
1
vote
1answer
137 views

XChacha20poly1305 vulnerability to known plaintext attacks

During a security audit, the guy said our cryptosystem is vulnerable to known-plaintext attacks. He said that's because «the implementation uses a crypto_stream_xor() approach» (from libsodium). That'...
1
vote
1answer
60 views

Is it possible to narrow down the possible keys used for AES CBC encryption, knowing a given plaintext and its ciphertext, where IV=0? [duplicate]

I'm brute forcing a ciphertext with a given dictionary to figure out which key was used. However, it's been hinted at that there is a way to narrow down the dictionary to a smaller subset of ...
2
votes
0answers
252 views

Known Plain-text Attack [closed]

How can I find the known plain text P2 based on the given information? Assuming that the encryption is made using a common initialization vector and the mode used for encryption is OFB. ...
2
votes
0answers
75 views

Encrypted ZIP and plain text attack [duplicate]

I have a Zip archive containing a single password-protected file file.txt. The encryption is "ZIP 2.0 Default Encryption" (ZipCrypto). I know what kind of text (...
3
votes
1answer
141 views

Why is the Domingo-Ferrer cryptosystem not used in practice?

The Domingo-Ferrer cryptosystem is a fully homomorphic cryptosystem. It works fast enough. I have only seen known-plaintext attacks. Is this a reason not to use it in practice? Or are there more ...
2
votes
0answers
48 views

Known-plaintext attack against E0 with 2745 bits per frame instead of 24

In the paper The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption, an attack against the E0 cipher is described which can break it efficiently in a known-plaintext attack: ...
1
vote
1answer
79 views

Cipher recommendation for known-plaintext attack

I need to encrypt a 4-digit number. The cipher-text can be up to 11 digits long and there are no limits for the key size. Considering that the attacker has access to both the cipher-text and the ...
0
votes
0answers
33 views

What are some best practices to handle user password in shell script and environment variables?

I'm new to this community. Currently im working on a project which involves handling user password in shell script. Following steps describe my password consumption flow: Get password from user ...
2
votes
1answer
180 views

How many required known plaintexts for an attack are considered insecure?

I stumbled over this problem when looking at symmetrical block ciphers with a relatively small block size like 32 bit. When I was looking at more common block ciphers with a 64 bit, I learned that ...
2
votes
1answer
261 views

Hill cipher: How to find an unknown key of unknown size

How would you tackle the problem of finding the key (you don't know the length) to a Hill cipher when knowing only one 12-letter word of plaintext and its corresponding ciphertext? CONVERSATION has ...
0
votes
0answers
57 views

Unique numbers with $P^aQ^bR^c \mod N$ for each combination of $a,b,c$ possible? Would it be safer than separate form (like $T^a \mod P$ for each)?

Main question: Is the computation of $a,b,c$ in $P^aQ^bR^c \mod N$ (much) harder than in $T_p^a \mod P$, $T_q^b \mod Q$, $T_r^c \mod R$ ? (assuming the first form exists) $P^aQ^bR^c \mod N$ With $P^...
0
votes
1answer
46 views

How much more secure is $c = mg_1^r + g_2(g_1(g_1^r-1)/(g_1-1)) \mod p$ compared to just $c = mg_1^r \mod p$ (dis. log), all known but $r$?

To encode a message $m$ to a cipher $c$ you can use the only hard solvable problem of computing the discrete logarithm with a generator $g$ in base over a prime $p$. $c = mg_1^r$ mod p If an ...
1
vote
1answer
121 views

IV Re-use and Chosen Plaintext against 56bit Blowfish (CBC)

I am looking at a very old protocol which uses Blowfish to encrypt packets with a constant 8-byte IV in CBC mode. Assuming I have: The ability to arbitrary encrypt known plaintexts The IV I know ...
0
votes
1answer
276 views

how to compute IV with AES CTR if key, plaintext and ciphertext are known?

Given $E_k$, which a block-cipher using the (known) key $k$, and a plaintext-ciphertext pair $(p,c)$ where $c$ is the encryption of $p$ using CTR mode, can the initialization vector be recovered using ...
0
votes
0answers
35 views

Is it necessary to study the KPA security for asymmetric encryption algorithms in addition to CPA security? [duplicate]

In a KPA attack model, an adversary $\mathcal{A}$ has access to pairs of messages $(m_i,c_i)$ which are encrypted using some asymmetric algorithm. However, assuming either El-Gamal or RSA algorithms, ...
1
vote
0answers
245 views

show that G' is not a secure PRG even if G is

Hello I'm trying to show that the function G'(s) = G(s) || G(G(s)) is not a secure PRG even if G is. My first question is that in this case, how do I know what G ...
2
votes
1answer
648 views

AES-CBC ciphertext manipulation with known IV and plaintext! [duplicate]

I'm currently practicing on a purposely flawed login page, where I have to change the value of a cookie to enter. The cookie is an encrypted and encoded form of a simple JSON string with fields "admin"...
2
votes
0answers
87 views

Is my deniable encryption scheme reasonable?

I was experimenting with RubberhoseFS, but since it is very hard to compile on anything modern, I decided to implement my own version, stripped of many unnecessary features. Namely, my implementation ...
7
votes
3answers
6k views

Is it possible to find the key for AES ECB if I have a list of plaintext and corresponding ciphertext?

Assume I have a list of plaintext text and its corresponding ciphertext which was created using a specific key with AES in ECB mode. Can I recover that key? If, how big does the list of plaintext ...
6
votes
1answer
189 views

On CPA & KPA security of $\boxplus$-Feistel

I am interested to identify the effect of replacing $\oplus$ with $\boxplus$ on basic balanced Feistel structures over $r$-rounds. Given: $F_\boxplus[L,R]= [S,T] = [R,L \boxplus f(R)]$ where $f$ is a ...
1
vote
1answer
743 views

Known Plaintext Attack for Modified OFB Mode of Operation

Question: Assume a variant of the OFB mode by which we only feedback the 8 most significant bits of the cipher output. We use AES and fill the remaining 120 input bits to the cipher with 0's: Why is ...
4
votes
1answer
1k views

Known Plaintext Attack on Block Cipher in ECB and CBC Modes of Operations

These 2 similar questions are from Paar's Understanding Cryptography. I could not see the answer so if someone can help I will appreciate: Question1: We consider known plaintext attacks on block ...
1
vote
1answer
145 views

Ethereum RLPx protocol for inter-node communication - flaws in the encryption

Ethereum uses RLPx/devp2p for inter-node communication. The protocol is encrypted using Elliptic Curve Integrated Encryption Scheme (see ref) Under Known-Issues I found this paragraph: The RLPx ...
1
vote
1answer
129 views

It's safe to store a known value (for checking) next to the actually encrypted values

The high level details of the encryption I'm using is: AndroidKeyStore create/store RSA key AES key is created and wrapped with RSA/ECB/PKCS1Padding Encrypted AES is saved to disk. Data is encrypted ...
2
votes
3answers
589 views

Known-plaintext attack on 1-round Feistel networks

Consider a simple, 1-round Feistel network. Because the ciphertext is essentially $(L_1,R_1)$, if one knows the plaintext $(L_0,R_0)$, the only unknown left is $K$. However round functions in ...
2
votes
1answer
197 views

Is Paillier secure from known plaintext attack for single character message?

Assuming I have three messages m1,m2,m3 where m1=m2=m3=1 and I compute c1,c2 and c3. Does that mean that c1=c2=c3 in cipher-text from ? If not, how many times can I encrypt a message m=1 and still ...
1
vote
0answers
29 views

Would it possible to decode an intelligible but alien message? [duplicate]

I've been reading some sci-fi and there is a frequent mention of decoding alien signals. From what i read historically in ww2 for decoding enemy message the allies would transmit fake information ...
1
vote
1answer
538 views

Clarification on Hill Cipher crib dragging technique

--- this has been edited as I realised the question was silly. replaced with helpful information --- I want to confirm the following: Given ciphertext "AGHTDIX... [cont.]" (C) and crib (a word ...
4
votes
1answer
237 views

Cracking truncated DES

Let's say we have a scheme in which 40 bits M are padded with 24 zeroes, encrypted using a secret DES key K, and the result truncated to the first 24 bits, C. If I wanted to determine a key that ...
3
votes
1answer
775 views

What's the difference between a known-plaintext attack and a ciphertext-only attack in terms of performance?

I know that in the KPA the attacker has access to both the plaintext and the ciphertext, but in the end it all comes down to performing an exhaustive key search. I'm not sure if having the ...
0
votes
1answer
477 views

8th SharifCTF — What is the advisable way to recover the key of single round DES here?

I am participating in the 8th SharifCTF competition and have a related question: I have 1000 plaintext and its ciphertext, which has been encrypted with DES algorithm (only 1 round). Now, how can ...
2
votes
2answers
135 views

If an attacker has a chosen-plaintext and encrypted data, can they determine the encryption type?

This question differs from How to determine what type of encoding/encryption has been used?, which asked about a ciphertext-only attack. This question is asking about a chosen-plaintext attack. Let's ...
0
votes
2answers
145 views

Reversability of Xor'd Values In Hash?

This may be a dumb question so please forgive me if so, but is a hash function considered one-way even if you have half of an xor'd value? For example say I have the values R and C, both are randomly ...
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 ...