Tetstack
رفتن به کانال در Telegram
My Archive? IDK Owner: https://www.github.com/PicasoTheDeal Portfolio: https://tetstack.dev Blog: https://logs.tetstack.dev Files: @TetstackFiles
نمایش بیشترکشور مشخص نشده استدسته بندی مشخص نشده است
238
مشترکین
-224 ساعت
+87 روز
+2030 روز
آرشیو پست ها
238
AEGIS PQC PERFORMANCE BENCHMARK (500 iterations per operation) Hybrid KEM KeyGen | Mean: 78.89 us | Min: 62.02 us | Max: 828.75 us | 12675 ops/s Hybrid KEM Encapsulate | Mean: 221.03 us | Min: 171.50 us | Max: 1209.24 us | 4524 ops/s Hybrid KEM Decapsulate | Mean: 131.10 us | Min: 108.84 us | Max: 873.94 us | 7627 ops/s ---------------------------------------------------------------------------------------- ML-DSA-65 KeyGen | Mean: 59.55 us | Min: 49.72 us | Max: 643.12 us | 16791 ops/s ML-DSA-65 Sign (1 KB) | Mean: 155.67 us | Min: 61.69 us | Max: 1096.53 us | 6423 ops/s ML-DSA-65 Verify (1 KB) | Mean: 56.35 us | Min: 49.70 us | Max: 116.36 us | 17745 ops/sAnother test. 🔥
238
Test project /home/picasothedealer/Documents/Projects/AegisPQC/build
Start 1: Hybrid KEM engine boundary validation
1/4 Test #1: Hybrid KEM engine boundary validation ......... Passed 0.01 sec
Start 2: ML-DSA signature verification and tampering
2/4 Test #2: ML-DSA signature verification and tampering ... Passed 0.02 sec
Start 3: Session state machine constraints
3/4 Test #3: Session state machine constraints ............. Passed 0.02 sec
Start 4: Session peer verification fail-safe
4/4 Test #4: Session peer verification fail-safe ........... Passed 0.02 sec
The new project is going great.238
oh yeah also when you run
make vmlinuxit will basically generate a file around 165,000 lines of code so yeah
238
As of today's news Quantum Computers are kind of dying, but that doe sn't mean there won't be a come back later in the future so what this is basically protect data against attacks launched by future quantum computers. Why?
Well, Quantum Computers Threaten Current Encryption, Basically in three ways.
Shor's Algorithm: Quantum computers utilize quantum mechanics (qubits, superposition, and entanglement) to run Shor’s Algorithm. This solves prime factorization and discrete logarithms in minutes—the exact mathematical problems protecting nearly all current asymmetric encryption (RSA, ECC, Diffie-Hellman, ECDSA). Grover's Algorithm: Speeds up brute-forcing symmetric keys (like AES). While it doesn't break AES completely, it cuts key strength in half (AES-128 becomes as weak as 64-bit encryption, though AES-256 remains secure). Harvest Now, Decrypt Later (SNDL): Adversaries are actively intercepting and storing encrypted network traffic today so they can run it through a quantum computer once hardware scales up.
