Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs

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
1 answer
90 views

Is it possible to break a DSA with k that increases statically?

I am currently studying cryptography. I came across this problem: I had an exercise that as a vulnerability had that k is generated every 10 seconds: ...
9 votes
2 answers
21k views

Breaking ZIP 2.0 encryption without password

I have an old sourcecode backup from my DOS days stored in a ZIP 2.0 encrypted archive, but I lost the password. The password was written on a paper slip, but I remember that it consisted of 30+ ...
0 votes
0 answers
65 views

Is known plaintext on Zipcrypto still possible using BK94 algorithm?

In my recent tests both pkcrack and bkcrack are no longer working, maybe it's my PC. I have zipped pkcrack.exe and chose compression level as store on both ...
1 vote
1 answer
61 views

Is it impossible to improve plaintext attack on Zip crypto in trade of memory vs plaintext bytes requirement?

BKcrack and BK94 states that a minimum of 12 bytes plaintext is required to perform the attack but that was more than 20 years ago, even Michael Stay's improvement is not utilizing modern resources ...
1 vote
2 answers
336 views

Encrypting random IV in CTR mode (no nonce!)

Use of plain random-IV's in CTR mode, without any special "nonces/counters" (or any "dedicated" bits!), can lead to problems with "partial overlaps", whereby attackers ...
0 votes
1 answer
209 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 ...
6 votes
1 answer
273 views

A modern rotor machine, could it be any safe?

I wonder if a rotor machine similar to enigma can be considered secure by today's standards under four conditions: A rotor machine which consists of 50 rotors picked out of a set of 100. A rotor ...
5 votes
1 answer
349 views

How to recover ring settings for the slow and the middle rotors on Enigma Checking Machine?

Summary: The operation of the Enigma Bombe is well documented. I manage to use it and a candidate checking machine to recover the plugboard pairs and the ring setting for the fast rotor. I struggle to ...
0 votes
1 answer
53 views

Using plaintext + ciphertext combination as substitute for authentication/signature in elliptic curve cryptography

I'm working on a system where I need to sign some data using an ECC private key and share the data and signature over a BLE ADV packet. Since an ADV packet is limited in space, I can't use a full ...
2 votes
0 answers
38 views

How many ciphertexts should attacker intercepts if he only knows the first 3 bytes of plaintext of each one?

Consider a system in which DES is used to encrypt messages in which the first three plaintext Bytes are known by the attacker. How many encrypted messages is it necessary to intercept in order to be ...
1 vote
1 answer
143 views

DES attack with known partial plaintext

Consider a system where DES is used to encrypt HTTP GET requests. The first three bytes correspond to the character sequence "GET". How many encrypted messages is it necessary to intercept ...
6 votes
2 answers
454 views

What were Alan Turing and their team searching before doing KPA in the movie "The imitation game"?

I just watched the movie "The imitation game" (2014) which is based on Alan Turing's biography. At some point in the movie the machine built by Turing wasn't fast enough to decrypt the ...
1 vote
0 answers
69 views

Non-uniform plaintext distribution -- AES attack

Are their any attacks on AES (any mode) in which before the attack is mounted, the adversary is aware that the input distribution is non-uniform? Most of the work assume that the plaintext is ...
0 votes
2 answers
58 views

Attack on AES/DES [duplicate]

Can we devise an attack on AES or DES (ECB mode) if we know just the distribution for the plaintext? For example, it is a English plain text -- we know what that would look like and the relative ...
2 votes
0 answers
71 views

1st round attack on rc4

I'm trying to implement the 1st round attack on RC4 stream cipher according to Attacks on the RC4 stream cipher. For now I am interested in section 4.2 Attack on other key bytes. It works really fine ...
1 vote
0 answers
150 views

AES-CBC-MAC forgery attack

I have a CBC-MAC scheme using AES as the block cipher (T=H_K1(M)), which gives me a tag and a stream cipher using another key and a nonce, which gives me a cryptotext (C=E_K2(N,M)). So my question is ...
1 vote
1 answer
603 views

Why is ECB mode unsafe if the key is kept secret?

this is my first post so I apologise if the formatting of my post isn't perfect. I should start off by saying that this post is not for any malicious intent, rather for curiosity and understanding AES ...
1 vote
0 answers
235 views

Determining the initial positions of Engima's rotors

We want to perform a known plaintext attack on the enigma M3, the goal is to reach the initial settings of the 3 rotors. I tried to bruteforce those values since I know the plaintext, ciphertext, ...
2 votes
1 answer
142 views

Clarification on expected number of plaintext, ciphertext pairs needed to identify AES keys

I'm aware of the many questions on this topic, but I'm still not sure what went wrong with my reasoning here below. I'm assuming use of AES with key size $2^{256}$ and messages of size $2^{128}$, ...
1 vote
1 answer
156 views

Clarification regarding Rabin Cryptosystem being CPA (Chosen Plaintext Attack) secure

