Discrete Math II - Introduction -

Slides:



Advertisements
Similar presentations
Cryptography and Network Security
Advertisements

Chapter 4 Finite Fields. Introduction of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key concern operations on “numbers”
Cryptography and Network Security Chapter 4 Fourth Edition by William Stallings.
Chapter 4 – Finite Fields. Introduction will now introduce finite fields of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key.
1.  We have studied groups, which is an algebraic structure equipped with one binary operation. Now we shall study rings which is an algebraic structure.
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.
1 CS233601: Discrete Mathematics Department of Computer Science National Tsing Hua University.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
CTIS154-01,02,03 Discrete Mathematics II Kadir A. Peker Tel: x5406.
Chapter 4 – Finite Fields Introduction  will now introduce finite fields  of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public.
Discrete Structures for Computer Science Ruoming Jin MW 5:30 – 6:45pm Fall 2009 rm MSB115.
1 Foundations of Interval Computation Trong Wu Phone: Department of Computer Science Southern Illinois University Edwardsville.
Slide 10-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
MATH10001 Project 2 Groups part 1 ugstudies/units/ /level1/MATH10001/
1 CSE 5351: Introduction to Cryptography Ten H. Lai Spring 2015 MW 3:55-5:15 PM, CL133.
M. Khalily Dermany Islamic Azad University.  finite number of element  important in number theory, algebraic geometry, Galois theory, cryptography,
CSNB143 – Discrete Structure
Unit – IV Algebraic Structures
CS 103 Discrete Structures Lecture 01 Introduction to the Course
Introduction to Network Security J. H. Wang Feb. 24, 2011.
Discrete Mathematics Transparency No. 0-1 Discrete Mathematics Cheng-Chia Chen September 2009.
Introduction to Discrete Mathematics J. H. Wang Sep. 14, 2010.
CS 390 Introduction to Theoretical Computer Science.
Monoids, Groups, Rings, Fields
MTH 201 Discrete Mathematics Fall Term MTH 201 Discrete Mathematics Fall Term INTERNATIONAL BURCH UNIVERSITY DEPARTMENT of INFORMATION.
Properties of Real Numbers. Sets In mathematics, a set is a collection of things Sets can be studies as a topic all on its own (known as set theory),
By S. Joshi. Content Binary Structures & Group Subgroup Isomorphism Rings Fields.
Jason Holman Mathematics Number Theory Algebraic Theory Global Fields for Complex Multiplication Local and “p”-adic fields.
Course Overview for Compilers J. H. Wang Sep. 14, 2015.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
UNIT - 2.  A binary operation on a set combines two elements of the set to produce another element of the set. a*b  G,  a, b  G e.g. +, -, ,  are.
Chapter 6 Abstract algebra
CEC 220 Digital Circuit Design Wednesday, January 7 CEC 220 Digital Circuit Design Slide 1 of 12.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Great Theoretical Ideas in Computer Science.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
CSCI 115 Chapter 1 Fundamentals. CSCI 115 §1.1 Sets and Subsets.
Chapter 13 Mathematic Structures 13.1 Modular Arithmetic Definition 1 (modulo). Let a be an integer and m be a positive integer. We denoted by a mod m.
by D. Fisher (2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition 1.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Distributive Commutative Addition Zero Property Additive Inverse 0 Multiplicative Identity Commutative Multiplication Multiplicative Inverse Additive Identity.
Properties of Algebra. 7 + ( ) = ( ) + 9.
Administrative Details Grade – 80% test, 20% homework 4-5 homework assignments Office hours after lesson Tel
Formal Languages and Automata Theory
Mathematical Background : A quick approach to Group and Field Theory
Discrete Math II Howon Kim
Microelectronic Circuits Spring, 2017
Unit-III Algebraic Structures
COMP 283 Discrete Structures
CS480 Cryptography and Information Security
Properties of Operations
Commutative Property of Addition
Great Theoretical Ideas in Computer Science
사물네트워크 시스템 보안 - Focused on Advanced Cryptography-
Welcome to CMSC 203 – Discrete Structures Spring 2003
Groups and Applications
Data Mining - with Tensorflow, datamining and deep learning -
Senior Seminar in Mathematics Math 495 Course Syllabus
Great Theoretical Ideas in Computer Science
CSE1311 Introductory Programming for Engineers & Scientists
CS 281: Discrete Mathematics for Computer Science
Great Theoretical Ideas in Computer Science
Section 10.1 Groups.
Principles of Computing – UFCFA Week 1
Cryptology Design Fundamentals
WELCOME.
Section 9.1 Groups.
Mathematical Background : A quick approach to Group and Field Theory
Presentation transcript:

Discrete Math II - Introduction - 6/25/2018 Discrete Math II - Introduction - Howon Kim 2017.9.4

About this course… Course name : Discrete Math II (CP21697) Study the basics on number theory, graph theory, automata, and mathematical techniques for computer science & engineering Number theory (finite fields and ring) is the fundamental knowledge for the cryptography & security and Coding Theory etc. Graph theory & automata is the basic mathematical techniques to understand the computer science, networks and many topics in computer engineering

About this course… About Instructor Major Research Interests 6/25/2018 About Instructor Office : A06-503 Office hours : 12:30 ~ 13:30 PM(Monday, Wednesday) Email: howonkim@gmail.com, howonkim@pusan.ac.kr Phone: 010-8540-6336 Homepage : http://infosec.pusan.ac.kr Major Research Interests 사물인터넷 연구센터 IoT(Internet of Things: 지능형 사물 네트워크) 기술 연구 머신러닝/딥러닝 기술 연구 정보보호/해킹, 네트워크 보안, 암호 기술, IoT 보안 연구 FPGA & ASIC chip design Recruit Ambitious Students !

About this course… Textbook Time & Classroom References 6/25/2018 Textbook “Discrete and combinatorial mathematics ” (5th Ed), R.P. Grimaldi, 2004 Selected Materials for mathematical techniques Time & Classroom 15:00 ~ 16:15 PM (Monday, Wednesday), A6-202 References Discrete mathematics by Richard Johnsonbaugh Introduction to Automata Theory, Languages, and Computation by John E. Hopcroft Introduction to Graph Theory by Douglas B West A Course in Number Theory and Cryptography by Neal Koblitz

About this course 활동사항 학습내용 주 Algebra 개요 Groups, Integers modulo N 6/25/2018 활동사항 학습내용 주 Algebra 개요 1 Groups, Integers modulo N 2 Ring 3 Field 4 Applications of number theory 5 Midterm exam 1 6 Introduction 7 Euler Circuit 8 Planar Graph, Hamiltonian Path, Coloring 9 Midterm exam 2 10 Set theory of strings 11 Regular languages, finite automata 12 Grammars and languages 13 Theory of computation 14 Final Exam 15 16

About this course Grading Policy 점 수 항 목 15 Attendance 25/25 6/25/2018 Grading Policy 점 수 항 목 15 Attendance 25/25 Midterm exam 1/2 25 Final 10 Homework 100 Total (수업시간 참여 충실도 반영)

Algebra Definition K : a set of data Operator opj Tuple <K, op1, op2, …, opn> < R, , , ,  > < {T,F }, , ,  > ; Boolean algebra K : a set of data |K| : order finite or infinite Operator opj Closure opj : Ki  K Unary if i=1, Binary if i=2, … 7

Identity and Zero  : K  K  K Identity element e for  in K (항등원) e  a = a  e = a for all a ∈ K Zero element z for  in K (영원) z  a = a  z = z for all a ∈ K Examples < Z, + > Identity : 0, Zero : none < Z,  > Identity : 1, Zero : 0 8

Inverse  : K  K  K Let e be the identity element for  in K. Left inverse a’L  a = e , a ∈ K Right inverse a  a’R = e , a ∈ K If a’L = a’R = a’ , a’ is the inverse of a. Example < Z, + > Identity 0, (-x) is the inverse of x : x + (-x) = (-x) + x = 0 9

Properties of Operator Let  : K  K  K be a binary operator. (1) Closure (2) Associative (a  b)  c = a  (b  c) for all a, b, c ∈ K. (3) Identity There is an identity element e ∈ K for . (4) Inverse For each a ∈ K, there is an inverse a’ ∈ K for . (5) Commutative a  b = b  a for all a,b ∈K. 10

Binary Algebra < K,  > for binary operator  : K  K  K Semigroup (반군) : Associative < Z+, + > A semigroup is a set with an associative binary operation which satisfies closure and associative law. Monoid (단위반군) : Associative, Identity < N, + >, < Z,  >, < {T,F },  > A monoid is a set that is closed under an associative binary operation and has an identity element Group (군) : Associative, Identity, Inverse < Z, + > Abelian group (대수군) : Associative, Identity, Inverse, Commutative 11

Binary Algebra Properties < K,  > Closure Associative Identity Set (1), (2) Semigroup Properties Closure Associative Identity Inverse Commutative (5) Abelian Semigroup Monoid (3) Abelian Monoid (5) Group (4) Abelian Group (5) 12

Binary Algebra Set Closure Semigroup Associative Commutative Monoid Abelian Group Abelian Monoid Abelian Semigroup Monoid Identity Group Inverse 13

Ring ( Two operators ) < K, , > Conditions for Ring Two binary operators ,  : K  K  K Conditions for Ring < K, > is an abelian group.  is associative  is distributive over  a  (b  c) = (a  b)  (a  c) and (a  b)  c = (a  c)  (b  c) for all a,b,c ∈ K. 14

Definitions < K, , > Conditions for operator  : < K, > : abelian group, and distribution laws hold Conditions for operator  : Ring (환) : Associative Ring with Unity : Associative, Identity Commutative Ring : Associative, Commutative Commutative Ring with Unity Associative, Identity, Commutative Field (체) Associative, Identity, Commutative, Inverse 15

Ring and Field Properties for  < K, , > (0) Distributive Set (0), (1), (2) Ring Properties for  (0) Distributive (1) Closure (2) Associative (3) Identity (4) Inverse (5) Commutative (5) Commutative Ring (3) Ring with Unity Commutative Ring with Unity (5) (3) Field (4) 16

Ring and Field < K, , > Closure Distributive Ring Associative Ring with Unity Identity Commutative Ring Commutative Field Inverse Commutative Ring with Unity 17

Next… 6/25/2018 Basics on Number Theory…

Q&A Thank you for your attention. Thank you. 19