Affine Cipher - please help!!!
Posted in the Cryptography Forum
#1 Nov 22, 2012
in the case where the arbitary constant p (the one we use for the encrypt function i.e. ek(m) ≡ k1 ⋅m + k2 (mod p) and decrypt function i.e. dk(c) ≡ k1′ ⋅ (c − k2)(mod p)) is not publicly known, is the affine cipher vulnerable to a chosen plaintext attack? If so, how many pairs of plaintext - ciphertext is needed for the attacker to find the key????
Add your comments below
|Help - Crazy Cipher||Feb 18||InBetweenHonor||1|
|Is this a real secuirty concern?||Feb 13||nawas||1|
|LYRA 2 or sponge constructor||Feb 11||golda||1|
|Vigenere Cipher Expansion||Feb 10||cusar2||1|
|Can anyone decipher this?||Feb 7||GHF||1|
|It is possible to decrypt ransomware manualy?||Feb 3||JoshMa88||1|
|Unable to crack||Jan 28||Shumpy||1|
Find what you want!
Search Cryptography Forum Now
Copyright © 2017 Topix LLC