Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Assuming that Elgamal is used as an encryption cipher, where lets say $p$ is 2048bit prime. Is it possible for an attacker to figure out $x$, a secret key, if any part of 2048 bits ciphertext and plaintext pair is known. Or the pattern of remaining ciphertext.

Would it be prevent if RSA is used instead ? (let's assume no padding is used for diffusion)

share|improve this question
Consider this: You send an email to a friend. You know the cipher and plain text, and also the public key. So the answer is no, unless I misunderstood part of your question. Cheers –  rath Feb 14 at 18:45
add comment

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.