Math 485: Mathematical Cryptography - Revision history

Ls5: /* Prerequisites */

2019-08-22T20:26:37Z

‎Prerequisites

Ls5: /* Prerequisite */

2019-08-22T20:25:38Z

‎Prerequisite

Ls5: /* Offered */

2012-10-30T14:43:56Z

‎Offered

AAEmpty: moved Math 485 to Math 485: Mathematical Cryptography

2011-01-19T22:22:53Z

moved Math 485 to Math 485: Mathematical Cryptography

Cpg: /* Minimal learning outcomes */

2010-07-28T16:18:20Z

‎Minimal learning outcomes

Pmj5 at 20:15, 18 February 2010

2010-02-18T20:15:36Z

Cpg at 18:40, 4 June 2009

2009-06-04T18:40:19Z

Cpg at 18:39, 4 June 2009

2009-06-04T18:39:12Z

Pmj5 at 22:30, 19 August 2008

2008-08-19T22:30:49Z

Pmj5: Added additional topics

2008-08-19T22:20:10Z

Added additional topics

@@ Line 27: / Line 27: @@
 === Prerequisites ===
-The requirement for [[Math 313]] ensures both an appropriate level of mathematical maturity and a basic knowledge of linear algebra.  The recommendation for [[Math 371]] encourages students to be familiar with the concepts of groups, rings, and fields.
+The requirement for [[Math 213]] ensures both an appropriate level of mathematical maturity and a basic knowledge of linear algebra.  The recommendation for [[Math 371]] encourages students to be familiar with the concepts of groups, rings, and fields.
 === Minimal learning outcomes ===

@@ Line 13: / Line 13: @@
 === Prerequisite ===
-[[Math 313]].
+[[Math 213]].
 === Recommended ===

@@ Line 8: / Line 8: @@
 === Offered ===
-−
+F
 <!-- Inaccurate.  Recently offered Fall 2009; scheduled to be offered Fall 2010. -->
 === Prerequisite ===
 [[Math 313]].

← Older revision		Revision as of 16:18, 28 July 2010
Line 57:		Line 57:

	</div>		</div>
		+	=== Textbooks ===
		+
		+	Possible textbooks for this course include (but are not limited to):
		+
		+	*

	=== Additional topics ===		=== Additional topics ===

@@ Line 10: / Line 10: @@
+W
 === Prerequisite ===
 [[Math 313]].
@@ Line 21: / Line 22: @@
 == Desired Learning Outcomes ==
-This is a course in the mathematics and algorithms of modern cryptography. It complements, rather than being equivalent to, the current CS course on Computer Security (CS 465).
+This is a course in the mathematics and algorithms of modern cryptography. It complements, rather than being equivalent to, the current CS course on Computer Security (CS 465) and the current Information Technology course on Encryption and Compression (IT 531).
 === Prerequisites ===
-The requirement for [[Math 371]] ensures both an appropriate level of mathematical maturity and a basic knowledge of linear algebra.
+The requirement for [[Math 313]] ensures both an appropriate level of mathematical maturity and a basic knowledge of linear algebra.  The recommendation for [[Math 371]] encourages students to be familiar with the concepts of groups, rings, and fields.
 === Minimal learning outcomes ===
-The student should gain a understanding of the following topics. In particular this includes knowing the definitions, being familiar with standard examples, and being able to solve mathematical and algorithmic problems by directly using the material taught in the course. This includes appropriate use of Maple, Mathematica or Matlab.
+The student should gain a understanding of the following topics. In particular this includes knowing the definitions, being familiar with standard examples, and being able to solve mathematical and algorithmic problems by directly using the material taught in the course. This includes appropriate use of Maple, Mathematica, or another appropriate computing language.
 <div style="-moz-column-count:2; column-count:2;">
@@ Line 44: / Line 45: @@
 #* Legendre and Jacobi symbols
 #* Elementary continued fractions
-#* Simple discussion of finite fields.
+#* Simple discussion of finite fields
-# The DES and AES encryption standards.
+# The DES and AES encryption standards
-# RSA and its strengths and weaknesses; attacks on RSA.
+# RSA and its strengths and weaknesses; attacks on RSA
-#* Wiener's continued fraction attack on low decryption exponent.
+#* Wiener's continued fraction attack on low decryption exponent
-# Primality testing algorithms.
+# Primality testing algorithms
-# Factorization techniques.
+# Factorization techniques
-#* The Quadratic Sieve.
+#* The Quadratic Sieve
-# Discrete logarithms. Diffie-Hellman key exchange. ElGamal.
+# Discrete logarithms
-# Lattices and Lattice Algorithms. The LLL algorithm. The NTRU system. Lattice attacks on RSA.
+#* Diffie-Hellman key exchange
 </div>
 === Additional topics ===
-If time allows, additional topics may include, but are not limited to: Elliptic curve cryptography, birthday attacks and probability, quantum cryptography (key distribution, Shor's algorithm), hash functions, digital signatures.
+If time allows, additional topics may include, but are not limited to: Elliptic curve cryptography, birthday attacks and probability, quantum cryptography (key distribution, Shor's algorithm), hash functions, digital signatures, and lattices and lattice algorithms (LLL algorithm, NTRU system, lattice attacks on RSA).
 === Courses for which this course is prerequisite ===

← Older revision	Revision as of 22:22, 19 January 2011
(No difference)

@@ Line 2: / Line 2: @@
 === Title ===
-Introduction to Cryptography.
+Mathematical Cryptography.
 === (Credit Hours:Lecture Hours:Lab Hours) ===
 (3:3:0)
 === Prerequisite ===
-[[Math 371]].
+[[Math 313]].
 === Description ===

@@ Line 36: / Line 36: @@
 #* Fermat and Euler Theorems
 #* Primitive roots
 #* Elementary continued fractions
 #* Simple discussion of finite fields.