Return to Unfiction unforum
 a.r.g.b.b 
FAQ FAQ   Search Search 
 
Welcome!
New users, PLEASE read these forum guidelines. New posters, SEARCH before posting and read these rules before posting your killer new campaign. New players may also wish to peruse the ARG Player Tutorial.

All users must abide by the Terms of Service.
Website Restoration Project
This archiving project is a collaboration between Unfiction and Sean Stacey (SpaceBass), Brian Enigma (BrianEnigma), and Laura E. Hall (lehall) with
the Center for Immersive Arts.
Announcements
This is a static snapshot of the
Unfiction forums, as of
July 23, 2017.
This site is intended as an archive to chronicle the history of Alternate Reality Games.
 
The time now is Mon Nov 18, 2024 7:13 pm
All times are UTC - 4 (DST in action)
View posts in this forum since last visit
View unanswered posts in this forum
Calendar
 Forum index » Diversions » Perplex City Puzzle Cards » PXC: Silver Puzzle Cards
[PUZZLE] #251 - Silver - The Thirteenth Labour - READ POST#1
Moderators: AnthraX101, bagsbee, BrianEnigma, cassandra, Giskard, lhall, Mikeyj, myf, poozle, RobMagus, xnbomb
View previous topicView next topic
Page 50 of 73 [1087 Posts]   Goto page: Previous 1, 2, 3, ..., 48, 49, 50, 51, 52, ..., 71, 72, 73  Next
Author Message
Misroi
Veteran

Joined: 03 Apr 2006
Posts: 133

If the password is "PXCNo251", expect riots.

PostPosted: Sun Jul 09, 2006 4:19 am
 View user's profile
 Back to top 
hairysocks
Boot


Joined: 09 Jan 2006
Posts: 38
Location: Exeter, Devon, England

chimera245 wrote:

As for which letter we are on my PC has just completed OHXRzzzz, so we have the rest of O, P-Z and a-z to go.


Does this mean the only keys being tested are those made up of letters of the alphabet converted to their ASCII hex values?
_________________
"You never can tell with Heffalumps"

PostPosted: Sun Jul 09, 2006 8:15 am
 View user's profile
 Back to top 
David-A
Guest


Yes.

We are trying all key combinations made up from characters 0-9, A-Z and a-z.

See a previous post for the answer to why this is a VERY safe/sensible approach.

