Skip to main content

Questions tagged [ciphertext-only-attack]

A cyphertext-only attack is a form of cryptographic attack in which the attacker possesses only the encrypted message, with no corresponding plain text or segment of the key to work with.

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

Fitness of Text Function, did I spot an error?

I am playing around with Enigma Encryption, and especially solving it piece-wise, like in https://www.youtube.com/watch?v=RzWB5jL5RX0 shown. The idea is, that the text gets clearer, if you get more ...
Ralf's user avatar
  • 181
3 votes
2 answers
97 views

Breaking a 'Many' - Time Pad [closed]

I'm working on a problem, where given 12 ciphertexts, I'm trying to decode the 12th and find out the key. I've implemented a crib dragging attack, where the crib is a purely guessed word (not known/...
k0redump's user avatar
2 votes
2 answers
127 views

Using the MAC to verify if Cipher Only attack has succeeded

I am working on an experiment to compare the efficiency of brute-force attacking block ciphers like AES and DES with reduced key sizes for different programming languages and library implementations. ...
Matt's user avatar
  • 21
0 votes
1 answer
126 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 ...
Leviel's user avatar
  • 3
0 votes
1 answer
230 views

Multiple COA-security (IND-EAV-Mult security) cipher

Be this the Experiment for multiple COA-security: $PrivK_{\mathcal{A},\Pi}^{mult}(n)$: $(m_0^1 , ... , m_0^t,m_1^1 , ... , m_1^t) \leftarrow \mathcal{A}(1^n), |m_0^i|=|m_1^i| \forall i \in [1,t]$ $...
Titanlord's user avatar
  • 2,327
0 votes
0 answers
250 views

Simple XOR cipher with pseudo random plain text of arbitrary length

We all know that simple repeated XOR cipher over plaintext is trivially vulnerable to known plaintext attack, even when just a part of plain text is known and even to ciphertext only attack if you ...
Manish Adhikari's user avatar
1 vote
2 answers
15k views

How to decrypt two images encrypted using XOR with the same key?

I am trying to solve the following puzzle from CryptoHack involving two images encrypted with the same key: I've hidden two cool images by XOR with the same secret key so you can't see them! lemur....
user93353's user avatar
  • 2,200
-1 votes
1 answer
141 views

Security of the OTP

In ciphertext only attack, if I assume that the ciphertext is obtained by an OTP, then for a short length of ciphertext I can search over a random keystream of the same length and discover a plaintext ...
Viren Sule's user avatar
0 votes
0 answers
111 views

Attack on Many Time Pad

I have 7 ciphertexts that have been XORed with the same key. I'm writing a program to figure out what the plaintexts are and possibly maybe recover the key. I have managed to convert the HEX ...
mahmoudalsof's user avatar
0 votes
2 answers
85 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 ...
hithere's user avatar
3 votes
1 answer
132 views

Identity Based Encryption: Known Random Value

Let's consider a situation whereby: Alice generates a ciphertext c from a message m using Bob’s ID. An attacker Carol can get c from the open channel. She knows that c is generated by using ...
Jeevan Pillay's user avatar
2 votes
1 answer
127 views

Running Key Gibbs Sampling

I am trying to implement the algorithm described in this paper. It uses blocked Gibbs sampling to perform a ciphertext-only attack on text encrypted with a running key cipher. However, I am confused ...
Woafer's user avatar
  • 21
0 votes
0 answers
580 views

Using same key twice with Vigenere cipher

Could someone please give a walkthrough of how this works: Decrypting a vigenere cipher with a reused one-time pad. It was never fully answered with the example given in the comment. e.g Plaintext ...
Mathew Slingsby's user avatar
1 vote
1 answer
1k views

Cryptoanalysis using Frequency Analysis

I have read some documents to decrypt ciphertext without a key using Frequency analysis. here are my questions: If the most occurring Char is not 'E' then how do we start? Let's say I have this ...
Awais Arshad's user avatar
0 votes
1 answer
124 views

Is it a cryptographic risk to share the same encrypted data over and over again?

Regular scenario Let's say I have secret files which I will encrypt. The resulting container will be shared and might be intercepted. Not good, but that's okay - that's why I encrypted the data in ...
finefoot's user avatar
  • 103
