Re: PKI: the end

From: Grumble (devnull_at_kma.eu.org)
Date: 03/22/05 

Date: Tue, 22 Mar 2005 09:24:53 +0100

Tom St Denis wrote:

> We can PROVE if very large numbers are prime (just not quickly)

I thought there existed a "polynomial time deterministic algorithm to
test if an input number is prime or composite."

http://www.cse.iitk.ac.in/news/primality.html

Relevant Pages

  • Re: fooling primality tests
    ... Tom St Denis wrote: ... how difficult is it to choose a composite number ... The probabilty that you're processor ...
    (sci.crypt)
  • Re: Schneiers "Helix" cipher is remarkably similar to the "generic feistel cipher&qu
    ... Tom St. Denis wrote: ... a cipher to the design of simpler components, ... the cipher answered to by Wagner ...
    (sci.crypt)
  • Re: XORShift PRNG as a diffusion structure
    ... >>like him and Tom St Denis. ... > This isn't the first time you've done this before [or the first time ... number of general readers would certainly have been angry ...
    (sci.crypt)
  • Re: AES trickery ;-)
    ... Too bad you missed the day in school where they taught you to ... Someone who reads the above diatribe about how Tom St Denis demands ... you're too american to sit down and work out the details ...
    (sci.crypt)
  • Re: Working on ARC4-16 bit
    ... Well, i'm sorry about what happened with Tom St Denis, i have esteem ... of him and personally i had found interesting many of his posts here. ... deeply tested by highly qualified matematicians and cryptoanalists it ...
    (sci.crypt)