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

learn more… | top users | synonyms

2
votes
0answers
38 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
0answers
87 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 ...
1
vote
0answers
96 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
50 views

Encryption with a known plaintext

I'm building an application where users can be a part of groups, and can obtain and distribute URLs from the group page that allow anyone who clicks on them to join said group. Groups should not ...