Hi, I wrote for about an hour summarizing learnings about RSA. I am aiming to finish up tomorrow. This read and then write situation is definitely aiding my learning. That feels good. Night, Lucas

Hi, I wrote for about an hour summarizing learnings about RSA. I am aiming to finish up tomorrow. This read and then write situation is definitely aiding my learning. That feels good. Night, Lucas

Hi, Had a fun night with friends. Night y’all, Lucas

Hi, Had a fun night with friends. Night y’all, Lucas

Hi, I rewrote the bit that disappeared from yesterday. I was much quicker to write today now that I wrote it before. I’m finding this taking notes is forcing me to understand the text much better. A large portion of the time spent writing is spent trying to better understand what I’ve already read. Night, Lucas

Hi, I rewrote the bit that disappeared from yesterday. I was much quicker to write today now that I wrote it before. I’m finding this taking notes is forcing me to understand the text much better. A large portion of the time spent writing is spent trying to better understand what I’ve already read. Night, Lucas

Hi, I was writing out the next part of the notes. However, something happened and my work was lost. I didn’t kill the page. I think the page started to get killed but the pop up saying I might lose unsaved changes stopped that. Sadly, the writing I had was gone and not saved by mirror. I think the problem is that this happened as my wallet got signed out. I get this:Sad. But it is all good. I’ll rewrite tomorrow. And writing did help me learn. Night, Lucas

Hi, I was writing out the next part of the notes. However, something happened and my work was lost. I didn’t kill the page. I think the page started to get killed but the pop up saying I might lose unsaved changes stopped that. Sadly, the writing I had was gone and not saved by mirror. I think the problem is that this happened as my wallet got signed out. I get this:Sad. But it is all good. I’ll rewrite tomorrow. And writing did help me learn. Night, Lucas

Hi, Just chilling tonight. Aiming to finish up chapter tomorrow. Night, Lucas

Hi, Just chilling tonight. Aiming to finish up chapter tomorrow. Night, Lucas

Hi, Did much more writing on RSA. Will finish soon. Bye, Lucas

Hi, Did much more writing on RSA. Will finish soon. Bye, Lucas

Hi, Did some much needed coding tonight. Night, Lucas

Hi, Did some much needed coding tonight. Night, Lucas

Hola, Going to start reading the next chapter so going to skip the writing and read/sleep earlier. If I need to miss a writing night in the future, I might just read ahead. I have to reread so much anyway \_^_/ NIght, Lucas

Hola, Going to start reading the next chapter so going to skip the writing and read/sleep earlier. If I need to miss a writing night in the future, I might just read ahead. I have to reread so much anyway \_^_/ NIght, Lucas

Hio, Wrote about OAEP-RSA. Took my a bit of time to get down and understand it. I want to spend an equal amount of focus time to get down signing; however, I won’t do that tonight because of time. I’ll finish that up tomorrow. Bye, Lucas

Hio, Wrote about OAEP-RSA. Took my a bit of time to get down and understand it. I want to spend an equal amount of focus time to get down signing; however, I won’t do that tonight because of time. I’ll finish that up tomorrow. Bye, Lucas

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 ...

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 ...

Hi, Had a long fun day. Will finish up RSA tomorrow. Night, Lucas

Hi, Had a long fun day. Will finish up RSA tomorrow. Night, Lucas

Woot, Lucas

Woot, Lucas