Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Number theory - OPBM2M118A

Title:	Teorie čísel
Guaranteed by:	Katedra matematiky a didaktiky matematiky (41-KMDM)
Faculty:	Faculty of Education
Actual:	from 2019 to 2020
Semester:	summer
E-Credits:	3
Examination process:	summer s.:
Hours per week, examination:	summer s.:2/0, Ex [HT]
Capacity:	20 / unknown (unknown)
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time
Note:	course can be enrolled in outside the study plan enabled for web enrollment priority enrollment if the course is part of the study plan

Guarantor:	doc. RNDr. Antonín Jančařík, Ph.D.
Teacher(s):	doc. RNDr. Antonín Jančařík, Ph.D.

Opinion survey results Examination dates SS schedule Noticeboard

Annotation -

Last update: JANCARIK/PEDF.CUNI.CZ (30.09.2008)

Introduction to the history of cryptography, cryptoanalysis and number theory.

Aim of the course -

Last update: JANCARIK/PEDF.CUNI.CZ (30.09.2008)

To acquaint students with history of cryptography and cryptoanalysis and the foundations of the theory of numbers (primality tests and factorization), including specific applications in cryptology - RSA.

Literature -

Last update: JANCARIK/PEDF.CUNI.CZ (30.09.2008)

Koblitz, N. A Course in Numer Theory and Cryptography, Springer-Verlag, 1998, ISBN 0-387-94293-9

Piper, F., Murény, S. Kryptografie, Praha: Dokořán, 2006, ISBN 80-7363-074-

Rosen, H. Elementary Number Theory and Its Applications, Addison-Wesley, 2000, ISBN: 0201870738

Teaching methods -

Last update: JANCARIK/PEDF.CUNI.CZ (30.09.2008)

Seminar

Requirements to the exam - Czech

Last update: JANCARIK/PEDF.CUNI.CZ (20.02.2015)

Zápočet bude udělen na základě výsledků dvou písemek.

Při odevzdávání materiálů v průběhu zkouškového se musí student dostavit k ústnímu termínu zkoušky/zápočtu.

Syllabus -

Last update: JANCARIK/PEDF.CUNI.CZ (26.02.2013)

Main topics:

Divisibility and Euclidean algorithm

The final fields

Primes and pseudoprimes

Primality tests

Factorizations

RSA