If you have any kind of understanding of algebra, some understanding
of factoring, and have read my derivation of what I call the factoring
congruences so that you know they are correct, and heard how they can
be used against an RSA public key then you may wonder why there is
such quiet.

Well I have experience with major mathematical results where I looked
for an expected reaction from the mathematical community and there was
quiet, and I concluded that they wait to see if anyone else will
notice!!!

It's not like I keep a low profile and I've routinely emailed
mathematicians about my research around the world and used to submit
papers routinely as well.

That's how I know as much as I do about how broken the modern
mathematical community is, from my experiences with past proofs, where
I realized they had to be checking to see if they could just safely
ignore me.

So they let a proof of Fermat's Last Theorem go by, protected claims
of Wiles having proven FLT--he did not--and ignored lots of other
research of mine as well.

There are a couple of questions that have to be answered to determine
if RSA encryption is ended as a viable approach by my factoring
relations.

Those relations, which I posted before with a derivation are:

Given

z^2 = y^2 + nT

you can solve for z modulo a given prime p coprime to y, z and nT
with:

z = (2á)^{-1}(1 + 2á^2)k mod p

and

k^2 = (á^2+1)^{-1}(nT) mod.

With n=1, if you can solve the quadratic residues modulo a prime p
where p>sqrt(T), then you can just solve for z mod p, and y mod p, and
get a factor from z-y mod p or z+y mod p as one of them will equal the
smaller factor.

So the question to understand the implications for RSA here is, how
hard is it to find k for a quadratic residue q modulo p, where

k^2 = q mod p

if p is approximately sqrt(public key)?

On Jan 5, 1:51 am, rossum coldmail.com> wrote:

Ok, yes there is a factoring approach there with the equations from
which the generalized factoring relations come, but again you'd have
to have a methodology, like picking a large prime p, which I DO say on
that page.

I have a question about k as I was musing about it at that time and
wasn't sure.

Now then, answer some questions:

Do you pick a large prime p around the size of sqrt(T)?

What is your full methodology that you claim is my factoring method?

Sexy with boobs
visit this page
wawwwww
*****************************************
http://www.geocities.com/gurus68/
*****************************************

Sexy with boobs
visit this page
wawwwww
*****************************************
http://www.geocities.com/gurus68/
*****************************************

gjedwards wrote: