Re: Factoring with cubic equations?
From: Bob Silverman (pubkeybreaker_at_aol.comstuff)
Date: 10/06/03
- Next message: Scott Fluhrer: "Re: how to read the math in RFCs?"
- Previous message: Joe Peschel: "Re: Are natural languages secure ciphers?"
- In reply to: lapin des pyrenees: "Re: Factoring with cubic equations?"
- Next in thread: lapin des pyrenees: "Re: Factoring with cubic equations?"
- Reply: lapin des pyrenees: "Re: Factoring with cubic equations?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 06 Oct 2003 00:29:13 GMT
You have not explained how you derive
the coefficients of your cubic as a function
of N. Until you give the details of your
'algorithm', NO ONE can evaluate it. Based
on your posts, I doubt whether you can
give a cogent explanation.
I strongly suspect, however, that whatever
method you are using, that it runs in
exponential time.
Here is a more modest challenge than the
one I gave before:
Give your cubic polynomial corresponding to:
N = 2^137 + 2^69 + 1
Explain how you derived the coefficients.
Note: This value of N is *tiny* by current
factoring standards.
"You can lead a horse's ass to knowledge, but you can't make him think."
- Next message: Scott Fluhrer: "Re: how to read the math in RFCs?"
- Previous message: Joe Peschel: "Re: Are natural languages secure ciphers?"
- In reply to: lapin des pyrenees: "Re: Factoring with cubic equations?"
- Next in thread: lapin des pyrenees: "Re: Factoring with cubic equations?"
- Reply: lapin des pyrenees: "Re: Factoring with cubic equations?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|