Re: Numeric one-way hash function
From: Andrew Swallow (am.swallow_at_eatspam.btinternet.com)
Date: 10/09/03
- Next message: Joe Peschel: "Re: Semiramis not broken yet"
- Previous message: Mack: "Re: deficiences of linear congruential RNGs"
- In reply to: Ernst Lippe: "Re: Numeric one-way hash function"
- Next in thread: Andrew Swallow: "Re: Numeric one-way hash function"
- Reply: Andrew Swallow: "Re: Numeric one-way hash function"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Thu, 9 Oct 2003 00:21:39 +0000 (UTC)
"Ernst Lippe" <ernstl-at-planet-dot-nl@ignore.this> wrote in message
news:3f84175c$0$17950$48b97d01@reader22.wxs.nl...
> On Wed, 08 Oct 2003 00:07:05 +0000, Andrew Swallow wrote:
>
[snip]
>
> > The simplest way to ensure that the bar codes are
> > unique is to add a prime number to the previous
> > value. Lap round when you get to the top (or a prime
> > number near the top). Start at a weird value.
>
> Could you be more precise, I am afraid that I
> don't understand your algorithm.
> Anyhow, I can't see that your algorithm would
> be unbiased, or how it would prevent duplicates.
>
Where C, Max are prime constants and C != Max
Initialise N to a valid random number
loop
N = N + C
if N > Max then N = N - Max
Print N
end loop
Andrew Swallow
- Next message: Joe Peschel: "Re: Semiramis not broken yet"
- Previous message: Mack: "Re: deficiences of linear congruential RNGs"
- In reply to: Ernst Lippe: "Re: Numeric one-way hash function"
- Next in thread: Andrew Swallow: "Re: Numeric one-way hash function"
- Reply: Andrew Swallow: "Re: Numeric one-way hash function"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|