[Basically we have 62 characters currently, the problem is adding an additional, say, 6 for the basic punctuation doesn't make the search 10% bigger. In fact it would make it whole orders of magnitude bigger. And it would take years - which is a bit unreasonable.]

If we reach the end of this keyspace without finding the it, we can then increase the range of permitted characters - WITHOUT undermining the work done.

PostPosted: Sun Jul 09, 2006 8:48 am
 Back to top 
themandotcom
Veteran


Joined: 28 Apr 2006
Posts: 136
Location: Syosset, New York, USA, Earth, Milky Way Galaxy, Universe

I'm wondering, if we find the correct key, will it say "possible match" on the clients of something?
_________________
13th Labour!

PostPosted: Sun Jul 09, 2006 5:48 pm
 View user's profile AIM Address
 Back to top 
poozleModerator
Entrenched

Joined: 15 Aug 2005
Posts: 1090

themandotcom wrote:
I'm wondering, if we find the correct key, will it say "possible match" on the clients of something?


I think (from what I remember being said before) it will say something like possible match and display what you got on the screen, if you see this and it looks like a solve it would be nice to let Chimera/Guin get the first solves and then they will contact you (via email) to let you know IF it was right and about the prize (let me know if any of this is incorrect).

PostPosted: Sun Jul 09, 2006 7:32 pm
 View user's profile
 Back to top 
cwmajors
Guest


David-A wrote:
Yes.

We are trying all key combinations made up from characters 0-9, A-Z and a-z.

See a previous post for the answer to why this is a VERY safe/sensible approach.

[Basically we have 62 characters currently, the problem is adding an additional, say, 6 for the basic punctuation doesn't make the search 10% bigger. In fact it would make it whole orders of magnitude bigger. And it would take years - which is a bit unreasonable.]

If we reach the end of this keyspace without finding the it, we can then increase the range of permitted characters - WITHOUT undermining the work done.


Unfortunately, I believe the key will -not- be in the range we're testing right now. (Although I do have 3 computers working on the task, and I hope I'm proven wrong.)

MC has said (I forget exactly where) that they figure it would take 30000 computers around 8 months to get the key. We have about 1000 working on the problem right now, and we're making the assumption that the key will be only printable characters. However, my assumption is this: The decoded message is a question, and the answer to -that- question is the solve for the card. If this is true, then the key does not have to be entered into a form at all, and therefore has no restriction to only printable characters.

Like I said, I hope I'm wrong. But even if I'm right, eliminating all combinations of alphanumerics is as good a place to start as any.

PostPosted: Sun Jul 09, 2006 8:01 pm
 Back to top 
David-A
Guest


cwmajors wrote:
David-A wrote:
Yes.

We are trying all key combinations made up from characters 0-9, A-Z and a-z.

See a previous post for the answer to why this is a VERY safe/sensible approach.

[Basically we have 62 characters currently, the problem is adding an additional, say, 6 for the basic punctuation doesn't make the search 10% bigger. In fact it would make it whole orders of magnitude bigger. And it would take years - which is a bit unreasonable.]

If we reach the end of this keyspace without finding the it, we can then increase the range of permitted characters - WITHOUT undermining the work done.


Unfortunately, I believe the key will -not- be in the range we're testing right now. (Although I do have 3 computers working on the task, and I hope I'm proven wrong.)

MC has said (I forget exactly where) that they figure it would take 30000 computers around 8 months to get the key. We have about 1000 working on the problem right now, and we're making the assumption that the key will be only printable characters. However, my assumption is this: The decoded message is a question, and the answer to -that- question is the solve for the card. If this is true, then the key does not have to be entered into a form at all, and therefore has no restriction to only printable characters.

Like I said, I hope I'm wrong. But even if I'm right, eliminating all combinations of alphanumerics is as good a place to start as any.


I think we need to be very carefull and differentiate between the key and the solve.

I'm do reckon the key will only be printable characters.
I further believe it will be only either be in the range we are currently looking at, or with basic other characters (e.g. # - / etc) included.

And, as you said, elminating the basic alphanumerics first is as good a place to start as any. If unfound we would then need to just run the additional combinations introducing the symbols to the key mix in a sensible/likelhood order.

---

Where I would be more concerned is where you raise the issue of non-printables in the solve. This did have me concerned for a moment. - And still does, but to a limited extent.

I agree it is quite realistic to assume that the decoded solve is not going to necessarily be a direct solve for the card.

However, given that MC have said that it would take X machines Y time to solve, well unless MC were talking carelessly, that suggests automation can be used.

If you are using automation, the question is how do you spot when you have solved it? You NEED to have a way of spotitng a solve. Even if the automation generated the decode using every combination in the keyspace it would be imposisble to manually review every one and assess it by looking at how it would be printed (i.e. including non printable characters).

Therfore how would you spot a solve?

Unless they were being really cryptic, I'm guessing it has to have some printable characters. Therefore anything without, is out.

Unless they were drawing a map, or ascii art, it seems reasonable that there should be a minimal number of nonprintables. [If the answer was ascii art it would be, in real world terms, impossible to automate the solve.]

I agree it might be a risk to bin anything with a nonprintable. Perhaps we should be ranking every output with a likely hood score... will do more think and post later.

However I do think, because we have been told automation can solve it, and because you need therefore a method spot a solve, that we are probably safe to bin the nonprintable solves, however if MCs figure for the time is much higher, well maby they have been ******* and maby the key is stuffed full of sybols and we need to increase the keyspace.

PostPosted: Sun Jul 09, 2006 10:08 pm
 Back to top 
cwmajors
Guest


I seriously doubt there will be non-printables in the plaintext of the cypher - after all, MC -does- want this thing to be solved eventually. I just wanted to point out that the -key- does not necessarily have to be a printable-text key. In fact, if I were MC and I wanted to ensure that JoeBlow136 doesn't just -guess- the key, I'd make sure it completely random, without caring what the key is, because the key itself isn't important- the solve is.

As you said, there is an important distinction between the key and the solve that we need to remember. It would be very cute if the key was Violet's phone number or some such thing, but it would also destroy the point of the card, which is to crack a RC64 cypher.

My guess is that's exactly what we're being asked to do here. We will know very quickly when we've solved it, because we're using the same protocols that the distributed.net folks did.

At this rate, however, it's going to take us a while. My personal opinion is that it's going to take us plowing through the printables, then expanding outwards until we hit upon it.

PostPosted: Sun Jul 09, 2006 11:53 pm
 Back to top 
David-A
Guest


cwmajors wrote:
I seriously doubt there will be non-printables in the plaintext of the cypher - after all, MC -does- want this thing to be solved eventually. I just wanted to point out that the -key- does not necessarily have to be a printable-text key. In fact, if I were MC and I wanted to ensure that JoeBlow136 doesn't just -guess- the key, I'd make sure it completely random, without caring what the key is, because the key itself isn't important- the solve is.

As you said, there is an important distinction between the key and the solve that we need to remember. It would be very cute if the key was Violet's phone number or some such thing, but it would also destroy the point of the card, which is to crack a RC64 cypher.

My guess is that's exactly what we're being asked to do here. We will know very quickly when we've solved it, because we're using the same protocols that the distributed.net folks did.

At this rate, however, it's going to take us a while. My personal opinion is that it's going to take us plowing through the printables, then expanding outwards until we hit upon it.


Agreed.
- I think it is credible we might need to expand beyond the alpha-numerics (A-Z,a-z,0-9) and include the other printable characters (e.g. symbols, brackets and then punctuation).

But lets hope we're wrong, and that we find it without expanding the range...

PostPosted: Mon Jul 10, 2006 5:07 am
 Back to top 
marky1124
Boot

Joined: 23 Dec 2005
Posts: 31

Whilst the key is limited to the 62 character key space don't forget that the decrypt text is being tested for printable ASCII characters which includes slashes etc that are used in ASCII art.

PostPosted: Mon Jul 10, 2006 5:24 am
 View user's profile
 Back to top 
fretty
Decorated

Joined: 19 Nov 2004
Posts: 281
Location: South Yorkshire, England

Was having a little read up about RC5 and was wondering. Looking at the site:

http://www.distributed.net/rc5/

Would it be right to assume that the message will start with

"the unknown message is:"

in the same style as the RSA challenges.

PostPosted: Mon Jul 10, 2006 7:16 am
 View user's profile
 Back to top 
Jones
Guest


marky1124 wrote:
Whilst the key is limited to the 62 character key space don't forget that the decrypt text is being tested for printable ASCII characters which includes slashes etc that are used in ASCII art.


Indeed.

But I think they're clear on that.

The discussion being whether the solve could be assumed to be free from non-printables, which might be present if it was ASCII-art
Or equally a word-square etc, or anything elese that is layed-out.

PostPosted: Mon Jul 10, 2006 8:25 am
 Back to top 
jbd
Decorated

Joined: 27 Jul 2004
Posts: 295

I should point out most plausable additions of punctuation increase the magnitude of the problem by years, not months.

Quoting chimera from the blog:
Quote:
With a 62 character keyspace, there are 62 ^ 8 combinations to check. We are currently processing on averay 0.8% of that keyspace per day, giving us a time for the full keyspace of approx 125 days.

If we added punctuation, the keyspace rapidly expands to 90 odd - lets say 92. This makes the keyspace 92 ^ 8. This keyspace is over 20 times larger, so it would take us over 8 years at the current rate to process. This is our primary reasoning behind this keyspace - the unfeasibility of any other.


Including unprintables would start to get to the 100+ years mark.

PostPosted: Mon Jul 10, 2006 11:56 am
 View user's profile
 Back to top 
Skizz
Boot

Joined: 11 Jan 2006
Posts: 37

I don't want to put a damper on things, but I've just noticed that the rccrypt program uses hex values for the key (unless I've misread it), i.e. the key is in the format "76fea2bc76a145e3" rather than "fivecows" which means the alphanumeric only key string is tenuous as you'd have to convert the string into a sequence of hex digits (not difficult) to use rccrypt. Anyone tried "beefbeefbeefbeef" as the keystring? (Admittedly it's only four cows!)

I have recently sent Chimera an update to that super fast cracking client I posted several pages back in this thread which should integrate with the existing code base quite easily - hopefully he'll have a chance soon to look at it. Now, if someone can get me an 64bit PC I could make it even faster....

Maybe we could do with a couple of these: http://www.reghardware.co.uk/2006/06/20/ibm_overclocking_feat/

Skizz

PostPosted: Mon Jul 10, 2006 12:30 pm
 View user's profile
 Back to top 
cwmajors
Greenhorn

Joined: 10 Jul 2006
Posts: 9

jbd wrote:
Including unprintables would start to get to the 100+ years mark.


Yes, at our current rate. We may need to start publicizing this problem a bit more, in order to try and get towards the number of clients mentioned in the MTV article. Specifically: 30000 clients should take around 8 months. That means 1000 clients should take around 240 months, or 20 years.

So our problem isn't that we're not doing the right thing, we just need to be doing a lot more of it. I wonder if the good folks running the 13thlabour.tk site could stand a slashdotting or digging to get more people on the case.

PostPosted: Mon Jul 10, 2006 4:10 pm
 View user's profile
 Back to top 
Display posts from previous:   Sort by:   
Page 50 of 73 [1087 Posts]   Goto page: Previous 1, 2, 3, ..., 48, 49, 50, 51, 52, ..., 71, 72, 73  Next
View previous topicView next topic
 Forum index » Diversions » Perplex City Puzzle Cards » PXC: Silver Puzzle Cards
Jump to:  

You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum
You cannot post calendar events in this forum



Powered by phpBB © 2001, 2005 phpBB Group