Talk:The Thirteenth Labour - Revision history

BrianEnigma: Reverted edits by ZnwRgr (Talk); changed back to last version by Scott

2007-07-02T02:15:38Z

Reverted edits by ZnwRgr (Talk); changed back to last version by Scott

← Older revision		Revision as of 02:15, 2 July 2007
Line 56:		Line 56:

	L = (ULLONG *)buffer;		L = (ULLONG *)buffer;
	R = (ULLONG *)(buffer 8);		R = (ULLONG *)(buffer+8);

	/Put the data into host byte order/		/Put the data into host byte order/
Line 65:		Line 65:
	for (i=rounds;i>=1;i--)		for (i=rounds;i>=1;i--)
	{		{
	R = rrotate(R - S[2i 1] , L ) ^ *L;		R = rrotate(R - S[2i+1] , L ) ^ *L;
	L = rrotate(L - S[2i], R) ^ *R;		L = rrotate(L - S[2i], R) ^ *R;
	}		}
Line 89:		Line 89:
	for (i=this.m_rounds;i>=1;i--)		for (i=this.m_rounds;i>=1;i--)
	{		{
	R = RRotate(R - this.m_S[2*i 1] , L ) ^ L;		R = RRotate(R - this.m_S[2*i+1] , L ) ^ L;
	L = RRotate(L - this.m_S[2*i], R) ^ R;		L = RRotate(L - this.m_S[2*i], R) ^ R;
	}		}

ZnwRgr at 02:28, 1 July 2007

2007-07-01T02:28:08Z

← Older revision		Revision as of 02:28, 1 July 2007
Line 56:		Line 56:

	L = (ULLONG *)buffer;		L = (ULLONG *)buffer;
	R = (ULLONG *)(buffer+8);		R = (ULLONG *)(buffer 8);

	/Put the data into host byte order/		/Put the data into host byte order/
Line 65:		Line 65:
	for (i=rounds;i>=1;i--)		for (i=rounds;i>=1;i--)
	{		{
	R = rrotate(R - S[2i+1] , L ) ^ *L;		R = rrotate(R - S[2i 1] , L ) ^ *L;
	L = rrotate(L - S[2i], R) ^ *R;		L = rrotate(L - S[2i], R) ^ *R;
	}		}
Line 89:		Line 89:
	for (i=this.m_rounds;i>=1;i--)		for (i=this.m_rounds;i>=1;i--)
	{		{
	R = RRotate(R - this.m_S[2*i+1] , L ) ^ L;		R = RRotate(R - this.m_S[2*i 1] , L ) ^ L;
	L = RRotate(L - this.m_S[2*i], R) ^ R;		L = RRotate(L - this.m_S[2*i], R) ^ R;
	}		}

Scott: Undo revision 20263 by Special:Contributions/HaeH4p (User talk:HaeH4p)

2007-06-07T15:06:59Z

Undo revision 20263 by Special:Contributions/HaeH4p (User talk:HaeH4p)

← Older revision		Revision as of 15:06, 7 June 2007
Line 56:		Line 56:

	L = (ULLONG *)buffer;		L = (ULLONG *)buffer;
	R = (ULLONG *)(buffer 8);		R = (ULLONG *)(buffer+8);

	/Put the data into host byte order/		/Put the data into host byte order/
Line 65:		Line 65:
	for (i=rounds;i>=1;i--)		for (i=rounds;i>=1;i--)
	{		{
	R = rrotate(R - S[2i 1] , L ) ^ *L;		R = rrotate(R - S[2i+1] , L ) ^ *L;
	L = rrotate(L - S[2i], R) ^ *R;		L = rrotate(L - S[2i], R) ^ *R;
	}		}
Line 89:		Line 89:
	for (i=this.m_rounds;i>=1;i--)		for (i=this.m_rounds;i>=1;i--)
	{		{
	R = RRotate(R - this.m_S[2*i 1] , L ) ^ L;		R = RRotate(R - this.m_S[2*i+1] , L ) ^ L;
	L = RRotate(L - this.m_S[2*i], R) ^ R;		L = RRotate(L - this.m_S[2*i], R) ^ R;
	}		}

