Re: Simple hash or pseudo-random function

["Dan'l Miller" <optikos@verizon.net>]

On Monday, July 16, 2018 at 3:20:28 AM UTC-5, gautier...@hotmail.com wrote:
> Hello,
> Does someone have a function that would take an integer (range 0 .. 2**63), not uniformily distributed
> (it's a code with some meaning) and return a number that is pseudo-random, uniformily distributed
> (could be a floating-point number or an integer in a range of minimum length 365) ?

Do you mean, e.g., a modular-arithmetic integer of length 365 bits?  Of range 0..2**365-1?

I ask because bitlength is the customary measurement of “length“ of an integer in cryptography, but the lengths of integers in crypto tend to be 512, 1024, 2048, and so forth, not 365 per se.  Bitlength of an integer is also the customary measurement of “length” of an integer keys for depth-first walks of radix tries* as well (extrapolated from binary/radix-2 PATRICIA tries*), but the lengths of depth-first walks of radix tries tends to be word sizes (e.g., 16, 32, 64, or 128 bits) or the lengths of depth-first walks of PATRICIA tries tends to be bitwidth-of-character multiplied by length of string, not 365 per se.

* The more-correct ‘trie’ is sometimes misspelled ‘tree’, despite the O(1) growth of trie search-time as opposed to log(n) growth of tree search-time for trees, as the quantity n of leaves increases arbitrarily large.