Results 1 to 2 of 2

Thread: new primality testing algorithm?

  1. #1

    new primality testing algorithm?

    Not sure if this has been posted or not.. but i was refered to this paper about new method of primality testing which is very fast.

  2. #2
    הבּרוּ נשׂאי כּלי יהוה mike's Avatar
    Join Date
    Mar 2001
    Actually, it's not fast at all. There are probablistic tests that run orders of magnitude faster. But they can only say that a number is "probably" prime (albeit with a very high confidence level). This paper's important because it gives an algorithm that is guaranteed to run in less than a fixed constant times the number of bits to the twelfth power (rather than exponential in the number of bits) and is guaranteed to give the right answer.
    Last edited by mike; February 14th, 2003 at 22:15.

Similar Threads

  1. Introduce me to fuzzing, testing and exploiting pls
    By freesoul in forum Advanced Reversing and Programming
    Replies: 0
    Last Post: June 6th, 2012, 10:58
  2. testing algo
    By dion in forum Off Topic
    Replies: 6
    Last Post: November 19th, 2008, 15:06
  3. IDA testing releases..
    By nikolatesla20 in forum Tools of Our Trade (TOT) Messageboard
    Replies: 26
    Last Post: February 7th, 2006, 23:37
  4. Primality testing *is* in P - Proof
    By GodsJiva in forum RCE Cryptographics
    Replies: 3
    Last Post: September 11th, 2002, 07:07
  5. Some Armadilloed Targets for testing....
    By foxthree in forum Tools of Our Trade (TOT) Messageboard
    Replies: 10
    Last Post: June 1st, 2002, 11:32


Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts