Algorithm to generate prime number from fix SERIAL

From: konrad herrmann (konrad.herrmann_at_stud.tu-ilmenau.de)
Date: 04/29/04 

Date: Thu, 29 Apr 2004 11:14:36 +0200

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 ?!

Thanx

Relevant Pages

  • Re: [newbie] Best way to search for binary data
    ... [string searching ... ... > searching random bytes. ... algorithms are usually preferred to the Knuth-Morris-Pratt algorithm. ... void init_search(const char *string) ...
    (microsoft.public.vc.language)
  • Re: "Algorithms" in Molecular Biology?
    ... provided now includes its own refutation, continuously evading any test to ... for refuting my point is to provide a definition of Algorithm which all ... Is searching not an answer in and of itself. ...
    (sci.bio.evolution)
  • Re: Algorythms
    ... > the algorithm you're using is just as good or better than something ... searching for something time-tested and already used, ... store data: ... Also, which is the best method of comparing strings, I know IF-s are slower ...
    (borland.public.delphi.thirdpartytools.general)
  • Re: Efficient way to search for overlapping circles of varying radii?
    ... radius of p1 is less than the radius of p2, ... LARGER circle, as long as that larger circle has not already been removed. ... For all we can know your existing algorithm, ... sorting and searching in datasets of more than 1 dimension. ...
    (comp.graphics.algorithms)
  • Re: Algorithm to generate prime number from fix SERIAL
    ... > I'm searching for an algorithm doing this: ... > -Nearly every SERIAL shold produce an other prime number. ... > My problem is the efficency of the algorithm: ... Would you consider SHA1's use of memory to be small? ...
    (sci.crypt)