HaeH4p at 07:05, 7 June 2007

2007-06-07T07:05:28Z

← Older revision		Revision as of 07:05, 7 June 2007
Line 56:		Line 56:

	L = (ULLONG *)buffer;		L = (ULLONG *)buffer;
	R = (ULLONG *)(buffer+8);		R = (ULLONG *)(buffer 8);

	/Put the data into host byte order/		/Put the data into host byte order/
Line 65:		Line 65:
	for (i=rounds;i>=1;i--)		for (i=rounds;i>=1;i--)
	{		{
	R = rrotate(R - S[2i+1] , L ) ^ *L;		R = rrotate(R - S[2i 1] , L ) ^ *L;
	L = rrotate(L - S[2i], R) ^ *R;		L = rrotate(L - S[2i], R) ^ *R;
	}		}
Line 89:		Line 89:
	for (i=this.m_rounds;i>=1;i--)		for (i=this.m_rounds;i>=1;i--)
	{		{
	R = RRotate(R - this.m_S[2*i+1] , L ) ^ L;		R = RRotate(R - this.m_S[2*i 1] , L ) ^ L;
	L = RRotate(L - this.m_S[2*i], R) ^ R;		L = RRotate(L - this.m_S[2*i], R) ^ R;
	}		}

Scott: Reverted edits by Hw7Ir8 (Talk); changed back to last version by Xnera

2007-04-11T06:04:06Z

Reverted edits by Hw7Ir8 (Talk); changed back to last version by Xnera

← Older revision		Revision as of 06:04, 11 April 2007
Line 56:		Line 56:

	L = (ULLONG *)buffer;		L = (ULLONG *)buffer;
	R = (ULLONG *)(buffer 8);		R = (ULLONG *)(buffer+8);

	/Put the data into host byte order/		/Put the data into host byte order/
Line 65:		Line 65:
	for (i=rounds;i>=1;i--)		for (i=rounds;i>=1;i--)
	{		{
	R = rrotate(R - S[2i 1] , L ) ^ *L;		R = rrotate(R - S[2i+1] , L ) ^ *L;
	L = rrotate(L - S[2i], R) ^ *R;		L = rrotate(L - S[2i], R) ^ *R;
	}		}
Line 89:		Line 89:
	for (i=this.m_rounds;i>=1;i--)		for (i=this.m_rounds;i>=1;i--)
	{		{
	R = RRotate(R - this.m_S[2*i 1] , L ) ^ L;		R = RRotate(R - this.m_S[2*i+1] , L ) ^ L;
	L = RRotate(L - this.m_S[2*i], R) ^ R;		L = RRotate(L - this.m_S[2*i], R) ^ R;
	}		}

Hw7Ir8 at 20:56, 10 April 2007

2007-04-10T20:56:34Z

← Older revision		Revision as of 20:56, 10 April 2007
Line 56:		Line 56:

	L = (ULLONG *)buffer;		L = (ULLONG *)buffer;
	R = (ULLONG *)(buffer+8);		R = (ULLONG *)(buffer 8);

	/Put the data into host byte order/		/Put the data into host byte order/
Line 65:		Line 65:
	for (i=rounds;i>=1;i--)		for (i=rounds;i>=1;i--)
	{		{
	R = rrotate(R - S[2i+1] , L ) ^ *L;		R = rrotate(R - S[2i 1] , L ) ^ *L;
	L = rrotate(L - S[2i], R) ^ *R;		L = rrotate(L - S[2i], R) ^ *R;
	}		}
Line 89:		Line 89:
	for (i=this.m_rounds;i>=1;i--)		for (i=this.m_rounds;i>=1;i--)
	{		{
	R = RRotate(R - this.m_S[2*i+1] , L ) ^ L;		R = RRotate(R - this.m_S[2*i 1] , L ) ^ L;
	L = RRotate(L - this.m_S[2*i], R) ^ R;		L = RRotate(L - this.m_S[2*i], R) ^ R;
	}		}

