Forum Home
PC World Chat
 
Thread ID: 86034 2007-12-31 23:21:00 Challenge to break my code andrew93 (249) PC World Chat
Post ID Timestamp Content User
626384 2008-02-13 08:44:00 -----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

- -----BEGIN PGP MESSAGE-----
Version: GnuPG v1.4.6 (GNU/Linux)

hQIOA/DgnQaY0i3TEAf+PWJmE/9GPHZMA8c95ZbJ4SPNE9DbODfoXoqX0C/l+kCy
mvT+lyPx4+kHkSoQOdBBTRwUGB5cKzJdf7MVfYW9yalC6iHwtt SAyFjHWtfl3qDZ
6c+hZcb+97AHp4ssvn/VhyrGR9DEbjZJGDh0psYlj8SFit5t5NVzNhbcNm4cD6Cj
OjZ/kpvX7c43UDMTZ+R5d/tcbJUxTZ5quY6z3qeSDluCnllhLsnV7ZnPosAdGPaJ
pMswRYYYHsa1ZIg4A0jBIRLto1vgr2NY9lOuobEm79Du0bQy6G eneNwJDVqhHoT4
B5Eet0H6QusSSpg53fmdPKGf97Nqy+/wVRpyQUcTugf+Mf1XYhplUpRu7QWsdPVM
QBG2KT+qwr2aaApKnmheG5kATk6zydZGNLJdLasUmnVOu9i6zh w/XmYy+cQYcGgz
cH3gZwV5Ed8TfqP5cfMblZVMMuq0ht9GAiaR3XlIUf2Jkxl1LH kUaLycqLkcs3b3
NCkQF1g7o1F7xCf5pkQc5eFgvzzjoFpIsxg95aFFqpxmOMg7dY ZfI80OHEkCD1mu
21PpIcw7SFVh2PS9sBD61Kj7J5xJKcNlcXlW2PjBto8vzKcKN+ 5sQG1QbNTjxinV
XU6CmaERONorMjZDNMUQQxXo6NhxxUVnptSqxaBxOrwBMw4IYw VV/nlY8ZMeGzSW
vNKDAcxtUtukaXDCToFipK5w0rvRuqhnFKD0ZTbasjW7HSJvUI 0JyvXTgzWsGn0Q
4gDonaUIrz5CfYzKnbwDekkxLFFxP6mO1c/PwIftPAq4YSidkMsm7OpwcAGQnkB9
rv8dcZZZE58pyfN9hcMbq7DpkAhlqdvzd2V58nj8t/sCslBzQWU=
=b2fE
- -----END PGP MESSAGE-----

Sorry to resurrect this but I just wanted to add a signed copy of this to make it impossible for anybody else to change the ciphertext or for me to deny that a message is genuine at any point in the future. The digital signature on this assures both.

The terms:

I will give the first person to present the corresponding plaintext for this ciphertext on or before 2018-01-03 the sum of NZ$1000 at the time of claim. No illegal activity may be performed to acquire this information and the method must be described.

-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.6 (GNU/Linux)

iD8DBQFHsq5fOaae2rbI9uwRAhFpAKDWUX9gy4XePm0/3NE/2BdgHQUYrQCglqUl
aJgbAgISv90OnAKOYxQN6jA=
=umIx
-----END PGP SIGNATURE-----
TGoddard (7263)
626385 2008-02-14 09:15:00 So perhaps supply the ciphertext derived from the image, but NOT the solution, then one can work on trying to produce the ciphertext from the image, then work on decoding the 'unbreakable' ciphertext.

Try extracting the RGB values for each pixel from the image - that's as good a starting point as any.
andrew93 (249)
626386 2008-05-28 10:09:00 I have seen those pixelated pictures before. Here:

thedailywtf.com

They appear to he hiding a web address.
joemac (9739)
626387 2008-05-29 04:00:00 I think the message hides Natalia's personal letter to Andrew93, that's what.

Now what do I get as prize?:banana

sarel
sarel (2490)
626388 2008-05-29 04:50:00 I think the message hides Natalia's personal letter to Andrew93, that's what.

Now what do I get as prize?:banana

sarel

