lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  PHC 
Open Source and information security mailing list archives
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Date:   Sun, 24 Mar 2019 21:47:50 +0100
From:   "Jason A. Donenfeld" <>
To:     George Spelvin <>
Cc:     LKML <>,
        "Theodore Ts'o" <>
Subject: Re: [RFC PATCH] random: add get_random_max() function

I generally use a slightly simpler algorithm in various different projects:

//[0, bound)
static unsigned long random_bounded(unsigned long bound)
       unsigned long ret;
       const unsigned long max_mod_bound = (1 + ~bound) % bound;

       if (bound < 2)
               return 0;
               ret = random_integer();
       while (ret < max_mod_bound);
       return ret % bound;

//[min, max_plus_one)
static unsigned long random_range(unsigned long min, unsigned long max_plus_one)
       return random_bounded(max_plus_one - min) + min;

Is the motivation behind using Lemire that you avoid the division (via
the modulo) in favor of a multiplication?

Powered by blists - more mailing lists