SF2714 Discrete Mathematics and Algebra 7.5 hp KTH, period 2, Fall 2009 Course coordinator: Jakob Jonsson –

Slides:



Advertisements
Similar presentations
Mathematics of Cryptography Part II: Algebraic Structures
Advertisements

Cryptography and Network Security
Chapter 4 Finite Fields. Introduction of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key concern operations on “numbers”
Chapter 4 – Finite Fields. Introduction will now introduce finite fields of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key.
1 Counting Perfect Matchings of a Graph It is hard in general to count the number of perfect matchings in a graph. But for planar graphs it can be done.
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Group THeory Bingo You must write the slide number on the clue to get credit.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/4/01.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2002 Review Lecture Tuesday, 12/10/02.
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
Lecture 3.2: Public Key Cryptography II CS 436/636/736 Spring 2012 Nitesh Saxena.
ALGEBRAIC PROPERTIES Image from Let’s Keep Those Equations Balanced!
ⅠIntroduction to Set Theory 1. Sets and Subsets
M. Khalily Dermany Islamic Azad University.  finite number of element  important in number theory, algebraic geometry, Galois theory, cryptography,
MTH-376 Algebra Lecture 1. Instructor: Dr. Muhammad Fazeel Anwar Assistant Professor Department of Mathematics COMSATS Institute of Information Technology.
Signal-Space Analysis ENSC 428 – Spring 2008 Reference: Lecture 10 of Gallager.
FINITE FIELDS 7/30 陳柏誠.
Review of basic concepts and facts in linear algebra Matrix HITSZ Instructor: Zijun Luo Fall 2012.
1 Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown Chapter 4 – Finite Fields.
Information Security and Management 4. Finite Fields 8
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Gems of Algebra: The secret life of the symmetric group
Coding Theory. p2. Why encode data? Three reasons to encode data that is about to be transmitted(through space) or stored(in a computer): 1. For efficiency.
Chapter 4 – Finite Fields
With your host… Alan Quebec. Group theory Orbits and counting Coding theoryPotpourri $100 $200 $300 $400 $500.
Data Security and Encryption (CSE348) 1. Lecture # 12 2.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
Chapter 2: Groups Definition and Examples of Groups
Great Theoretical Ideas in Computer Science.
Great Theoretical Ideas in Computer Science for Some.
 Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder notion, Recursive definition  , ,  