Xnera: adding COTW tag

2006-07-05T18:53:33Z

adding COTW tag

← Older revision		Revision as of 18:53, 5 July 2006
Line 1:		Line 1:
			{{COTW}}

	As far as I can tell "Assault on 13th Labour" are attacking the wrong cipher. They are attacking standard RC5 - that is, RC5-32/12/8 - when they should be attacking the nonstandard variant RC5-64/12/8. [[User:Ciphergoth\|Ciphergoth]] 09:00, 3 June 2006 (PDT)		As far as I can tell "Assault on 13th Labour" are attacking the wrong cipher. They are attacking standard RC5 - that is, RC5-32/12/8 - when they should be attacking the nonstandard variant RC5-64/12/8. [[User:Ciphergoth\|Ciphergoth]] 09:00, 3 June 2006 (PDT)

Lhall at 17:35, 23 June 2006

2006-06-23T17:35:22Z

← Older revision		Revision as of 17:35, 23 June 2006
Line 105:		Line 105:

	[[User:Chimera245\|Chimera245]] 23rd June 2006 (PDT)		[[User:Chimera245\|Chimera245]] 23rd June 2006 (PDT)



			:Hey, y'all...let me make it totally clear that I know -nothing- about the technical side of this, so the following comments are from an outsider's perspective. My thoughts are first, that MC are definitely aware of our efforts, and if we were doing this monumental undertaking on the wrong kind of cipher, they certainly would have had one of the characters slip it into a blog post, or even have done a Sentinel article on it, if they really wanted to get our attention. Second, it can probably be resolved by e-mailing them to ask...I'd go for Kurt or Adrian. Hope that helps! -[[User:Lhall\|Lhall]] 10:35, 23 June 2006 (PDT)

Chimera245 at 04:15, 23 June 2006

2006-06-23T04:15:51Z

