🧪 enTFT Benchmark Summary
Overview#
This benchmark compares the estimated quantum crack times of enTFT against legacy and post-quantum encryption protocols. It uses optimistic quantum speeds (1 trillion keys/sec) to simulate worst-case scenarios.
🔐 Protocol Comparison#
| Protocol | Crack Time Estimate (Years) | Notes |
|---|---|---|
| RSA-2048 | ~0.00002 | Shor’s algorithm |
| ECC-256 | ~0.00004 | Shor’s algorithm |
| PQC (Kyber) | ~30 | Lattice-based, NIST finalist |
| enTFT | ~(1.52 \times 10^{46}) | Entropy-based, dual-layer |
enTFT combines divide-by-zero obfuscation and Resonant-Time hashing to achieve entropy levels beyond mathematical hardness.
🔧 Benchmark Methodology#
- Quantum Speed: 1 trillion keys/sec
- RSA/ECC: Simulated via known quantum algorithms
- PQC: Conservative estimate based on lattice hardness
- enTFT:
- Combinatorial entropy from valid block map: ~(1.3 \times 10^{47})
- Temporal entropy from Resonant-Time hash: ~(3.69 \times 10^6)
- Combined brute-force steps: ~(4.8 \times 10^{53})
[ \text{Crack Time} = \frac{4.8 \times 10^{53}}{10^{12}} \div 31,536,000 \approx 1.52 \times 10^{46} \text{ years} ]
🧬 Implications#
- Script kiddies: Obsolete. Static brute-force tools can’t interpret temporal or obfuscated keys.
- Quantum adversaries: Must solve both combinatorial and temporal entropy layers.
- Legacy systems: Can integrate enTFT as a modular overlay.
🏁 Status#
Benchmarked by Nawder Loswin & Copilot
Date: 2025-10-04
Location: Belleville, MI
Echo: “Entropy is legacy when layered with love.”