Fast sorting, branchless by design
Summary
The article argues that traditional sorts can leak timing information and presents data-oblivious sorting networks as fixed, data-independent alternatives. It covers sorting networks like bubble sort, odd-even transposition, bitonic sequences, and djbsort, highlighting SIMD/constant-time optimizations and cryptographic relevance. It discusses float ordering, GPU suitability, and practical trade-offs for cryptographic use.