Didactic Feedback Cipher

User avatar
sabretooth
Posts: 61
Joined: Sun Jul 12, 2009 3:13 pm

Post by sabretooth »

Really really liked this one. Definitely made me think :)

No bruteforce needed indeed :D

sabretooth
aurora
Posts: 54
Joined: Thu Feb 05, 2009 12:31 pm
Location: Bavaria, Germany

Post by aurora »

indeed ... no brute-force needed. the solution was quite insightful for me. interesting challange ...
bboy
Posts: 2
Joined: Thu Nov 15, 2012 9:59 am

Post by bboy »

I had WFT moment after solving this crypto. Really interesting :D.
AgRaven
Posts: 13
Joined: Sun Feb 24, 2013 8:27 am

Post by AgRaven »

Haha, I've been using these crypto chalanges as motivation and goal setting for learning my way through c++ . I spent some time on this one thinking the wrong way, and the output my code gave me (as a modified version of other programs I wrote for cyphers) just underlined that mistake.... made me laugh. :D
marko9900
Posts: 2
Joined: Tue Oct 01, 2013 6:45 am

Post by marko9900 »

IT seems like im trying to brute force it :D I wrote a simple code in python, that gives me all 256 possibilities. Only thing missing is to convet alla those int oASCII.

Any guidance for me?
User avatar
TheBigBoss
Posts: 29
Joined: Thu Jun 07, 2012 12:07 pm
Location: Germany

Post by TheBigBoss »

marko9900 wrote:Any guidance for me?
Surely you're joking... :roll:
aurquiel
Posts: 5
Joined: Wed Jul 26, 2017 8:02 pm

Post by aurquiel »

In this code

Code: Select all

k = {unknown byte}
for (i = 0; i < len(txt); i++)
  c = txt[i] ^ k
  print c
  k = c
This

Code: Select all

k = c


should be this

Code: Select all

k = txt[i]
Miyazawa
Posts: 1
Joined: Sun Jan 19, 2014 3:21 am

Post by Miyazawa »

aurquiel wrote:In this code

Code: Select all

k = {unknown byte}
for (i = 0; i < len(txt); i++)
  c = txt[i] ^ k
  print c
  k = c
This

Code: Select all

k = c


should be this

Code: Select all

k = txt[i]
It is true! Thank you @aurquiel.
The algorithm is wrong so I have wasted a lot of time by doing this challange...
You should correct this...
User avatar
Hippo
Posts: 339
Joined: Sat Feb 01, 2014 12:05 am
Location: Praha 5

Post by Hippo »

Miyazawa wrote:
aurquiel wrote:In this code

Code: Select all

k = {unknown byte}
for (i = 0; i < len(txt); i++)
  c = txt[i] ^ k
  print c
  k = c
This

Code: Select all

k = c


should be this

Code: Select all

k = txt[i]
It is true! Thank you @aurquiel.
The algorithm is wrong so I have wasted a lot of time by doing this challange...
You should correct this...
I don't think there is problem with the challenge.
What "a lot of time" roughly means in SI units?
Never mind, you have already solved the puzzle.
Post Reply