Explore >> Select a destination
|
You are here 
|
talesfromtheencrypt.home.blog | ||
| | | | |
wsummerhill.github.io
|
|
| | | | | ||
| | | | |
siunam321.github.io
|
|
| | | | | Back in November 2024, me and my university CTF team NuttyShell placed champion on PwC's Darklab Hack A Day CTF competition. One of the champion prizes is "Sponsorship of Offensive Security Certified Professional (OSCP) PEN-200 certification (90-day lab access)". Since I already earned OSCP back in 2023, and having a strong interest in web security, I requested the organizer to switch it to OffSec Web Expert (OSWE), which they happily did so! Eventually, I earned OSWE on June 2nd, 2025! | |
| | | | |
www.offsec.com
|
|
| | | | | We are going to change the OSCP exam structure to better reflect the PWK materials and the skills needed to be a more well-rounded Penetration Tester. | |
| | | | |
cacm.acm.org
|
|
| | | [AI summary] The article discusses the ongoing evolution of the P vs NP problem in computational complexity theory, emphasizing its profound implications for algorithm design, cryptography, and artificial intelligence. It highlights how advances in machine learning and quantum computing are reshaping our understanding of computational limits, while also cautioning against the potential misuse of algorithms in areas like algorithmic bias and surveillance. The piece concludes by reflecting on the philosophical and practical significance of P vs NP, suggesting that its resolution could redefine the boundaries of what is computationally feasible. | ||
