D.11: Coding Theory, Compression and Cryptography

From

Revision as of 22:03, 21 February 2010 (view source) Mitchfry (Talk | contribs) m (Created page with '== Discrete Math Learning modules == <br/><br/>') ← Older edit		Revision as of 23:29, 31 July 2010 (view source) Poul.murtha (Talk | contribs) Newer edit →
Line 2:		Line 2:
	<br/><br/>		<br/><br/>
		+
		+
		+	'''D.11 Coding Theory, Compression and Cryptography:''' Understand coding of
		+	alphabets and simple encryption methods.
		+
		+	D.11.1 Use integer functions to encode alphabets and to create error-checking
		+	correcting codes.
		+
		+	D.11.2 Use permutations, combinations of digraph encoding and affine
		+	transformation and hash functions, to create encryption codes.
		+
		+	D.11.3 Demonstrate understanding of asymmetric public key cryptography
		+	algorithms such as RSA and Diffie-Hellman.
		+
		+	D.11.4 Demonstrate understanding of error-detecting and error-correcting codes and
		+	data compression through Huffman codes.

---

Revision as of 23:29, 31 July 2010

Discrete Math Learning modules

D.11 Coding Theory, Compression and Cryptography: Understand coding of alphabets and simple encryption methods.

D.11.1 Use integer functions to encode alphabets and to create error-checking correcting codes.

D.11.2 Use permutations, combinations of digraph encoding and affine transformation and hash functions, to create encryption codes.

D.11.3 Demonstrate understanding of asymmetric public key cryptography algorithms such as RSA and Diffie-Hellman.

D.11.4 Demonstrate understanding of error-detecting and error-correcting codes and data compression through Huffman codes.