$700mil from your Nigerian uncle. I just need a $150k "goodwill" fee first.
Thebananamonkey (7741)
626389 2008-05-29 10:54:00 I have seen those pixelated pictures before. Here:

thedailywtf.com

They appear to he hiding a web address.
Thanks for the link. I hadn't come across this type of encoding before I started this project and 5 months into the challenge it has been quite interesting. For instance, people are sending me codes using similar techniques and asking if I can break them. Uh...no!

I also get quite a bit of 'hate' mail - I don't know why. :confused: Meanwhile, others have signed me up for all sort of spam - you know who you are! :annoyed: But I also get a lot of e-mail from people who just want to chat about codes. Bizarre. But it's ok. Anyway, it has been very interesting and to date no-one is even close to breaking the code. Only one correspondent worked out the significance of the images so I posted that for all to see.

Meanwhile I see sarel thinks he is on to something - just don't tell me wife about Natalia Guimaraes. :thumbs:
andrew93 (249)
626390 2008-05-29 12:49:00 Meanwhile I see sarel thinks he is on to something - just don't tell me wife about Natalia Guimaraes. :thumbs:I have it on expert authority that that ain't her surname. ;) Greg (193)
626391 2008-05-30 13:02:00 I agree completely. I have been working on how to break the PKI algorithms (albeit very slowly) and this cipher of mine is trying to get one step ahead of a) the break in public key security and b) quantum computing. I have written factorisation and prime number routines but I need to get them to work smarter to speed up the process....it may take a while.

Andrew

I'm interested in this comment. In terms of prime factorisation of numbers, this is a no go. I am not aware of any sub-exponential complexity algorithm that meets this requirement. Even the quantum computing factorisation claim is disputed. Perhaps you know something that most don't? I suspect that the NSA and similar groups are 10+ years ahead of us in number theory so it's possible for a new mathematical technique to do so (the NSA after all, knew of the Diffie-Hellman concept many years before the public).

Public Key Security is very good. Breaking it would involve some how finding a way of finding discrete logarithms over a finite field (for the current PGP implementation). This would involve some heavy mathematical machinery. I think you'd make a lot more money out of this than any cipher. In fact, you'd probably win the fields medal ;).
DangerousDave (697)
626392 2008-05-30 23:17:00 I'm interested in this comment . In terms of prime factorisation of numbers, this is a no go . I am not aware of any sub-exponential complexity algorithm that meets this requirement . Even the quantum computing factorisation claim is disputed . Perhaps you know something that most don't? I suspect that the NSA and similar groups are 10+ years ahead of us in number theory so it's possible for a new mathematical technique to do so (the NSA after all, knew of the Diffie-Hellman concept many years before the public) .

Public Key Security is very good . Breaking it would involve some how finding a way of finding discrete logarithms over a finite field (for the current PGP implementation) . This would involve some heavy mathematical machinery . I think you'd make a lot more money out of this than any cipher . In fact, you'd probably win the fields medal ;) .
Hi

I'm not sure I follow 100% - what do you mean by sub-exponential? If you are referring to the number of tests required not growing exponentially then there are ways and means of reducing the test population .

Following is the output from a programme I wrote last year:


Start Time : 31/05/2008 10:20:21 a . m .
Seeking Factors For 3928545143
FOUND A FACTOR : 52579
OTHER FACTOR : 74717
End Time : 31/05/2008 10:20:21 a . m .

Start Time : 31/05/2008 10:24:49 a . m .
Seeking Factors For 5932161139
FOUND A FACTOR : 56747
OTHER FACTOR : 104537
End Time : 31/05/2008 10:24:50 a . m .

I realise the number that I tried to factor is quite small, but I think you'll find the two factors are prime numbers . When I said 'albeit very slowly' - I meant two things - first up is that I haven't explored this for a while and secondly, from memory my routines start to slow considerably once you get into the trillions .

Andrew
andrew93 (249)
626393 2008-05-31 00:21:00 Any chance of you being able to post the algorithm / method you used to encrypt this with? It's now been 5 months since the start of the challenge; there's no way it takes 5 months to lodge a patent application. Erayd (23)
1 2 3 4 5 6 7 8 9