Fully Randomized Pointers
summary
Proposes Fully Randomized Pointers (FRP), a pointer encoding that replaces machine addresses with a 40‑bit object ID plus randomized offset packed into 64 bits, claiming a baseline of 52‑bit entropy that makes brute‑force forgery infeasible (est. 384,000 years at speculative‑attack rates). Implements a software prototype BlueFat (Pin) for security and binary compatibility and a hardware simulator GreenFat (Gen5) with a small cache, showing full SPEC run compatibility and under ~4% performance overhead.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 1:03Memory errors security threat
- 2:28Memory exploit attacks anatomy
- 4:34Entropy-based defenses limits
- 6:23FRP design high-entropy encoding
- 8:52Pointer operations security checks
- 9:5752-bit entropy security impact
- 11:23BlueFat GreenFat evaluation
- 13:09Conclusion open-source
- 13:52Q&A compatibility
- 14:59Q&A address schemes
- 15:42Q&A partitioning
- 16:24Q&A garbage collection
related talks
17mFat Pointers for Temporal Memory Safety of C
01h 01mSmarter Cpp Atomic Smart Pointers - Efficient Concurrent Memory Management
50mHow random is Random? Pitfalls of Random in .NET 6
20mEPF: Evil Packet Filter
01h 30mRandom
35mOn Securing Legacy Software Against Code-Reuse Attacks
36mThe journey of BPF from restricted C language towards extended and safe C.
15mWhy TRULY Random Keys Are CRITICAL (and How Quantum Dice Fixes It)