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: Reading Next
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
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: Reading Next
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
Subscribe to ldnovak
Subscribe to ldnovak
<100 subscribers
<100 subscribers
Share Dialog
Share Dialog
Hi,
Did much more writing on RSA. Will finish soon.
Bye,
Lucas
Hi,
Did much more writing on RSA. Will finish soon.
Bye,
Lucas
No activity yet