Elliott Kember dot Com - Latest Comments in The Kember Identity : Elliott Kember dot Com

Re: The Kember Identity : Elliott Kember dot Com

Sujay Shinoda — Wed, 09 Nov 2011 13:15:49 -0000

It's impossible to get randomly.

Re: The Kember Identity : Elliott Kember dot Com

nuit — Wed, 02 Mar 2011 09:44:08 -0000

i think, i just found a way of clustering this process....without running into loops...the main problem was....what happens if 2 clients get stuck into the same calculation, it's lost computation power....i'm thinking about this problem since it got posted here...and i just can't get my mind of it....everytime i have to come back and check and think about it how to attack this problem -.-
i feel like: it's my personal fermat problem :)

Re: The Kember Identity : Elliott Kember dot Com

André Laszlo — Sun, 14 Nov 2010 22:28:34 -0000

http://en.wikipedia.org/wik...

;)

Re: The Kember Identity : Elliott Kember dot Com

nuit — Thu, 04 Nov 2010 08:19:05 -0000

jap...it's a fixed point of a function (f(x) = x)...and a fixed point is also called the identity of a function...coz the extremely nice guy, Elliot Kember, called this particular identity from a hash by his name: kember identity..and coz it's a cool name for a fixed point ^^

Re: The Kember Identity : Elliott Kember dot Com

John the Scott — Sun, 10 Oct 2010 08:34:22 -0000

Why is this called a kember identity. Isn't this just a fixed point?

Re: The Kember Identity : Elliott Kember dot Com

Hasanat Kazmi — Mon, 13 Sep 2010 23:37:33 -0000

if
md5(a) = b
md5(b) = c
md5(c) = a
then Kember loop would be 3...

Re: The Kember Identity : Elliott Kember dot Com

Barney — Sat, 05 Sep 2009 00:14:41 -0000

Yeah, I totally jacked my "math". I realized this soon after, but didn't come back here and correct my statement. Though now that I'm looking, I don't think I can anyway.

Re: The Kember Identity : Elliott Kember dot Com

Ograll — Tue, 18 Aug 2009 17:47:29 -0000

If the designers knew that it didn't exist it would break one of the fundamental precepts of a Hash, that is given an output it is infeasible to construct the input. You also look at the Kember Identity as a negative. Its existence, or more importantly the inability to have a certainty about its existence is a strength of the hash since its one less thing you know about the Hash. When reversing a hash knowledge is an important part of the game, but if you can make certain statements, then the hash loses some of its strength.

Re: The Kember Identity : Elliott Kember dot Com

Thor Erik — Tue, 18 Aug 2009 13:22:04 -0000

I doubt it exsists, considering, which guy making such a algorithm would not make sure that would never happen?
I would at least try to prevent it, since it kind of breaks the purpose of the algorithm(a one-way algorithm)

I'm still trying though, got 3 computers working on it with different ways of attacking(among one using the cuda c++ version) and a couple of versions I've made myself one in bash and one in php, plus trying a few of the pre-made ones(with some modification)

Re: The Kember Identity : Elliott Kember dot Com

Chris — Tue, 07 Jul 2009 14:12:40 -0000

Seeing that there is a 37% chance that there will be no such code, I don't see how you can claim that only searching 1.5% would yield the desired result. Do you mind giving me the derivation?

Re: The Kember Identity : Elliott Kember dot Com

Barney — Sun, 05 Jul 2009 16:20:32 -0000

With that analysis, the important conclusion is that we only need to attain overall coverage of just under 1.5% to get a match. That's almost two orders of magnitude less than a full search!

Re: The Kember Identity : Elliott Kember dot Com

Chris — Thu, 25 Jun 2009 00:52:21 -0000

A detailed analysis of how likely it is to find such a code:

http://ograll.blogspot.com/...

Re: The Kember Identity : Elliott Kember dot Com

Elliott Kember — Fri, 12 Jun 2009 07:46:46 -0000

The guy spelt my name wrong, too. He gets zero points.

Re: The Kember Identity : Elliott Kember dot Com

Shashi — Fri, 12 Jun 2009 01:50:39 -0000

bull crap dude! the left part is ascii and right part is hex isnt it?

Re: The Kember Identity : Elliott Kember dot Com

Shashi — Fri, 12 Jun 2009 01:28:25 -0000

http://acodingfool.typepad.... you gotta check this shit out! that guy is too dumb i guess

Re: The Kember Identity : Elliott Kember dot Com

Elliott Kember — Thu, 28 May 2009 06:37:09 -0000

It's a set of MD5 hashes which step through in a loop like so:

md5(a) = b
md5(b) = c
md5(c) = a

and so on. Nobody's found one yet, and there isn't any code which checks - but it's a good reason to print out your current hash every so often.

Re: The Kember Identity : Elliott Kember dot Com

U747 — Wed, 27 May 2009 22:40:47 -0000

What's a Kember Loop exactly?

Is that just the longest common substring?

Re: The Kember Identity : Elliott Kember dot Com

Ben — Mon, 25 May 2009 17:02:43 -0000

Ooh I want to do it with CSS :D

Re: The Kember Identity : Elliott Kember dot Com

jdb1729 — Fri, 22 May 2009 00:47:12 -0000

I estimate a 37% (1/e) chance that no fixed point exists, whether we are talking about MD5 or SHA1:

In[4]:= Limit[((n-1)/n)^n, {n -> Infinity}] //N
Out[4]= {0.367879}

Re: The Kember Identity : Elliott Kember dot Com

Elliott Kember — Wed, 20 May 2009 11:23:02 -0000

Cool idea - unfortunately nobody has found one yet!

Re: The Kember Identity : Elliott Kember dot Com

zpmorgan — Wed, 20 May 2009 00:08:49 -0000

I've found one!

Not exactly a complete match but I'm done wasting cycles..

md5('deadbeefdc84955dfb53442f741f4ec9') == 1ebb63c68f0e40e6902e0deadfeefbfa

Re: The Kember Identity : Elliott Kember dot Com

zellyn — Tue, 19 May 2009 08:38:22 -0000

For fun, you could keep a tally of the shortest “Kember Loop” found so far… assuming anyone has found one.