MAT5133 - Revision history

Juan.gutierrez3: /* Mathematical Biology - MAT4133/5133 */ Added catalog entry

2023-03-31T02:17:33Z

Mathematical Biology - MAT4133/5133: Added catalog entry

Juan.gutierrez3 at 14:17, 24 March 2023

2023-03-24T14:17:58Z

Show changes

Eduardo.duenez: MAT5133 is Math Bio!

2023-03-23T19:29:08Z

MAT5133 is Math Bio!

Jose.iovino at 16:15, 22 March 2023

2023-03-22T16:15:02Z

Jose.iovino at 16:14, 22 March 2023

2023-03-22T16:14:34Z

Jose.iovino at 16:10, 22 March 2023

2023-03-22T16:10:33Z

Jose.iovino: Created page with "Introduction to post-quantum Cryptography."

2023-03-22T15:48:44Z

Created page with "Introduction to post-quantum Cryptography."

New page

Introduction to post-quantum Cryptography.

@@ Line 1: / Line 1: @@
-=Mathematical Biology - MAT4133/5133=
+==Mathematical Biology - MAT4133/5133==
-The Mathematical Biology course is a broad introduction to nonlinear dynamics. Students are assumed to have an operative knowledge of single-variable calculus. Topics are introduced with interrelated biological examples of increasing difficulty. Students are exposed to discrete and continuous models. The mathematical content of the class includes: Flows on the line, linear stability analysis, matrix operations and eigenvalues, flows on the plane, bifurcations, discrete dynamical systems, and higher-dimensional systems. The biological problems studied include: Molecular processes (glycolysis, lactose operon, etc.), physiological processes (single neuron), and ecological processes (predator-prey, competing species, infectious disease modeling).
+''Prerequisite'': [[MAT1214]]/[[MAT1213]] Calculus I.
 Suggested text(s) and/or readings:

← Older revision		Revision as of 19:29, 23 March 2023
Line 1:		Line 1:
−	~~Introduction to post-quantum Cryptography.~~	+	Mathematical Biology.
−
−
−	~~'''Sample textbook''':~~
−
−	~~[1] Daniel Bernstein, Johannes Buchmann, Erik Dahmen, ''Post-Quantum Cryptography'', Springer, 2010.~~
−
−
−
−
−	~~'''Catalog entry'''~~
−
−	~~''Prerequisite'': Algebra and Number Systems (MAT 1313), or Discrete~~ Mathematical ~~Structures (CS 2233/2231), or instructor consent.~~
−
−	~~''Contents'':~~
−	~~(1) Introduction to post-quantum cryptography.~~
−	~~(2) Quantum computing.~~
−	~~(3) Hash-based Digital Signature Schemes.~~
−	~~(4) Code-based cryptography.~~
−	~~(5) Lattice-based Cryptography~~
−	~~(6) Multivariate Public Key Cryptography.~~
−	~~(7) Homomorphic encryption.~~
−
−
−
−
−
−
−	~~==Topics List==~~
−	~~{\| class="wikitable sortable"~~
−	~~! Week !! Topic !! Chapter 1 from the Bernstein-Johannes Buchmann-Dahmen book !! MAT1313, or CS2233/2231, or instructor consent.~~
−	\|-
−	~~\| 1-3~~
−	~~\|\| [[Introduction to post-quantum cryptography]]~~
−	~~\|\| 1~~
−	~~\|\| MAT1313 or CS2233/2231, or equivalent~~.
−	\|-
−	~~\| 2-4~~
−	~~\|\| [[Quantum computing]]~~
−	~~\|\| 2~~
−	\|\|
−	\|-
−	~~\| 5-6~~
−	~~\|\| [[Hash-based Digital Signature Schemes]]~~
−	~~\|\| 3~~
−	\|\|
−	\|-
−	~~\| 7-8~~
−	~~\|\| [[Code-based cryptography]]~~
−	~~\|\| 4~~
−	\|\|
−	\|-
−	~~\| 9-10~~
−	~~\|\| [[Lattice-based Cryptography]]~~
−	~~\|\| 5~~
−	\|\|
−	\|-
−	~~\| 11-12~~
−	~~\|\| [[Multivariate Public Key Cryptography]]~~
−	~~\|\| 6~~
−	\|\|
−	\|-
−	~~\| 13-end~~
−	~~\|\| [[Homomorphic encryption]]~~
−	\|\|
−	\|\|
−	\|}

← Older revision		Revision as of 16:15, 22 March 2023
Line 4:		Line 4:
	'''Sample textbook''':		'''Sample textbook''':

−	[1] Daniel Bernstein, Johannes Buchmann, Erik Dahmen, ''Post-Quantum Cryptography'', Springer, ~~201-~~	+	[1] Daniel Bernstein, Johannes Buchmann, Erik Dahmen, ''Post-Quantum Cryptography'', Springer, 2010.

@@ Line 14: / Line 14: @@
 ''Contents'':
