Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.


Messages - jnesselr

Pages: 1 ... 154 155 [156] 157 158 ... 165
2326
Math and Science / Re: New RSA Algorithm discussion
« on: July 23, 2010, 11:17:33 am »
So can the matrix be done over a network type thing?  Can you explain Tonelli-Shanks algorithm or give a link to a better article than wikipedia?

Basically, though, if we could solve the matrix over a network of computers, would it be more efficient for these numbers? eg. not take forever?

2327
Math and Science / Re: New RSA Algorithm discussion
« on: July 22, 2010, 10:39:22 pm »
Thank you Bwang, for that information.

I thought about a recursive algorithm that finds the factors, but have no idea how it would be done.  It would stop once it found p or q, but where to start.  Obviously, we are talking about integers, here. (eg, not decimals or fractions)  Any ideas?

2328
Other Calculators / Re: Let's hack Nspire OS 2.1!
« on: July 22, 2010, 08:59:41 pm »
Honestly, I don't think a server is necessary right now.

@graphmastur: Not an OS. Heck, it's way too small to be an OS. I've never seen an OS that is 0.86 KBs! ;)

This is a TNS file, which is a TI-Nspire Document file.
Now, if I asked to post a TNO file, which is a TI-Nspire OS, that's illegal. (Obviously I would not do that. :) I have other sources...)

EDIT: Yikes! You guys are snappy posters! :-o

Oh, yeah, didn't pay much attention to the size.  Yeah, just making sure, and not enough paying attention.  lol, sorry.

2329
Other Calculators / Re: Let's hack Nspire OS 2.1!
« on: July 22, 2010, 08:29:37 pm »
I don't think that it is legal to post an OS, so if it is an os, please delete it.

2330
Other Calculators / Re: Nspire diagnostic software dumper
« on: July 22, 2010, 05:33:17 pm »
Hey, whatever works...

2331
Other Calculators / Re: TI'S Response to our outrage
« on: July 22, 2010, 12:05:00 pm »
because you don't have a compiler installed.  Making a compiler is not that easy, and I would suggest using an IDE.

2332
Math and Science / Re: New RSA Algorithm discussion
« on: July 22, 2010, 08:43:37 am »
You are correct Mapar007, AFAIK.

@bwang.  Thank you for explaining that, I think the quadratic sieve will help.  quick question,though.  Do you mind explaining what the difficult part or what part takes the most time is? eg. why is it ineffective?

2333
Math and Science / Re: New RSA Algorithm discussion
« on: July 21, 2010, 10:59:53 pm »
You are correct.  I fixed it in both posts.  Also, the sieve would require a huge amount of space for it, and I barely understand the concepts in a sieve like this.  The idea of this thread was to create better alternatives for the current algorithms, so what are your ideas to make it faster?

2334
Math and Science / Re: New RSA Algorithm discussion
« on: July 21, 2010, 09:47:27 pm »
Okay, well take any n which is a semiprime and do mod 4 of it.  eg, the remainder when it is divided by 4.  So if I have p=13 and q=19, that means p mod 4=1 and q mod 4=3, so pq mod 4=3.  That means that if we have an n, where n mod 4=3, it either means the p mod 4=3 or q mod 4=3, and the other mod 4 =1.

There is one thing I messed up, though.  It is supposed to be (4x+1)(4y+3)=16xy+12x+4y+3.  I'll go fix that in my last post...  Basically, though, if you solve that over the integers, it yields the factors.  There is only one solution.

2335
Math and Science / Re: New RSA Algorithm discussion
« on: July 21, 2010, 09:40:07 pm »
I'm not sure if this can be generalized to higher moduli. If it can, it might not be pretty.
Why would it be generalized to higher moduli? 4 is all that is necessary, and I believe it works on all numbers.  Besides, if you solve the equation above over the integers, then there is only one solution.

Can you please explain what you mean a little better?

2336
Math and Science / Re: New RSA Algorithm discussion
« on: July 21, 2010, 09:35:10 pm »
Okay, so I noticed something with things mod 4. This table is done mod 4.  eg, 13 mod 4=1.
pqn
111
133
313
331

So in other words, if n mod 4=3, then the number is of the form (4x+1)(4y+3)=16xy+12x+4y+3.  You can graph it, but I know of no way to solve this over the integers.  Any ideas?

[EDIT] oh, and sorry for the double post.
[EDIT2]  See post by me a few posts down for a better explanation.  Post fixed here.

2337
Other Calculators / Re: TI'S Response to our outrage
« on: July 21, 2010, 06:36:05 pm »
There aren't any confirmed spies, we are just being careful.

2338
TI-Nspire / Re: Virus to crack RSA for nspire? :P
« on: July 21, 2010, 06:24:21 pm »
They cannot change to boot2 key.  That is the one we should factor.

2339
Axe / Re: Tilemap Editor
« on: July 21, 2010, 04:15:35 pm »
Well, like having grayscale tile support.  So I can actually see how it looks within one application.

It's okay, btw, I didn't find it rude, but like Nemo meant it.  I don't know how you would implement it.

2340
Humour and Jokes / Re: Winning The Game Has Never Been So Much Easier
« on: July 21, 2010, 01:23:29 pm »
Wow, I have like 1 respect.  A spambot has more respect than I do. Nice.

Pages: 1 ... 154 155 [156] 157 158 ... 165