Professor A G Constantinides 1 General Transforms Let be orthogonal, period N Define So that.

Slides:



Advertisements
Similar presentations
Chapter 8 Introduction to Number Theory. 2 Contents Prime Numbers Fermats and Eulers Theorems.
Advertisements

The Complex Number System
Professor A G Constantinides 1 Z - transform Defined as power series Examples:
Section 7.5: Equivalence Relations Def: A relation R on a set A is called an equivalence relation if it is reflexive, symmetric, and transitive. Ex: Let.
Chapter 3 Public Key Cryptography and RSA Lecture slides by Lawrie Brown Modifications by Nguyen Cao Dat.
Cryptography and Network Security Chapter 8 Fourth Edition by William Stallings.
Opening quote. A number of concepts from number theory are essential in the design of public-key cryptographic algorithms, which this chapter will introduce.
Computer Science CSC 474Dr. Peng Ning1 CSC 474 Information Systems Security Topic 2.3 Basic Number Theory.
Chapter 3 Elementary Number Theory and Methods of Proof.
Cryptography and Network Security
Chapter 8 – Introduction to Number Theory. Prime Numbers prime numbers only have divisors of 1 and self –they cannot be written as a product of other.
Professor A G Constantinides 1 One-to-two dimensional mapping of DFT Let so that and.
Chapter 8 Introduction To Number Theory. Prime Numbers Prime numbers only have divisors of 1 and Prime numbers only have divisors of 1 and self. self.
Chapter 8 Introduction to Number Theory. Prime Numbers prime numbers only have divisors of 1 and self –they cannot be written as a product of other numbers.
Agrawal-Kayal-Saxena Presented by: Xiaosi Zhou
Chapter 8 More Number Theory. Prime Numbers Prime numbers only have divisors of 1 and itself They cannot be written as a product of other numbers Prime.
Ch 5.7: Series Solutions Near a Regular Singular Point, Part II
Cyclic Groups Part 2.
1 The RSA Algorithm Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
CNS2010handout 8 :: introduction to number theory1 computer and network security matt barrie.
1 Chapter 7– Introduction to Number Theory Instructor: 孫宏民 Room: EECS 6402, Tel: , Fax :
6/20/2015 5:05 AMNumerical Algorithms1 x x1x
Complexity1 Pratt’s Theorem Proved. Complexity2 Introduction So far, we’ve reduced proving PRIMES  NP to proving a number theory claim. This is our next.
Congruence of Integers
Congruence Classes Z n = {[0] n, [1] n, [2] n, …, [n - 1] n } = the set of congruence classes modulo n.
Cryptography & Number Theory
Chapter 8 – Introduction to Number Theory Prime Numbers  prime numbers only have divisors of 1 and self they cannot be written as a product of other numbers.
Chapter 8 – Introduction to Number Theory Prime Numbers
Chapter 8 – Introduction to Number Theory Prime Numbers  prime numbers only have divisors of 1 and self they cannot be written as a product of other numbers.

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
Section 4.3: Fermat’s Little Theorem Practice HW (not to hand in) From Barr Text p. 284 # 1, 2.
Selecting Class Polynomials for the Generation of Elliptic Curves Elisavet Konstantinou joint work with Aristides Kontogeorgis Department of Information.
Applied Symbolic Computation1 Applied Symbolic Computation (CS 300) Review of Complex Numbers Jeremy R. Johnson.
Complex Zeros; Fundamental Theorem of Algebra
Lecture 2 Basic Number Theory and Algebra. In modern cryptographic systems,the messages are represented by numerical values prior to being encrypted and.
System Function of discrete-time systems
Section 4.3 Zeros of Polynomials. Approximate the Zeros.
5 5.2 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors THE CHARACTERISTIC EQUATION.
Professor A G Constantinides 1 The Fourier Transform & the DFT Fourier transform Take N samples of from 0 to.(N-1)T Can be estimated from these? Estimate.
AGC DSP AGC DSP Professor A G Constantinides©1 Hilbert Spaces Linear Transformations and Least Squares: Hilbert Spaces.
AGC DSP AGC DSP Professor A G Constantinides©1 Eigenvector-based Methods A very common problem in spectral estimation is concerned with the extraction.
The Fast Fourier Transform and Applications to Multiplication
AGC DSP AGC DSP Professor A G Constantinides©1 Signal Spaces The purpose of this part of the course is to introduce the basic concepts behind generalised.
9/22/15UB Fall 2015 CSE565: S. Upadhyaya Lec 7.1 CSE565: Computer Security Lecture 7 Number Theory Concepts Shambhu Upadhyaya Computer Science & Eng. University.
Professor A G Constantinides 1 Finite Wordlength Effects Finite register lengths and A/D converters cause errors in:- (i) Input quantisation. (ii)Coefficient.
Cyclic Groups A Cyclic Group is a group which can be generated by one of its elements. That is, for some a in G, G={a n | n is an element of Z} Or, in.
Introduction to Exponents Definition: Let b represent a real number and n a positive integer. Then … b is called the base and n is called the exponent.
Professor A G Constantinides 1 Discrete Fourier Transforms Consider finite duration signal Its z-tranform is Evaluate at points on z-plane as We can evaluate.
Introduction to Number Theory
Lecture 3.1: Public Key Cryptography I CS 436/636/736 Spring 2015 Nitesh Saxena.
Introduction to Number Theory Department of Computer Engineering Sharif University of Technology 3/8/2006.
Lecture 2-3 Basic Number Theory and Algebra. In modern cryptographic systems, the messages are represented by numerical values prior to being encrypted.
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
The Cauchy–Riemann (CR) Equations. Introduction The Cauchy–Riemann (CR) equations is one of the most fundamental in complex function analysis. This provides.
CSE565: Computer Security Lecture 7 Number Theory Concepts
The Fundamental Theorem of Algebra and Complete Factorization
Cryptography and Network Security
Introduction to Number Theory
Complex integers? Here a and b are integers.
Cryptography and Network Security
Mathematical Background: Prime Numbers
Mathematical Background: Primes and (GF)
Applied Symbolic Computation (CS 300) Review of Complex Numbers
Applied Symbolic Computation (CS 567) Review of Complex Numbers
Lecture 3.1: Public Key Cryptography I
Algebra 5 Congruence Classes.
Lecture 2-3 Basic Number Theory and Algebra
Mathematical Background: Primes and (GF)
Presentation transcript:

