Therefore, hypothetically, Bob, who needs to send a message (512) to Alice, would use Alice’s public key to encrypt 512 and then send her the number 477. Here is the result which should be printed out: We will use small numbers for the sake of simplicity and this is basically one of the factors that led me to use the word “naive” since it could be easily broken in a short time. I do not know how they usually get these primes (I haven’t covered it yet) but anyway, they are almost all you need to start your “naive” RSA encrypting system in Python. Now let’s get to the necessary premises and the code!įirst of all, to start off you need two big primes, p and q. You can watch this incredible piece of history on you tube. This machine was basically the first computer. For those who did not know, Alan Turing, during the Second World War, devised a machine which made it possible to decrypt Enigma code in relatively short time and therefore gain a significant advantage. I have always been fascinated by encryption and cryptosystems. Here is the algorithm carefully described. If you want to get more on RSA click here. In order to decrypt a message encrypted with RSA you would need to factorize a REALLY BIG number and this problem may take a very long time to be solved, it may take so long that it becomes unpractical to be achieved. As you may recall from high school, each number has a unique prime number factorization. It basically rely on the also well-known issue of factoring big numbers. RSA is a well-known cryptosystem used in many cases where secure data transmission is needed. Please before continue reading, make sure to read the disclaimer at the bottom of this article.
0 kommentar(er)
