In this discourse, I introduce the reader to the concept of Chosen-Plaintext Attacks, by first defining them and then introducing to some of the properties of encryption schemes secure against Chosen-Plaintext attacks. I then introduce the concept of pseudorandom functions and try to show, how pseudorandom functions or permutations help understanding CPA-security.
The discourse ends with constructing a CPA-secure encryption scheme based on pseudorandom permutations and a proposition that proves its correctness.
- Quote paper
- Matthias Himmelmann (Author), 2016, Security against Chosen-Plaintext Attacks, Munich, GRIN Verlag, https://www.hausarbeiten.de/document/351992
Look inside the ebook
