Things I can work on:
- time management, procrastination (no late assignments)
- more time for events/social gatherings
- start things early
- solve more problems on leetcode, hackerrank, codewars
- time for reading, podcasts
- post more on x (maybe ๐)
Some other spring highlights:
- met an engineer from MIT
- met a startup founder
- received an invite to the Grace Hopper Celebration event
- I got picked for a summer group project (not first pick, though ๐)
- professor gave me a recommendation
- got paid to mentor
Most importantly, I learned to appreciate the math behind the code a lot more.
I learned how to hash strings with math first and then code. It made me realize how important it is to understand theories, computation, and linear algebra.
The 2024 spring semester is finally over!!!! I feel like I can breathe again ๐
I learned a lot about
- greedy algorithms
- proof by induction
- number theory
- regular expressions
- finite state machines
- OOP
- program design
- timing algorithm runtimes
Thanks to @LastMileFund and @ShelminaAbji for giving women access to a free copy of her book. I was lucky to receive one and I feel like it was something i needed to remind myself why I'm here and doing what I'm doing.
1871, a tech incubator in Chicago, hosted a career fair to get to know some of the startups in the city. I met some pretty cool people today and got free headshots. @0xEthChicago, @_thegreenzone_, Quality Builders among a few
Another good research on CPU attacks on Apple's M1 and M2 processors. Ciphertext blinding and running cryptographic processes on specific cores are suggested, but they come with performance penalties.
Vulnerability demo on mac: https://t.co/RdIpvEOl4j
https://t.co/4qZNaH5GYK
๐ฎFuture Trends: Future advancements in RSA cryptography might explore quantum-resistant techniques to ensure security against emerging threats posed by quantum computing. MIT Reading on emerging encryption standards: https://t.co/wpwuvyHvdI
๐ A Thread on #RSAHistory: RSA encryption is one of the oldest public-key cryptography systems that involves raising a message to the power of the public exponent modulo n, while decryption requires raising the ciphertext to the private exponent modulo n.
๐ Security Measures: Selecting large prime numbers enhances security by making factorization difficult. This ensures the security of RSA encryption against attacks.