<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>ECC on BrainBit Latest Articles</title><link>https://brainbit.uk/tags/ecc/</link><description>Recent content in ECC on BrainBit Latest Articles</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Tue, 04 Jul 2017 08:55:05 +0000</lastBuildDate><atom:link href="https://brainbit.uk/tags/ecc/index.xml" rel="self" type="application/rss+xml"/><item><title>Elliptic Curve Crypto ,Point Doubling</title><link>https://brainbit.uk/posts/elliptic-curve-crypto-point-doubling/</link><pubDate>Tue, 04 Jul 2017 08:55:05 +0000</pubDate><guid>https://brainbit.uk/posts/elliptic-curve-crypto-point-doubling/</guid><description>Hi Guys , last article we spoke about addition , one of the most important “invented” operations on eliptic curve arithmetic . There’s been great feedback highlihghting that the rule “if a line crosses two points , it will cross a third point” might not be absolute.
That’s is true , there’s a few exceptions and today I will try to explain one , what would happen if point P and Q share the same position (x and y wise):</description></item><item><title>Elliptic Curve Crypto , Addition</title><link>https://brainbit.uk/posts/elliptic-curve-crypto-addition/</link><pubDate>Thu, 29 Jun 2017 10:59:26 +0000</pubDate><guid>https://brainbit.uk/posts/elliptic-curve-crypto-addition/</guid><description>Hello! , this will be the sequel of:
Elliptic Curve Crypto , The Basics
Today let’s try to tackle operations as in addition and multiplication , keep in mind that these are “invented” operations , the fact that it is called addition it’s a mere coincidence , They should’ve been called something different but such is life.
I will split this into a few concepts and then lately write about some of the exceptions.</description></item><item><title>Elliptic Curve Crypto , The Basics</title><link>https://brainbit.uk/posts/elliptic-curve-crypto-the-basics/</link><pubDate>Tue, 27 Jun 2017 07:52:26 +0000</pubDate><guid>https://brainbit.uk/posts/elliptic-curve-crypto-the-basics/</guid><description>Alright! , so we’ve talked about D-H and RSA , and those we’re sort of easy to follow , you didn’t need to know a lot of math to sort of grasp the the idea , I think that would be a fair statement.
Well things are a little bit steeper when facing ECC , to say the least , it’s got multiple properties and there’s a lot more math in it .</description></item><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>