Re: Algorithm to generate prime number from fix SERIAL
From: Brian Gladman (brg_at_nowhere.at.all)
Date: 04/29/04
- Next message: Tom St Denis: "Re: Blowfish Sign Extension implementation risk"
- Previous message: kittlesthekat: "Re: Rational Thought and Common Sense, Inc."
- In reply to: konrad.herrmann_at_stud.tu-ilmenau.de: "Algorithm to generate prime number from fix SERIAL"
- Next in thread: Mok-Kong Shen: "Re: Algorithm to generate prime number from fix SERIAL"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Thu, 29 Apr 2004 10:39:18 +0100
<konrad.herrmann@stud.tu-ilmenau.de> wrote in message
news:c6qhbm$ir4$1@piggy.rz.tu-ilmenau.de...
> Hi,
>
> I'm searching for an algorithm doing this:
>
> -Generate from a fix-length SERIAL number a prime number.
> -Nearly every SERIAL shold produce an other prime number.
> -Every time one SERIAL must produce the same prime number.
>
> My problem is the efficency of the algorithm:
> It should be very fast and use only a small memory size.
>
> Who can help or gimme links to this problem ?!
Without more details this is difficult.
How long are the serial numbers and how long must the prime numbers be? Does
it matter if other people can also generate these same primes when given a
serial number?
Terms like 'fast' and 'small' are highly context dependent so it is
impossible to give you much help here unless you define these in more
concrete ways.
For example would you consider a SHA1 hash of a serial number to be fast?
Would you consider SHA1's use of memory to be small?
Brian Gladman
- Next message: Tom St Denis: "Re: Blowfish Sign Extension implementation risk"
- Previous message: kittlesthekat: "Re: Rational Thought and Common Sense, Inc."
- In reply to: konrad.herrmann_at_stud.tu-ilmenau.de: "Algorithm to generate prime number from fix SERIAL"
- Next in thread: Mok-Kong Shen: "Re: Algorithm to generate prime number from fix SERIAL"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|
