Tiny Bytes: RSA
tldr RSA works by exploiting the fact we can’t easily factor 2 large prime numbers and group theory to make a trapdoor permutation, aka a function that turns x into y but y can’t easily be turned into x without a secret. However, implementing RSA gets tricky because there’s lots of subtle attacks.MathRSA takes advantage of the group Z^*_{n} (multiplicative group of integers modulo n). This is the non-negative integers less than n that have an inverse modulo n. 1 x 1 mod n = 1. 0 x int = 0 so ...
Tiny Bytes: Chilling
Hi, Just chilling tonight. Aiming to finish up chapter tomorrow. Night, Lucas
Tiny Bytes: Quickie
Hi, Did much more writing on RSA. Will finish soon. Bye, Lucas
Tiny Bytes: RSA
tldr RSA works by exploiting the fact we can’t easily factor 2 large prime numbers and group theory to make a trapdoor permutation, aka a function that turns x into y but y can’t easily be turned into x without a secret. However, implementing RSA gets tricky because there’s lots of subtle attacks.MathRSA takes advantage of the group Z^*_{n} (multiplicative group of integers modulo n). This is the non-negative integers less than n that have an inverse modulo n. 1 x 1 mod n = 1. 0 x int = 0 so ...
Tiny Bytes: Chilling
Hi, Just chilling tonight. Aiming to finish up chapter tomorrow. Night, Lucas
Tiny Bytes: Quickie
Hi, Did much more writing on RSA. Will finish soon. Bye, Lucas
Share Dialog
Share Dialog
Subscribe to ldnovak
Subscribe to ldnovak
<100 subscribers
<100 subscribers
Hi,
Tonight I wasn’t sure what I wanted to write about. That’s not quite true. I wanted to write about quantum computers but to do that I need to understand elliptical curves. And that’s going to take too much time.
However, in trying to figure out what to write I stumbled onto a misunderstanding.
The plan is to write about how quantum computers break key generation and signatures. This is going to require writing about elliptical curves and RSA first.
When reading through the cloudflare article, I realized that the key generation mentioned Diffie-Hellman but the signature mentioned RSA. I was confused as I thought they could be used for both.
This got me going down a bit of a rabbit hole.
I realized that my understanding of signing and encrypting was fundamentally flawed. I thought the same key was generated, encrypt/decrypt, and sign/verify.
Instead, there’s an encryption and a signature scheme. So there’s gen, encrypt, and decrypt AND gen, sign, verify. Some schema you can technically use both (e.g., RSA) but it is considered bad to do.
This really helped put what I was reading fall better into place. Not a lot of words for today, but I can guarantee I did a bunch of research to figure this and other problems out.
The problem I now have is how do MACs play into this? Are they used for symmetric encryption (e.g., after the TLS handshake)?
I get wanting to use key generation schemes (involving public and private key encryption and signing) to generate the symmetric keys. I’m just curious on how devices talk after.
Night,
Lucas
ps
Quantum computing come on my mind tonight because it looks like a quantum algorithm in the 4th round (i.e., where alternative algorithms that weren’t selected in round 3 are evaluated) was found to be broken. I don’t understand how but want to.
Hi,
Tonight I wasn’t sure what I wanted to write about. That’s not quite true. I wanted to write about quantum computers but to do that I need to understand elliptical curves. And that’s going to take too much time.
However, in trying to figure out what to write I stumbled onto a misunderstanding.
The plan is to write about how quantum computers break key generation and signatures. This is going to require writing about elliptical curves and RSA first.
When reading through the cloudflare article, I realized that the key generation mentioned Diffie-Hellman but the signature mentioned RSA. I was confused as I thought they could be used for both.
This got me going down a bit of a rabbit hole.
I realized that my understanding of signing and encrypting was fundamentally flawed. I thought the same key was generated, encrypt/decrypt, and sign/verify.
Instead, there’s an encryption and a signature scheme. So there’s gen, encrypt, and decrypt AND gen, sign, verify. Some schema you can technically use both (e.g., RSA) but it is considered bad to do.
This really helped put what I was reading fall better into place. Not a lot of words for today, but I can guarantee I did a bunch of research to figure this and other problems out.
The problem I now have is how do MACs play into this? Are they used for symmetric encryption (e.g., after the TLS handshake)?
I get wanting to use key generation schemes (involving public and private key encryption and signing) to generate the symmetric keys. I’m just curious on how devices talk after.
Night,
Lucas
ps
Quantum computing come on my mind tonight because it looks like a quantum algorithm in the 4th round (i.e., where alternative algorithms that weren’t selected in round 3 are evaluated) was found to be broken. I don’t understand how but want to.
No activity yet