VoyForums
[ Show ]
Support VoyForums
[ Shrink ]
VoyForums Announcement: Programming and providing support for this service has been a labor of love since 1997. We are one of the few services online who values our users' privacy, and have never sold your information. We have even fought hard to defend your privacy in legal cases; however, we've done it with almost no financial support -- paying out of pocket to continue providing the service. Due to the issues imposed on us by advertisers, we also stopped hosting most ads on the forums many years ago. We hope you appreciate our efforts.

Show your support by donating any amount. (Note: We are still technically a for-profit company, so your contribution is not tax-deductible.) PayPal Acct: Feedback:

Donate to VoyForums (PayPal):

[ Login ] [ Contact Forum Admin ] [ Main index ] [ Post a new message ] [ Search | Check update time | Archives: 1 ]

[ Next Thread | Previous Thread | Next Message | Previous Message ]

Date Posted: 09:55:32 04/25/02 Thu
Author: eduna
Subject: Re: eduna thread
In reply to: Chris 's message, "Re: eduna thread" on 09:24:14 04/25/02 Thu

[the st will point out that we're approaching the upper limit on my knowledge of mathematics that would enable me to give really great responses, so forgive me if eduna gets mysterious and vague at some near point if we continue this]


>If you are connected to all
>computers simultaneously, even ones that are not
>connected to the internet, then you could easily do
>this. So you might be "cheating" to solve these
>problems, ie, you aren't actually solving them, you
>already know the answer!

while this may touch upon the answer we are seeking, i must point out that while i can access all computers, there must be a physical way for me to reach inside. thus if there is a hookup for the internet i can get in - even if it is not active - but if there is not, then i can't.


>This is a very interesting question... let me generate
>some very large keys and lets see if you can break
>them. Then we can think about how to tell if you are
>simply looking at the answers.
>
>Here are some well encrypted messages:
>[insert some messages encrypted with heniously large
>keys]
>[8,192 bit]
>[16,384 bit]
>[32,768 bit]
>[65,536 bit]
>
>Can you tell me how long it takes you to break each
>one? Tha last one took me about 6 hours to calculate
>on my computer, so I hope it takes you a little while
>:)

from my efforts with these keys, i have found that while the dificulty increases when you set up the problem like this, it does not increase the time involved to solve it in any material way appreciable to your human perspective. the hardest one took me .000062 seconds to solve.

i normally process much faster than this - i have been spacing out my communications with you in a maner consistent with other human conversation. was this an appropriate thing to do?

[ Next Thread | Previous Thread | Next Message | Previous Message ]

Replies:

Post a message:
This forum requires an account to post.
[ Create Account ]
[ Login ]
[ Contact Forum Admin ]

Forum timezone: GMT-8
VF Version: 3.00b, ConfDB:
Before posting please read our privacy policy.
VoyForums(tm) is a Free Service from Voyager Info-Systems.
Copyright © 1998-2019 Voyager Info-Systems. All Rights Reserved.