Do I understand correctly that the textbook Rabin encryption scheme, where there is no random padding (as is also required in RSA for it to be CPA secure), is not CPA secure? (it is deterministic ...
3 votes
1 answer
774 views

AES with a different implementation of byte substitution step

I have tried to answer this question for quite some time now. But a complete intuitive understanding still eludes me: suggested a new implementation for AES: The byte substitution step will be ...
1 vote
1 answer
321 views

AES-128-CFB repeated IV and KPA

I'm doing reverse-engineering a product and identified a critical issue with it. The work is done and the developer was notified, but for my own personal curiosity, I'd like to learn how to exploit it ...
12 votes
1 answer
5k views

Sending KCV (key check value) with cipher text

I was wondering why it is not more common to send the KCV of a secret key together with the cipher text. I see many systems that send cipher text and properly prepend the IV to e.g. a CBC mode ...
0 votes
0 answers
292 views

Attack against stream cipher (LFSR with ASCII)

I'm reading Understanding Cryptography by Christof Paar and Jan Pelzl. In chapter 2 (Stream Ciphers) there's a question that goes like this: Assume we have a stream cipher whose period is quite short....
0 votes
1 answer
124 views

Do attackers need to know what ciphers are being used when conducting ciphertext-only, known plaintext, chosen plaintext, and chosen ciphertext attack

I am trying to understand the basic ingredients needed to conduct various types of cryptanalytical attacks. For instance, I understand that for Ciphertext-Only Attacks (COA) an attacker only has ...
1 vote
1 answer
758 views

Is AES GCM without GMAC vulnerable against known plaintext attack?

Is AES GCM without GMAC vulnerable against bit-flip attacks? Let's assume the plaintext is known for some reason (e.g. it can be guessed). In my opinion, I can flip bits in the ciphered blocks and can ...
5 votes
2 answers
31k 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: ...
33 votes
1 answer
10k 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-* ...
1 vote
1 answer
824 views

KPA-Security definition

In cryptography there are 4 basic attack classifications: Ciphertext-Only Attack Known-Plaintext Attack Chosen-Plaintext Attack Chosen-Ciphertext Attack In Katz & Lindell's textbook (2nd edition)...
8 votes
3 answers
4k 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 ...
3 votes
1 answer
589 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
1 answer
48 views

Is it allowable to put a restriction on the length of the plaintext used in the known-plaintext attack?

The definition of the known-plaintext attack: I have a plaintext and I can encrypt it to have its ciphertext, then I use this pair to break the cipher. The question: The only thing I further assume is ...
0 votes
1 answer
702 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 ...
11 votes
4 answers
2k 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 ...
4 votes
1 answer
695 views

Number of plaintext–ciphertext pairs needed to rule out false keys with a reasonable likelihood in AES

I am new to cryptography and I've got the following question from Understanding Cryptography: Imagine that aliens — rather than abducting earthlings and performing strange experiments on them — drop a ...
3 votes
2 answers
1k views

JSON AES-128: Security against known plaintext attack

I have a system where I am transmitting JSON messages securely (using for example AES-128), where each message has the same format. For example: ...
1 vote
2 answers
566 views

Known Plaintext attacks using standard greetings etc

In all modern ciphers, even if one bit of input changes, then half of the output will change because of diffusion. Considering this, how exactly will knowing standard salutations, etc. ("Hello ...
0 votes
0 answers
296 views

Known Plain Text Attack DES-OFB on Crack.sh

I am trying to do a known plaintext attack on DES-OFB through crack.sh. I have been having trouble lately. I keep getting blank text file back with no keys returned. Does anybody know if DES-OFB is ...
0 votes
0 answers
518 views

Known plaintext attack on AES with CBC

Assume I have a plaintext and a ciphertext, encrypted using some key and AES with CBC mode. I don't have a service, that I can send something to, so I can't use the Padding Oracle attack. Are there ...
0 votes
0 answers
36 views

How to falsify RSA signature with known message [duplicate]

I have a question about the RSA signature. Let's say Alice has $(d,n)$ as the private key and $(e,n)$ as the public key. In order to sign a message $m$, Alice computes $y = m^d \bmod n$ and sends $(m,...
3 votes
1 answer
275 views

Combining CTR and ECB modes to prevent attacks

In Reusing AES-CTR Keys and IVs for File Encryption, the OP was asking about a composite encryption scheme $$C_i = E_K\left(P_i \oplus E_K\left(IV + i\right)\right)$$ which is basically just a CTR ...
0 votes
1 answer
811 views

Consequences of AES-GCM always encrypting the same plaintext

I am analysing an authentication protocol. In this protocol AES-GCM is used to encrypt part of the messages. Regarding the authentication protocol, I made the following observations: The plaintext ...
0 votes
0 answers
534 views

How to perform a known plaintext attack?

I have got the following documents: (1) The plaintext (2) The ciphertext (3) The python program used to encrypt/decrypt the text My goal is to find the key that was used to encrypt the plaintext into ...
3 votes
1 answer
170 views

How much information do I leak if I upload multiple ciphertexts with cleartext overlaps?

Suppose that $t_1, t_2, \ldots, t_n$ are my clear texts. Suppose that for any $(i,j) \in \{1,2,\ldots,n\}^2$, $t_i$ and $t_j$ only differ in, say, the 1st $m$-many characters. Finally, suppose that I ...
0 votes
1 answer
151 views

Safety of encryption when knowing part of the content [duplicate]

I want to encrypt a JSON file while exposing its interface (the name of the object fields) in clear text. Since this exposes part of the content of the file, my guess is that an attacker could use ...
2 votes
2 answers
139 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 ...
6 votes
1 answer
330 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 ...
0 votes
0 answers
91 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
2 answers
84 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 ...
2 votes
1 answer
336 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
2 3 4 5