Re: new factoring algorithm
From: Dann Corbit (dcorbit_at_connx.com)
Date: 05/30/03
- Next message: Albert P. Belle Isle: "Re: Definition of Military / Government grade ciphers"
- Previous message: Colin Andrew Percival: "Re: new factoring algorithm"
- Maybe in reply to: kooshiar azimian: "new factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Thu, 29 May 2003 17:17:47 -0700
"kooshiar azimian" <kooshiar62@yahoo.com> wrote in message
news:3706ea89.0305291456.6ad7be64@posting.google.com...
> We present a new algorithm for factoring extending the idea of
> Quadratic Sieve Factoring we can show that it works faster than
> Quadratic Sieve asymptotically .how can we check our algorithm to see
> its new or not ?
Publish it.
If you describe your algorithm on news:sci.crypt (or what is new about it)
probably someone can tell you right away if the ideas are new or not. If
they have never heard of it there (where plenty of crypto super-gurus like
Bernstein, Silverman, etc. hang out) then it has probably never been tried.
-- C-FAQ: http://www.eskimo.com/~scs/C-faq/top.html "The C-FAQ Book" ISBN 0-201-84519-9 C.A.P. FAQ: ftp://cap.connx.com/pub/Chess%20Analysis%20Project%20FAQ.htm
- Next message: Albert P. Belle Isle: "Re: Definition of Military / Government grade ciphers"
- Previous message: Colin Andrew Percival: "Re: new factoring algorithm"
- Maybe in reply to: kooshiar azimian: "new factoring algorithm"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
