RC6

RC6

The Feistel function of the RC6 algorithm.
General
Designers	Ron Rivest, Matt Robshaw, Ray Sidney, Yiqun Lisa Yin
First published	1998
Derived from	RC5
Certification	AES finalist
Cipher detail
Key sizes	128, 192, or 256 bits
Block sizes	128 bits
Structure	Feistel network (Type 2)
Rounds	20

In cryptography, RC6 is a symmetric key block cipher derived from RC5. It was designed by Ron Rivest, Matt Robshaw, Ray Sidney, and Yiqun Lisa Yin to meet the requirements of the Advanced Encryption Standard (AES) competition. The algorithm was one of the five finalists, and also was submitted to the NESSIE and CRYPTREC projects. It was a proprietary algorithm, patented by RSA Security. According to Ron Rivest, the RC stands for Ron's Code, but the RC documentation says simply RC6.

RC6 proper has a block size of 128 bits and supports key sizes of 128, 192, and 256 bits up to 2040-bits, but, like RC5, it may be parameterised to support a wide variety of word-lengths, key sizes, and number of rounds. RC6 is very similar to RC5 in structure, using data-dependent rotations, modular addition, and XOR operations; in fact, RC6 could be viewed as interweaving two parallel RC5 encryption processes, although RC6 does use an extra multiplication operation not present in RC5 in order to make the rotation dependent on every bit in a word, and not just the least significant few bits.

Encryption/decryption

The key expansion algorithm is practically identical to that of RC5. The only difference is that for RC6, more words are derived from the user-supplied key.

// Encryption/Decryption with RC6-w/r/b
// 
// Input:   Plaintext stored in four w-bit input registers A, B, C & D
// 	r is the number of rounds
// 	w-bit round keys S[0, ... , 2r + 3]
// 
// Output: Ciphertext stored in A, B, C, D
// 
// '''Encryption Procedure:'''

	B = B + S[0]
	D = D + S[1]
	for i = 1 to r do
	{
		t = (B * (2B + 1)) <<< lg w
		u = (D * (2D + 1)) <<< lg w
		A = ((A ^ t) <<< u) + S[2i]
		C = ((C ^ u) <<< t) + S[2i + 1] 
		(A, B, C, D)  =  (B, C, D, A)
	}
	A = A + S[2r + 2]
	C = C + S[2r + 3]

// '''Decryption Procedure:'''

	C = C - S[2r + 3]
	A = A - S[2r + 2]
	for i = r downto 1 do
	{
		(A, B, C, D) = (D, A, B, C)
		u = (D * (2D + 1)) <<< lg w
		t = (B * (2B + 1)) <<< lg w
		C = ((C - S[2i + 1]) >>> t) ^ u
		A = ((A - S[2i]) >>> u) ^ t
	}
	D = D - S[1]
	B = B - S[0]

Possible use in NSA "implants"

In August 2016, code reputed to be Equation Group or NSA "implants" for various network security devices was disclosed. The accompanying instructions revealed that some of these programs use RC6 for confidentiality of network communications.

Licensing

As RC6 was not selected for the AES, it was not guaranteed that RC6 is royalty-free. As of January 2017, a web page on the official web site of the designers of RC6, RSA Laboratories, states the following:

"We emphasize that if RC6 is selected for the AES, RSA Security will not require any licensing or royalty payments for products using the algorithm".

The emphasis on the word "if" suggests that RSA Security Inc. may have required licensing and royalty payments for any products using the RC6 algorithm. RC6 was a patented encryption algorithm (U.S. patent 5724428 and U.S. patent 5835600); however, the patents expired between 2015 and 2017.

Bibliography

• Pavan, R.L.; Robshaw, M.J.B.; Sidney, R.; Yin., Y.L. (1998-08-20). "The RC6 Block Cipher" (PDF). v1.1. Archived from the original (PDF) on 2018-12-23. Retrieved 2015-08-02.

• Beuchat, Jean-Luc. "FPGA Implementations of the RC6 Block Cipher" (PDF). Archived from the original (PDF) on 2006-05-05.

• Thompson, Iain (2013-12-31). "How the NSA hacks PCs, phones, routers, hard disks 'at speed of light': Spy tech catalog leaks". The Register. Retrieved 2015-08-02.

External links

• "Cryptography - 256 bit Ciphers: Reference source code and submissions to international cryptographic designs contests".

• "Symmetric Ciphers: RC6". Standard Cryptographic Algorithm Naming (SCAN). 2009-04-15.

• "RC6® Block Cipher". RSA Laboratories. Archived from the original on 2016-03-04.