Re: primality


"Ertugrul Soeylemez" <do-not-spam-me@xxxxxxxx> wrote in message
news:f02ko7$3oc$00$1@xxxxxxxxxxxxxxxxxxxx

Okay, then I misunderstood you. But what is the point in doing this?

the point is that it is easier and faster to use an algorithm to generate a
prime/semiprime/compound number that happens to be odd rather than
generating the number randomly and testing for primality because if the
primality test fails then a new random number has to be generated and
tested. but using an algorithm will produce inear results once the initial
state is known.

I don't know which dictionary you're using, but `code' and `ciphertext'
is not the same. Ciphertext is plaintext transformed in such a way that
a key is needed to undo the transformation. That ciphertext is stored
in a particular representation. This representation is called the code.

Different things can be encoded using different codes. Examples of
codes: Finite data as base N numbers (decimal, hexadecimal, Base64...)
vs. UUEncode, colors in RGB vs. HSV, text as UTF-8 vs. Latin-1, etc.

i stand corrected, thank you.


.

Relevant Pages

  • Re: sparse polynomial arithmetic
    ... Remaining within the boundaries of this representation (which are ... do arithmetics directly on codes ... perfect hash values in a hash set ... The algorithm first checks if the exponents of the polynomials to be ...
    (sci.math.symbolic)
  • Re: primality
    ... the point is that it is easier and faster to use an algorithm to generate a prime/semiprime/compound number that happens to be odd rather than generating the number randomly and testing for primality because if the primality test fails then a new random number has to be generated and tested. ... You just grab any random number that's about the size you need and set the first and last bit to "1" (the first bit makes it the size you need and the last bit makes it an odd number - it is very simple and very quick. ... This representation is called the code. ... Different things can be encoded using different codes. ...
    (sci.crypt)
  • Re: No Set Contains Every Computable Natural (was Church-Turing compared to Zuse-Fredkin thesis)
    ... Russell is right about Turing saying this, ... You might not want to call this an algorithm which has ... decimal representation of x digit by digit. ...
    (comp.theory)
  • Algorithm for license codes
    ... I know that posting here the details of a new algorithm would irk most of us, but this is the only place I know where I can ask for a reliable advice. ... I'm studying the feasibility of an algorithm based on public key cryptography that is suited for generating strong license codes for product activation. ... The public key part are the polynomials, the private part are an equivalent representation of the polynomials such that it's easy, given Y, to compute the reverse X = F^-1. ...
    (sci.crypt)
  • rapidly converging rational sqrt
    ... I do not know if this algorithm is new, ... We designate the tail of this continued fraction using ... representation has the form: ... If the evaluation of the first n terms produced ...
    (sci.math.research)