I am working on a topic in cryptography where I have tried to develop an encryption scheme.
- How could I prove mathematically that my algorithm is secure against chosen plaintext attacks?.
- Will it be sufficient to say that as my algorithm is uniformly distributed, it is secure against chosen plaintext attacks?