3 votes
1 answer
319 views

Basic Vigenere Cipher

I'm taking my first cryptography course and having trouble deciphering some Vigenere encrypted text. I was able to crack the first one: I'm having difficulty with the other two. I think the ...
vaspurakan's user avatar
5 votes
1 answer
971 views

Are ciphertext-only attacks on LFSRs possible?

Reading about LFSR, I know that breaking an LFSR by knowing it's design and having enough (plaintext, ciphertext) pairs is an relatively easy task but let's assume we know the design of LFSR and a ...
Mehran Torki's user avatar
3 votes
1 answer
1k 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 ...
Trey's user avatar
  • 189
1 vote
1 answer
10k views

How to solve encryption with ASCII output

There are lots of text files which have unknown data packets with ASCII output (no available plaintext exists with regard to any ciphertext, I have only encrypted outputs). The input data is known to ...
Mostapha O.'s user avatar
4 votes
2 answers
4k views

Textbook RSA Attacks

Given textbook RSA encryption, if an attacker obtains the ciphertext and has the public key that was used, can he or she decrypt said ciphertext without calculating the private key?
user avatar
14 votes
4 answers
7k 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-...
Danegraphics's user avatar
2 votes
1 answer
278 views

How to glean info from a message that simply has the letters shuffled?

Suppose someone had published a several hundred page (sensitive) book, but had randomized all of the letters in an order known only to them (e.g. with a vector of random numbers of the same length as ...
dcc310's user avatar
  • 273
1 vote
3 answers
634 views

Any benefit to writing a message as a mix of 2 languages before encryption?

For example, imagine a message that is a mix of Japanese and English words; Japanese in unicode, English in ASCII. Japanese doesn't use spaces between words. The sentence structures, anything ...
Just Someone's user avatar
3 votes
1 answer
5k views

Reversing a known encryption algorithm (4-byte repeating key XOR)

I've been practicing for an upcoming CTF competition, and I've finally reached the cryptography stage. I'm a complete newbie in this field (my knowledge is essentially that bcrypt is awesome and md5 ...
Tom's user avatar
  • 133
4 votes
1 answer
3k views

How to attack polyalphabetic affine cipher with only ciphertext?

How to attack polyalphabetic affine cipher with only the ciphertext? A polyalphabetic affine cipher can be seen as the composition of an affine cipher ($p \mapsto c \equiv a \times p + b \pmod{26})$ ...
Retikulum's user avatar
2 votes
1 answer
668 views

Are the following schemes based on a pseudo-random permutation secure?

I am currently working on the following task: Let F be a pseudorandom permutation. Consider the encryption scheme for the message space $\{0, 1\}^n$ defined as follows: $Gen(1^n)$ chooses two random ...
Lemon's user avatar
  • 411
4 votes
2 answers
3k views

Given a pseudorandom function F, is $(F_k(r) \; | \; F_k(r + 1))$ also a PRF?

Given: F is a pseudorandom function, G is a pseudorandom generator with $l(n) = n+1$. The following schemes should be classified as being insecure, IND-COA secure, IND-CPA secure. To encrypt $m \in \{...
Lemon's user avatar
  • 411
1 vote
0 answers
549 views

What do you mean by Ciphertext indistinguishability [duplicate]

Wiki definition : A cryptosystem is considered secure in terms of indistinguishability if no adversary, given an encryption of a message randomly chosen from a two-element message space ...
python's user avatar
  • 151
3 votes
2 answers
552 views

Are parts of a pseudorandom string also a pseudorandom string?

I am working on an exercise that encrypts a message using only the first $n$ bits of a pseudorandom generator's output $G(k)$, i.e. $F_k(m) := G(k)_{0...n−1} \oplus m$. $k$ is chosen uniformly at ...
Lemon's user avatar
  • 411
4 votes
1 answer
1k views

Deciphering “easy” ciphers without hints

I've been keen on IT Security for a long time now and I've learned a lot about networking & security. However trying a "decryption challenge" I'm lacking what I think is basic encryption/...
UsuallyNot's user avatar
2 votes
1 answer
4k views

Shared modulus attack on RSA

Consider a scenario in which a group of people use a common modulus $n$ in the textbook RSA crypto system, where $n=pq$, $p$ and $q$ are large distinct prime numbers. Is there any chance for an ...
NinjaV's user avatar
  • 83
2 votes
2 answers
222 views

cipher text only attacks on deterministic homomorphic encryption schemes

If we consider a set of numbers say a set $s=\{a,b,c,d\}$ , where $a,b,c,d>1$ and the numbers $a, b, c, d$ do not share any relation between them , i.e. for any two numbers, $n_1,n_2\in s$ the ...
prakruti.c's user avatar
2 votes
0 answers
157 views

Correlation attack on Lagged Fibonacci Generator

Say that one uses a known LFG (2 known lags $a$ & $b$, known inner state length $N$, known modulo $m$) to hide some text with a basic à la Vigenère cipher: $C_i=(P_i + {PRNG}_i) \bmod 26$. Say ...
Peyre's user avatar
  • 131
1 vote
2 answers
428 views

AES key from encrypted text and IV

So I'm trying to figure out if it's possible to extract the private key if you have the ciphertext and the IV corresponding to that ciphertext. It's for some kind of a challenge, and can't really ...
mRKuolematon's user avatar
7 votes
2 answers
8k views

How does cryptanalysis of the Playfair cipher work?

I have a set of Playfair-enciphered data that I'm trying to crack without the key. I know I need to analyse bigrams; I've currently worked out what decrypts to th, <...
helpneeded123's user avatar
1 vote
1 answer
4k views

Known vs. Chosen (plaintext and ciphertext) and RSA

I want to know whether I can break RSA (textbook) with known plaintext/ciphertext attacks. Known plain-text Let $c$ be the ciphertext and $m$ the plaintext. $$c = m^a \mod n$$ Since all I have is ...
coder's user avatar
  • 13
1 vote
1 answer
158 views

Is knowing the distribution of input domain only way to do cipher text only attacks?

Imagine there is a $n$ bit block cipher. The attacker has harvested some how all possible $2^n$ cipher texts for some given key. Without the knowledge of the distribution of input domain as in ...
sashank's user avatar
  • 6,204
1 vote
2 answers
801 views

Is it possible to translate a piece of language into your own without knowing the language? [closed]

I understand the the texts within the Voynich Manuscript are of an unknown language, and yet cryptographers are still working on it and still trying to decipher it. Does that mean that it is possible ...
83457's user avatar
  • 119
4 votes
1 answer
1k views

Attacking historical ciphers methodology

It's more a theoretical question of how would you approach it. All you know about the ciphertext it's was generated with a historical cipher. The ciphertext appears to be random, BUT it's divided into ...
Adam's user avatar
  • 41
0 votes
1 answer
1k views

Ciphertext-only attack on Simplified DES

Is it possible to deduce the plaintext block or the key, given only a Simplified-DES ciphertext block (e.g. c=01110110)? I'm reading Cryptography And Network Security, by William Stallings and I'm bit ...
user avatar
21 votes
1 answer
36k views

How to attack a "many-time pad" based on what happens when an ASCII space is XORed with a letter?

I've already sent my correct solution to a homework exercise from Dan Boneh's Introduction to Cryptography class on Coursera: "Let us see what goes wrong when a stream cipher key is used more ...
sunrise's user avatar
  • 321
7 votes
2 answers
1k views

For public-key encryption, why does COA resistance imply CPA resistance?

My professor told me: If a public-key crypto-system is secure against ciphertext-only attacks, then it is also secure against a chosen-plaintext attack. Why is this true? Is there a proof that ...
Bobby S's user avatar
  • 1,963
11 votes
2 answers
3k views

Measuring entropy for a ciphertext only attack

When bruteforcing a password (e.g. the common attacks on DES), where you have ciphertext only, you need a way to assess whether a decrypted plaintext is the right one. I believe the EFF DES machine ...
S. Robert James's user avatar
4 votes
3 answers
726 views

Is this "layered" XOR cipher secure?

I am aware of the vulnerabilities of simple xor ciphers and recently I came across a block cipher that claims to solve those vulnerabilities. The cipher goes as follows with both the block and key ...
Chris Smith's user avatar
  • 1,192