-(1) Propositional logic: Axioms and Rules of Inference. Boolean Algebras. Limitations of propositional logic: Informal introduction to quantifiers and syllogisms.
+(1) Introduction to post-quantum cryptography.
-(2) Predicate Logic: Existential and universal quantification, free variables and substitutions. Discussion of the various axiomatic systems for first-order logic (including axioms and rules of inference). The power and the limitations of axiomatic systems for logic: Informal discussion of the completeness and incompleteness theorems.
+(2) Quantum computing.
-(3)Sets and boolean algebras: Operations on sets. Correspondence between finitary set operations and propositional logic. Correspondence between infinitary operations and quantifiers. The power and limitations of the language of set theory: Informal discussion of the set-theoretic paradoxes and the need for axiomatic systems for set theory.
+(3) Hash-based Digital Signature Schemes.
-(4) Relations: Properties of relations. Special relations: Equivalence relations, partially ordered sets, totally ordered sets.
+(4) Code-based cryptography.
-(5) Functions: Operations of functions, direct image and inverse image.
+(5) Lattice-based Cryptography
-(6) Well-ordered sets: Correspondence between well-ordering relations and induction. Correspondence between well-ordering relations and choice functions.
+(6) Multivariate Public Key Cryptography.
-(7) Introduction to computability. Classical models of computation (recursive functions, and Turing models). Limitations of computation (the Halting Problem, the busy beaver problem, fast-growing functions). Contemporary models of computation.
+(7) Homomorphic encryption.
@@ Line 63: / Line 63: @@
 |  13-end
 || [[Homomorphic encryption]]
-|| 7
+||
 ||
 |}

← Older revision		Revision as of 16:10, 22 March 2023
Line 1:		Line 1:
	Introduction to post-quantum Cryptography.		Introduction to post-quantum Cryptography.
		+
		+
		+	'''Sample textbook''':
		+
		+	[1] Daniel Bernstein, Johannes Buchmann, Erik Dahmen, ''Post-Quantum Cryptography'', Springer, 201-
		+
		+
		+
		+
		+	'''Catalog entry'''
		+
		+	''Prerequisite'': Algebra and Number Systems (MAT 1313), or Discrete Mathematical Structures (CS 2233/2231), or instructor consent.
		+
		+	''Contents'':
		+	(1) Propositional logic: Axioms and Rules of Inference. Boolean Algebras. Limitations of propositional logic: Informal introduction to quantifiers and syllogisms.
		+	(2) Predicate Logic: Existential and universal quantification, free variables and substitutions. Discussion of the various axiomatic systems for first-order logic (including axioms and rules of inference). The power and the limitations of axiomatic systems for logic: Informal discussion of the completeness and incompleteness theorems.
		+	(3)Sets and boolean algebras: Operations on sets. Correspondence between finitary set operations and propositional logic. Correspondence between infinitary operations and quantifiers. The power and limitations of the language of set theory: Informal discussion of the set-theoretic paradoxes and the need for axiomatic systems for set theory.
		+	(4) Relations: Properties of relations. Special relations: Equivalence relations, partially ordered sets, totally ordered sets.
		+	(5) Functions: Operations of functions, direct image and inverse image.
		+	(6) Well-ordered sets: Correspondence between well-ordering relations and induction. Correspondence between well-ordering relations and choice functions.
		+	(7) Introduction to computability. Classical models of computation (recursive functions, and Turing models). Limitations of computation (the Halting Problem, the busy beaver problem, fast-growing functions). Contemporary models of computation.
		+
		+
		+
		+
		+
		+
		+	==Topics List==
		+	{\| class="wikitable sortable"
		+	! Week !! Topic !! Chapter 1 from the Bernstein-Johannes Buchmann-Dahmen book !! MAT1313, or CS2233/2231, or instructor consent.
		+	\|-
		+	\| 1-3
		+	\|\| [[Introduction to post-quantum cryptography]]
		+	\|\| 1
		+	\|\| MAT1313 or CS2233/2231, or equivalent.
		+	\|-
		+	\| 2-4
		+	\|\| [[Quantum computing]]
		+	\|\| 2
		+	\|\|
		+	\|-
		+	\| 5-6
		+	\|\| [[Hash-based Digital Signature Schemes]]
		+	\|\| 3
		+	\|\|
		+	\|-
		+	\| 7-8
		+	\|\| [[Code-based cryptography]]
		+	\|\| 4
		+	\|\|
		+	\|-
		+	\| 9-10
		+	\|\| [[Lattice-based Cryptography]]
		+	\|\| 5
		+	\|\|
		+	\|-
		+	\| 11-12
		+	\|\| [[Multivariate Public Key Cryptography]]
		+	\|\| 6
		+	\|\|
		+	\|-
		+	\| 13-end
		+	\|\| [[Homomorphic encryption]]
		+	\|\| 7
		+	\|\|
		+	\|}