Alice, Bob and Mallory comments

"Breaking simple ciphers" by Jonas Elfström

Sat, 07 Nov 2009 00:02:21 +0100

Thanks!

"Infinite ranges in C#" by Eric Lippert

Wed, 21 Oct 2009 00:13:35 +0200

Nice!

Of course you could just use the predefined constants System.Double.PositiveInfinity and System.Double.NegativeInfinity; no need to define your own.

"The Thrush combinator in C#" by Reginald Braithwaite

Wed, 07 Oct 2009 00:52:31 +0200

Great post!

"A case for using only three different digits in keypad codes" by Jonas Elfström

Thu, 01 Oct 2009 21:50:11 +0200

It’s 12 ways if you know the repeated digit. Otherwise you have 0012, 1102, 2210 and so on.

"Man in the browser" by Jonas Elfström

Thu, 01 Oct 2009 21:35:06 +0200

MITB is not dead. https://financialcryptography.com/mt/archives/001190.html

"A case for using only three different digits in keypad codes" by BruceA

Thu, 01 Oct 2009 21:20:51 +0200

Shouldn’t that be just 6x2 = 12 ways? After you have placed the repeated digits in each of the six possible positions, you have two possible ways (for each) of arranging the remaining two digits.

In any case, you’ve proven that these keypads are not very secure, regardless of which combination is chosen.

"A case for using only three different digits in keypad codes" by Uffe

Mon, 28 Sep 2009 13:37:45 +0200

Jag tror att du glömde en etta ;)

"Why you should use four different digits for keypad locks" by Fredrik Mansfeld

Thu, 24 Sep 2009 09:47:32 +0200

Just a minor correction: I think De Brujin’s method needs 10003 keystrokes in the worst case. The interesting thing is that the sequence itself is only 10000 digits. If you havn’t had any luck when you reach the end you just start over from the beginning to get the last three combinations. You can see it in your example too. The combinations 1114, 1144 and 1444 is missing, but you get them if you start over from the beginning when you reach the end.

"Why you should use four different digits for keypad locks" by jberryman

Thu, 24 Sep 2009 06:22:35 +0200

This was really interesting to read! I just discovered De Brujin sequences two days ago and was just working on a blog post when I read this.

I implemented two binary De Brujin algorithms in haskell and wrote about it here.

"Breaking simple ciphers" by Romy

Thu, 24 Sep 2009 00:51:12 +0200

This post was teh bomb.

I <3 ruby. I <3 ciphers. I <3 kanye stepping on kittens.

Keep it coming…