Tiny Bytes: Quick Update

ldnovak

<1 min read·August 28, 2022

Share Dialog

Hey,

Still working at giving myself more time to write. My goal is in the next few days to read up on more security and get a post done on that. So today will be short with that as the goal.

So today will be a quick, quick write up with reading.

Bye,

Lucas

More from ldnovak

T
ldnovak
Oct 11

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

T
ldnovak
Oct 8

Tiny Bytes: Chilling

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

T
ldnovak
Oct 9

Tiny Bytes: Quickie

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

View more

2025 Paragraph Technologies Inc

PopularTrendingPrivacyTermsHome
Search...Ctrl+K

ldnovak

Subscribe
Subscribe

Share Tiny Bytes: Quick Update

TwitterBluesky
Search...Ctrl+K

ldnovak

Subscribe

Tiny Bytes: Quick Update

Share Dialog

Hey,

Still working at giving myself more time to write. My goal is in the next few days to read up on more security and get a post done on that. So today will be short with that as the goal.

So today will be a quick, quick write up with reading.

Bye,

Lucas

Share Tiny Bytes: Quick Update

TwitterBluesky

More from ldnovak

T
ldnovak
Oct 11

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

T
ldnovak
Oct 8

Tiny Bytes: Chilling

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

T
ldnovak
Oct 9

Tiny Bytes: Quickie

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

View more

2025 Paragraph Technologies Inc

PopularTrendingPrivacyTermsHome
ar://pg3WedT-s9kpesF46YYNT54LEhc2mH8XeAJjjcwpf_4
ar://pg3WedT-s9kpesF46YYNT54LEhc2mH8XeAJjjcwpf_4

Subscribe to ldnovak

Subscribe to ldnovak

<1 min read·August 28, 2022
ldnovak
Subscribe
Subscribe

<100 subscribers

<100 subscribers