Forum

fmoraes's posts

24 posts found

Re: Challenge "Purple 1"

  By: fmoraes on Dec. 4, 2014, 11:43 p.m.

Never mind, I did a quick experiment with the tool from Cryptologia and a minor change to the code and the right settings (once I read the comment in the text) gave me the solution. It was just a matter of cleaning it up.

Re: Challenge "Purple 1"

  By: fmoraes on Dec. 4, 2014, 11:24 p.m.

Do I need to worry about the SIXES and TWENTY's or those are fixed like in the program? Seems like on a real Purple machine, we would have to find the sixes and the sixes switch and then do an attack on the twenties, but I am not clear if that is re…

Re: Challenge

  By: fmoraes on Dec. 3, 2014, 8:33 p.m.

I am retaking my efforts to solve this one. Anybody else working on it?

I have about 32K survivors from phase 1 attack, but my phase 2 attack is way too slow. I am not %100 sure on how to reduce the number of index permutations down to 2^8 as sug…

Re: Challenge

  By: fmoraes on Nov. 26, 2014, 6:01 p.m.

Can someone give me a hint or nudge on how to attack/solve this problem?

Please send me an email and what you tried with Sage. I guess I can give you a hint. Best regards, Bernhard

Thanks for the reply, but I have already solved it…

Re: Challenge

  By: fmoraes on Nov. 21, 2014, 11:15 p.m.

An additional note for this challenge: The enigma model used in this part of the challenge uses one rotor of a different model (see hints from part 1 and 2). Therefore, this probably cannot be set in any simulator - therefore, if implementing som…

Re: Challenge

  By: fmoraes on Nov. 18, 2014, 2:08 a.m.

Can someone give me a hint or nudge on how to attack/solve this problem?

I tried to find some literature or papers on attacks on the problem but I have not seen anything that helps yet.

I know the curve is singular but not much more than that.…

Re: Challenge

  By: fmoraes on Nov. 6, 2014, 10:15 p.m.

I will have not been able to solve this one. Even though I think I decoded the file into an alphabet that should make sense (even considering one of the letters to be a space), I still get no solution.

Any thoughts?

Well, finally solved …

Re: Challenge

  By: fmoraes on Nov. 5, 2014, 10:25 p.m.

I will have not been able to solve this one. Even though I think I decoded the file into an alphabet that should make sense (even considering one of the letters to be a space), I still get no solution.

Any thoughts?

Re: Notification of new challenges

  By: fmoraes on Oct. 16, 2014, 7:47 p.m.

+1

Why not simply create a topic here in the general section, where a short notice is posted whenever a new challgene is online. This does not have to be anything long, just for example: "New challenge online: link".

This way any inter…

Notification of new challenges

  By: fmoraes on Aug. 29, 2014, 10:37 p.m.

On an off topic, is there a way to be notified when new challenges are published?

Re: [solved] Challenge

  By: fmoraes on July 2, 2014, 1:11 a.m.

Is there something wrong with the checking of the answer on this challenge? The official numbers don't seem to be accepted.

Re: Challenge

  By: fmoraes on Dec. 5, 2013, 6:53 p.m.

I think I found the shift but I am having trouble validating my program. It solves the case of no shift but that wrinkle is causing me some grief.

Would one of the previous solvers be willing to confirm the shift I found via PM or email?

Franc…

Re: Challenge

  By: fmoraes on Nov. 29, 2013, 4:18 p.m.

My problem is with the last part of the hint about solving for x. That appears to be a discrete logarithm problem.

Never mind, I think I figured it out for part one as I can generate the messages. Have to work on part 2 next.

Re: Challenge

  By: fmoraes on Nov. 29, 2013, 2:02 a.m.

Hello Francisco,

have you seen this hint by jomandi:

let N = p*q. the following calculations are modulo p:

let g be a generator modulo p. then you have:

  • g^k != 1 mod p, for 0[HTML_REMOVED] > - g^(k*(p…

Re: Challenge

  By: fmoraes on Nov. 28, 2013, 4:20 p.m.

Do I need to find the primitive roots mod p and q in order to solve this?

Francisco


Currently 30 guests and 0 members are online.
Powered by the CrypTool project
Contact | Privacy | Imprint
© 2009-2024 MysteryTwister team