Professor A G Constantinides 1 General Transforms Let be orthogonal, period N Define So that

Professor A G Constantinides 2 General Transforms Determine conditions to be satisfied by so that Let Then

Professor A G Constantinides 3 General Transforms Thus To support circular convolution 1) and real

Professor A G Constantinides 4 General Transforms 2) 3) Since fundamental period is N 4)

Professor A G Constantinides 5 Number Theoretic Transforms Thus in a complex field are the N roots of unity and In an integer field we can write and use Fermat's theorem whereis prime and is a primitive root Euler's totient function can be used to generalise as

Professor A G Constantinides 6 Number Theoretic Transforms Fermat's Theorem: Consider Reduce mod P to produce Since we have or and since there are no other unknown factors

Professor A G Constantinides 7 Number Theoretic Transforms Alternatively (perhaps simpler) For not multiples of P expanded in bionomial form produces multiples of P except for the terms Thus

Professor A G Constantinides 8 Number Theoretic Transforms Now, if the total number of bracketed terms is for this argument less than P say a, then for one has ie and

Professor A G Constantinides 9 Number Theoretic Transforms For example for P=7 the quantity a, known as the primitive root, will be one of the following {2,3,4,5,6} Thus for a=2 we have We note further that

Professor A G Constantinides 10 Number Theoretic Transforms Thus we have And hence Thus only real numbers are involved in the computation. Moreover, the kernel is a power of 2