<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>RSA on BrainBit Latest Articles</title><link>https://brainbit.uk/tags/rsa/</link><description>Recent content in RSA on BrainBit Latest Articles</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Fri, 23 Jun 2017 14:27:27 +0000</lastBuildDate><atom:link href="https://brainbit.uk/tags/rsa/index.xml" rel="self" type="application/rss+xml"/><item><title>How does RSA work?</title><link>https://brainbit.uk/posts/how-does-rsa-work/</link><pubDate>Fri, 23 Jun 2017 14:27:27 +0000</pubDate><guid>https://brainbit.uk/posts/how-does-rsa-work/</guid><description>Hey guys , I wanted to write a little bit about RSA cryptosystem .
RSA is an asymmetric system , which means that a key pair will be generated (we will see how soon) , a public key and a private key , obviously you keep your private key secure and pass around the public one.
The algorithm was published in the 70’s by Ron Rivest, Adi Shamir, and Leonard Adleman, hence RSA , and it sort of implement’s a trapdoor function such as Diffie’s one.</description></item><item><title>Can you reverse Diffie-Hellman?</title><link>https://brainbit.uk/posts/can-you-reverse-diffiehellman/</link><pubDate>Thu, 22 Jun 2017 14:05:45 +0000</pubDate><guid>https://brainbit.uk/posts/can-you-reverse-diffiehellman/</guid><description>Hi All , so in a previous article i tried to explain how D-H works , and i hope I did a good job of it and hopefully there’s no questions , but how hard would it be for the person eavesdropping to reverse the “secret exponents” and guess the key?
Initial communication
Remember that image ? let’s recap:
Jerry and Simon agreed a prime and a base number , while they were chatting about this there’s a third person “Random” that is listening to everything.</description></item></channel></rss>