1. Achieving Perfect Secrecy
Jorge Carrillo Ugalde

2. Symmetric cryptosystem.

3. Security Assumptions. Unconditional Computational Security. Security.
If the best known method of breaking the cryptosystem requires an unreasonably large amount of computer time.
If the cryptosystem can not be broken, even with infinite computational resources.

4. Sharing a random number.

5. Sharing a random number.

6. New cryptosystem: Definitions.

7. New cryptosystem: Encryption.

8. New Cryptosystem: Decryption.

9. New Cryptosystem: Visual representation.gk k
Approximation
Message

10. New One Time Pad: Definitions.

11. New One Time Pad: Making a partition.

12. New One time Pad: Encryption/Decryption.

13. New One Time Pad. Final step.

14. K O N E C