djbsort

djbsort is a new software library for sorting arrays of integers or floating-point numbers. It provides the following features:

These features are not separate options: there is a single sorting function that is simultaneously fast, secure, and verified.

The current release of djbsort has the following limitations:

Credits

The djbsort author is Daniel J. Bernstein, University of Illinois at Chicago.

djbsort builds upon results from the following paper: Daniel J. Bernstein, Chitchanok Chuengsatiansup, Tanja Lange, Christine van Vredendaal, "NTRU Prime: reducing attack surface at low cost", Selected Areas in Cryptography 2017. The NTRU Prime paper explained how to make constant-time sorting software run faster than Intel's sorting software on Intel CPUs, and demonstrated this with a software release in 2017. djbsort includes verification and provides another 3x speedup.


Version: This is version 2018.07.29 of the "Intro" web page.