Introduction – Sets of Numbers (9/4) Z - integers Z + - positive integers Q - rational numbersQ + - positive rationals R - real numbersR + - positive reals.
Cryptography and Network Security Chapter 4. Introduction  will now introduce finite fields  of increasing importance in cryptography AES, Elliptic.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Jeanine “Joni” Pinkney Central Washington University
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
PROPERTIES OF REAL NUMBERS. COMMUTATIVE PROPERTY OF ADDITION What it means We can add numbers in any order Numeric Example Algebraic Example
Ref: Pfleeger96, Ch.31 Properties of Arithmetic Reference: Pfleeger, Charles P., Security in Computing, 2nd Edition, Prentice Hall, 1996.
UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Review Lecture Tuesday, 12/11/01.
15-499Page :Algorithms and Applications Cryptography II – Number theory (groups and fields)
by D. Fisher (2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition 1.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Axioms for Rational Numbers 9/14-9/15. Natural Numbers – Numbers used for counting: 1, 2, 3, and so on. Whole Numbers – Natural numbers and zero: 0, 1,
4.4 Clock Arithmetic and Modular Systems. 12-hour Clock System  Based on an ordinary clock face  12 replaced with a zero  Minute hand is left off.
Two sets:VECTORS and SCALARS four operations: A VECTOR SPACE consists of: A set of objects called VECTORS with operation The vectors form a COMMUTATIVE.
INTRODUCTION SC116: Algebraic Structures Short Title of the Course: ALG Instructor: Professor Samaresh Chatterji.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Math 3121 Abstract Algebra I Lecture 6 Midterm back over+Section 7.
Grade Eight – Algebra I - Unit 12 Linear Equations and Their Graphs
Lecture 1 (Part 1) Introduction/Overview Tuesday, 9/9/08
IERG6120 Lecture 22 Kenneth Shum Dec 2016.
CS480 Cryptography and Information Security
Topic 12: Number Theory Basics (2)
Properties of Operations
Groups and Applications
Great Theoretical Ideas In Computer Science
CS 281: Discrete Mathematics for Computer Science
Section 10.1 Groups.
I. Finite Field Algebra.
Dividing Polynomials pages 664–666 Exercises 11. 3x – 1
Several Transformations
DISCRETE COMPUTATIONAL STRUCTURES
PHY 745 Group Theory 11-11:50 AM MWF Olin 102 Plan for Lecture 1:
Set – collection of objects
Warm-Up Find the slope of 4y = 3x + 21 Solve -3x – 5 = x + 12
296.3:Algorithms in the Real World
Section 9.1 Groups.
Presentation transcript:

SF2714 Discrete Mathematics and Algebra 7.5 hp KTH, period 2, Fall 2009 Course coordinator: Jakob Jonsson –

Course design 7.5 hp = 5 weeks of full-time work 18 lectures with 90 minutes of theory and problem- solving Course book: Biggs – Discrete Mathematics Examination: ● Two sets of home assignments ● Not mandatory, but give bonus points on exam ● Final exam (December 15)

Lectures 18 lectures, each 90 minutes ● 16 ordinary lectures ● 2 concluding lectures with time for questions Lectures are not mandatory. We discuss the underlying theory and solve problems. The course webpage will be updated with detailed information about each lecture.

Literature Norman L. Biggs, Discrete Mathematics, 2 nd edition, Oxford University Press. Supplementary material ● Will be handed out during lectures or be available for download from the course webpage.

Home assignments Two sets of home assignments The assignments may give up to 8 bonus points on the final exam ● 8 points = 80 % correct on the assignments ● 7 points = 70 % correct on the assignments ● etc.

Final exam 8 problems worth 36 points ● Part I: 3 problems on par with grade E (12 p) ● Part II: 4 harder problems (24 p) You pass with 20 points (including bonus) Examples (Bonus + part I + part II) : = 20 = grade E = 28 = grade C = 36 = grade A

Course content IArithmetic ~ 20 % IICombinatorics~ 15 % IIIGraph Theory~ 15 % IVGroup Theory~ 20 % VFields and Polynomials~ 20 % IVError-Correcting Codes~ 10 %

Arithmetic ● Divisibility – An integer a divides another integer b if b/a is an integer ● Prime numbers – Integers p such that only 1 and p itself divide p ● Modular arithmetic – “Identify” two integers if their difference is a multiple of a given integer m – Arithmetic operations on classes of identified integers rather than on individual integers

Combinatorics ● Binomial numbers – Count the number of subsets of size k of a set of size n ● Principles of counting – Addition principle, multiplication principle, sieve principle ● Set partitions – Subdivisions of a set into subsets ● Permutations – Bijective functions on a set

Graphs ● Basic structures in graphs – Trees and cycles ● Graph colorings – Assign a color to each vertex in a graph such that two adjacent vertices have different colors ● Matchings – Sets of edges in a graph such that no vertex appears in more than one edge

Groups ● Basics of groups – Theory unifying properties of sets with a binary operation – Requirements: the binary operation is associative ; there is an identity ; every element has an inverse ● Examples of groups – Cyclic groups, abelian groups, permutation groups ● Structures within groups – Subgroups, cosets ● Orbits of permutation groups – The concept of permutation cycles lifted to a group level

● Basics of fields – Theory unifying properties of sets with two binary operations: addition and multiplication – Addition and multiplication work as in Q. Examples: – ab = ba ; a(b+c) = ab + ac ; 1/x exists when x is nonzero ● Polynomials over fields – Factorization – Theory analogous to that of the integers ● Finite fields – Fields with finitely many elements – Combine theories of modular arithmetic and polynomials Fields and Polynomials

● Basics of codes – A code is a set of words such that all words are “far apart” – Codewords are often binary words – A few errors in a codeword can be repaired, as all other codewords are “far away” ● Bounds on codes – How large can a code be if we want to correct e errors? ● Linear codes – A code forming a vector space under addition. – Nice application of linear algebra Error-Correcting Codes