Sebastia Agramunt-Puig

Nov 23, 2020

Discrete logarithm problem and Diffie-Hellman key exchange

In the previous post we learned what are ciphers and how can two parties establish a secure communication when they both hold the same secret key, for instance using a stream cipher. In this post we will see how they can agree on a common key through an insecure channel…

8 min read

Discrete logarithm problem and Diffie-Hellman key exchange

Oct 14, 2020

An introduction to secure communication

In this post we will see the most basic example for encrypting your messages, then we will show that this by no means is secure and finally we will introduce what it means to have a perfect secrecy scheme and why is not practical. Then, we’ll get to see what…

Cryptography

11 min read

Oct 8, 2020

Prime Numbers

Prime numbers are the building blocks of arithmetics. In this short post we will investigate some attributes of prime numbers and how to work with them in a computer. All the algorithms here can be found in a python notebook. One of the main applications of prime numbers is in…

Privacy

9 min read

Sep 28, 2020

Number theory for Cryptography and Privacy Preserving Machine Learning

This is a first post in which I intend to explain the basic ingredients needed to understand the cryptography for privacy preserving machine learning topics. Here I will cover number theory, for python code check this notebook. Privacy preserving machine learning (PPML) is a relatively new field of study that…

Cryptography

8 min read