← Older revision		Revision as of 04:15, 23 June 2006
Line 15:		Line 15:
	:I am familiar with this notation (I'm a cryptographer) but it's not standard for block ciphers in general - it's specific to RC5. RC5-32/12/8 processes 64 bits at a time. RC5-64/12/8 would process 128 bits at a time. The number is half what you would expect because RC5 splits the input into two halves and each half acts on the other. I have checked the original RC5 paper - I recommend you do the same if you think I'm mistaken. Thanks! [[User:Ciphergoth\|Ciphergoth]] 02:37, 22 June 2006 (PDT)		:I am familiar with this notation (I'm a cryptographer) but it's not standard for block ciphers in general - it's specific to RC5. RC5-32/12/8 processes 64 bits at a time. RC5-64/12/8 would process 128 bits at a time. The number is half what you would expect because RC5 splits the input into two halves and each half acts on the other. I have checked the original RC5 paper - I recommend you do the same if you think I'm mistaken. Thanks! [[User:Ciphergoth\|Ciphergoth]] 02:37, 22 June 2006 (PDT)

	:Hi I thought I made it clear earlier with the description of RCCRYPT a processing data in two 64 bit words at a time, but the RCCRYPT source, and the 13th labour client both process the data correctly - as RC5-64. I posted a more detailed explanation on UNFICTION - which you probably haven't seen. Much cut and pastage follows, but the complete link is [http://forums.unfiction.com/forums/viewtopic.php?p=246273#246273 here]		Hi
			I thought I made it clear earlier with the description of RCCRYPT a processing data in two 64 bit words at a time, but the RCCRYPT source, and the 13th labour client both process the data correctly - as RC5-64. I posted a more detailed explanation on UNFICTION - which you probably haven't seen. I am wondering where you are getting your information that we are doing otherwise?

			Much cut and pastage follows, but the complete link is [http://forums.unfiction.com/forums/viewtopic.php?p=246273#246273 here]

	<QUOTE>		<QUOTE>

Chimera245 at 04:13, 23 June 2006

2006-06-23T04:13:09Z

← Older revision		Revision as of 04:13, 23 June 2006
Line 14:		Line 14:

	:I am familiar with this notation (I'm a cryptographer) but it's not standard for block ciphers in general - it's specific to RC5. RC5-32/12/8 processes 64 bits at a time. RC5-64/12/8 would process 128 bits at a time. The number is half what you would expect because RC5 splits the input into two halves and each half acts on the other. I have checked the original RC5 paper - I recommend you do the same if you think I'm mistaken. Thanks! [[User:Ciphergoth\|Ciphergoth]] 02:37, 22 June 2006 (PDT)		:I am familiar with this notation (I'm a cryptographer) but it's not standard for block ciphers in general - it's specific to RC5. RC5-32/12/8 processes 64 bits at a time. RC5-64/12/8 would process 128 bits at a time. The number is half what you would expect because RC5 splits the input into two halves and each half acts on the other. I have checked the original RC5 paper - I recommend you do the same if you think I'm mistaken. Thanks! [[User:Ciphergoth\|Ciphergoth]] 02:37, 22 June 2006 (PDT)

			:Hi I thought I made it clear earlier with the description of RCCRYPT a processing data in two 64 bit words at a time, but the RCCRYPT source, and the 13th labour client both process the data correctly - as RC5-64. I posted a more detailed explanation on UNFICTION - which you probably haven't seen. Much cut and pastage follows, but the complete link is [http://forums.unfiction.com/forums/viewtopic.php?p=246273#246273 here]

			<QUOTE>
			There has been some discussion in places that we MAY not be performing the correct RC5 decryption process. In fact this morning I had my own doubts.

			SO, I talked to the organ grinder (not the monkey) as it were, and referred to the original paper - to confirm once and for all in my own mind that all was well:

			http://theory.lcs.mit.edu/~rivest/Rivest-rc5.pdf

			I would like to answer this one and for all now.

			To quote from the paper:

			As noted above� RC� is word�oriented� all of the basic computational oper�
			ations have w�bit words as inputs and outputs� RC� is a block�cipher with a
			two�word input �plaintext� block size and a two�word �ciphertext� output block
			size�

			The 64/12/8 refers to the following

			w/r/b

			w == Word Size (64 bits)
			r == Number of Rounds
			b == Number of Bytes in Key

			The RCCRYPT package, which I used to base my code on, and is the subject of Von's hint, uses EXACTLY this pattern.

			I know a few of you have reviewed the code privately, but just to quell any further speculation, here is, size by side, the code from RCCRYPT and my code for open comparison:

			RCCRYPT:

			/now we have sixteen bytes ready to work on/
			/split it into two ULLONGs, left and right/

			L = (ULLONG *)buffer;
			R = (ULLONG *)(buffer+8);

			/Put the data into host byte order/
			L = ntohll (L);
			R = ntohll (R);

			/decrypt the data.../
			for (i=rounds;i>=1;i--)
			{
			R = rrotate(R - S[2i+1] , L ) ^ *L;
			L = rrotate(L - S[2i], R) ^ *R;
			}
			*L -= S[0];
			*R -= S[1];

			/Convert buffer back to network order/
			L = htonll(L);
			R = htonll(R);

			And my DLL:

			L = System.BitConverter.ToUInt64(buffer,0);
			R = System.BitConverter.ToUInt64(buffer,8);

			if (this.m_clientType == 1)
			{
			L = NToHLL(L);
			R = NToHLL(R);
			}

			//decrypt the data
			for (i=this.m_rounds;i>=1;i--)
			{
			R = RRotate(R - this.m_S[2*i+1] , L ) ^ L;
			L = RRotate(L - this.m_S[2*i], R) ^ R;
			}

			L -= this.m_S[0];
			R -= this.m_S[1];

			if (this.m_clientType == 1)
			{
			L = HToNLL(L);
			R = HToNLL(R);
			}


			Hopefully this can now move on.
			<END QUOTE>

			[[User:Chimera245\|Chimera245]] 23rd June 2006 (PDT)