Divisors Presented by J.liu. Outline Elliptic curves Definitions Isomorphism from Div 0 (E)/S→E(κ) Find a function f, such that div(f) = D.

Slides:



Advertisements
Similar presentations
An Introduction to Elliptic Curves with reference to Lyness cycles Jonny Griffiths, UEA, November 2010.
Advertisements

An Introduction to Elliptic Curves ATM Conference, Telford Jonny Griffiths, April 2011.
Singularity of a Holomorphic Map Jing Zhang State University of New York, Albany.
Finite Fields Rong-Jaye Chen. p2. Finite fields 1. Irreducible polynomial f(x)  K[x], f(x) has no proper divisors in K[x] Eg. f(x)=1+x+x 2 is irreducible.
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 390-Elliptic Curves and Elliptic Curve Cryptography Michael Karls.
Algebraic Geometric Coding Theory presented by Jake Hustad John Hanson Berit Rollay Nick Bremer Tyler Stelzer Robert Coulson.
Section 11 Direct Products and Finitely Generated Abelian Groups One purpose of this section is to show a way to use known groups as building blocks to.
Parshuram Budhathoki FAU October 25, /25/2012 Ph.D. Preliminary Exam, Department of Mathematics, FAU.
Probabilistic verification Mario Szegedy, Rutgers www/cs.rutgers.edu/~szegedy/07540 Lecture 3.
Math 3121 Abstract Algebra I
Section 13 Homomorphisms Definition A map  of a group G into a group G’ is a homomorphism if the homomophism property  (ab) =  (a)  (b) Holds for.
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
The Weil Pairing Presented by J.liu. Outline Primitive Definition Theorems Computation of the pairings.
YSLInformation Security -- Public-Key Cryptography1 Elliptic Curve Cryptography (ECC) For the same length of keys, faster than RSA For the same degree.
Elliptic Curve. p2. Outline EC over Z p EC over GF(2 n )
Elliptic Curve Cryptography and Curve Counting Via the Feynman Transform Michael Slawinski Ph.D. Candidate, UCSD Mathematics Department.
X’morphisms & Projective Geometric J. Liu. Outline  Homomorphisms 1.Coset 2.Normal subgrups 3.Factor groups 4.Canonical homomorphisms  Isomomorphisms.
1 Equivalence of Real Elliptic Curves Equivalence of Real Elliptic Curves Allen Broughton Rose-Hulman Institute of Technology.
Cyclic Groups. Definition G is a cyclic group if G = for some a in G.
Rings,Fields TS. Nguyễn Viết Đông Rings, Integral Domains and Fields, 2. Polynomial and Euclidean Rings 3. Quotient Rings 2.
MTH-376 Algebra Lecture 1. Instructor: Dr. Muhammad Fazeel Anwar Assistant Professor Department of Mathematics COMSATS Institute of Information Technology.
Properties of Real Numbers: I. State the property of equality exhibited in each. 1. a. 7=7_________________________________ b. –1/7=-1/7_________________________________.
Finite Groups & Subgroups. Order of a group Definition: The number of elements of a group (finite or infinite) is called its order. Notation: We will.
Tangents and Differentiation
5x 4 – 405 = 5(x 4 – 81) = 5(x 2 + 9)(x 2 – 9) = 5(x 2 + 9)(x + 3)(x – 3) by D. Fisher.
Multiply polynomials vertically and horizontally
In this section, we will consider the derivative function rather than just at a point. We also begin looking at some of the basic derivative rules.
Math 3121 Abstract Algebra I Lecture 5 Finish Sections 6 + Review: Cyclic Groups, Review.
FINDING THE SLOPE FROM 2 POINTS Day 91. Learning Target: Students can find the slope of a line from 2 given points.
3.4 – Linear Programming. Ex. 1 Graph the system of inequalities. Name the coordinates of the vertices of the feasible region. Find the max & min values.
Math 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
An Introduction to Elliptic Curve Cryptography
Rational Root Theorem Definitions Steps Examples.
Section 14 Factor Groups Factor Groups from Homomorphisms. Theorem Let  : G  G’ be a group homomorphism with kernel H. Then the cosets of H form a factor.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
9.8 Day 2 – Finding Rational Zeros. The Rational Zero Theorem: If has integer coefficients, then every rational zero of f have the following form:
is a linear combination of and depends upon and is called a DEPENDENT set.
Math 3121 Abstract Algebra I Lecture 14 Sections
 Example: [Z m ;+,*] is a field iff m is a prime number  [a] -1 =?  If GCD(a,n)=1,then there exist k and s, s.t. ak+ns=1, where k, s  Z.  ns=1-ak.
Stir it up!ExponentsGraphingMixVocab.
 Theorem 6.21: Let H be a subgroup of G. H is a normal subgroup of G iff g -1 hg  H for  g  G and h  H.  Proof: (1) H is a normal subgroup of G.
Introduction to Elliptic Curves CSCI 5857: Encoding and Encryption.
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.
3 ( x + 2 ) = 3 x ( 3 x - 5 ) = 6x - 10 x x x - 5 M May.
Combining Like Terms. Vocabulary A term is a number or the product of a number and a variable(s). ex. 5, -12p, 35m 3, x 2 y 5 z 13 A constant is a term.
Group A set G is called a group if it satisfies the following axioms. G 1 G is closed under a binary operation. G 2 The operation is associative. G 3 There.
Cryptography Hyunsung Kim, PhD University of Malawi, Chancellor College Kyungil University February, 2016.
1. Write the equation in standard form.
8.2A Factoring using Distributive Property
Unit-III Algebraic Structures
Warm Up Determine for y2 + xy + 3x = 9.
CS480 Cryptography and Information Security
Groups and Applications
8.6 Choosing a Factoring Method
Rational Zero Theorem Rational Zero Th’m: If the polynomial
X’morphisms & Projective Geometric
Algebraic Expressions and Identities by Siby Sebastian PGT(Maths)
Math 3121 Abstract Algebra I
Section 1.2 Linear Equations and Rational Equations
Algebra 1 Section 10.1.
Homomorphisms (11/20) Definition. If G and G’ are groups, a function  from G to G’ is called a homomorphism if it is operation preserving, i.e., for all.
Homework Check page 367 #
Warm Up: Solve the Equation 4x2 + 8x – 32 = 0.
Theorem 6.29: Any Field is an integral domain
2. From Groups to Surfaces
Notes Over 6.6 Possible Zeros Factors of the constant
Warm-Up 5 minutes Multiply. 1) (x – 3)(x – 2) 2) (6x + 5)(2x + 1)
Presentation transcript:

Divisors Presented by J.liu

Outline Elliptic curves Definitions Isomorphism from Div 0 (E)/S→E(κ) Find a function f, such that div(f) = D

Elliptic curves Weierstrass normal forms Over on a field F with Char(F) = p F p, F p n or any subgroup of F p n.

Definitions Divisor D on E is a finite linear combinations of symbols (points on E)with integer coefficients. D = Σa i [P], with P  E(  ) Ex: D i = 2[P]+3[Q]+4[T]-9[∞] Div(E) = {D: D is a divisor on E} Div is a free abelian group generated by symbols on E.

Definitions Two mappings 1.Deg: Div(E)→Z with Deg(Di) = = 0 2.Sum: Div(E)→E(κ) with Sum(D i ) =2P+3Q+4T-9∞ Div 0 = {D: D  Div(E) and Deg(D) = 0} Sum is a onto homomorphism form Div 0 (E) to E. The kernel of Sum is the set of principle divisors. (We need a bijective Homo.!!)

Definitions Principle divisor D  Div 0 :  f  div(f) = D  Sum(D) = ∞ Divisor of a function div(f): f is a rational function defined for at least one point in E(κ), f has zero or pole on points on E then div(f) = Σa i [P i ] a i is the order of f on P i Note that, f is a rational function mod E

Examples Ex1: E: y 2 =x 3 -x  f = x =y 2 /(x 2 -1)  f has a zero on (0,0)  ord (0,0) (f) = 2, therefore, div(f) = 2[(0,0)]+… Ex2: A line f through P 1.Not a tangent line of P then ord(f) = 1 2.Tangent line of P, and 3P≠∞ then ord(f) = 2 3.Tangent line of P, and 3P =∞ then ord(f) = 3 4.ord ∞ (x) = -2 5.ord ∞ (y) = -3 6.ord ∞ (x+y-2) = 0 ∵ ∞ = (0,1,0) → x+y-2z≠0

Div(f) f is a function on E that is not identically 0 1.f has only finitely zeros and poles 2.deg(div(f)) = 0 (div(f)  Div 0 ) 3.If f has no zeros or poles then f is a constant (div(f) = 0 identity of Div 0 ) Ex: Line f(x,y) = ax+by+c pass P, Q, R on E 1. b≠0 then div(f) = [P]+[Q]+[R]-3[∞] 2. b = 0 then div(f) = [P]+[-P]-2[∞]

Sum is a isomorphism from Div 0 (E)/S→E(κ) ∞ Div 0 (E) E(κ) P S T [P]+S = T That is, [P]+{div(f)} = T

D to f, f to D Let E: y 2 =x 3 +4x over F 11 Let D = [(0,0)]+[(2,4)]+[(4, 5)]+[(6, 3)]-4[∞] it’s easy to see Sum(D) = ∞ and deg(D) = 0 Find f such that div(f) = D 1. find a line through (0,0) and (2,4): y-2x=0 which is a tangent line of (2,4) then we have div(y-2x) = [(0,0)]+2[(2,4)]-3[∞] 2.The vertical line pass through (2,4): x-2 = 0 then we have div(x-2) = [(2,4)]+[(2,-4)]-2[∞]

3.div((y-2x)/(x-2)) = [(0,0)]+[(2,4)]-[(2,-4)]-[∞] 4.[(0,0)]+[(2,4)] = [(2,-4)]+[∞]+div(g) 5. y+x+2=0 pass through (4,5) and (6,3), then div(y+x+2) = [(4,5)]+[(6,3)]+[(2,-4)]-3[∞] 6.x-2 = 0 pass through (2,-4) then we have div(x-2) = [(2,4)]+[(2,-4)]-2[∞] 7.div((y+x+2)/(x-2)) = [(4,5)]+[(6,3)]-[(2,4)]-[∞] 8.[(4,5)]+[(6,3)] = [(2,4)]+[∞]+div(h) 9.D = [(0,0)]+[(2,4)]+[(4, 5)]+[(6, 3)]-4[∞] = [(2,-4)]+[∞]+div(g)+[(2,4)]+[∞]+div(h)-4[∞] = div(gh)+div(x-2)= div((y+x+2)(y-2x)/(x-2))

10. (y-2x)(y+x+2)/(x-2) 11.(y-2x)(y+x+2) = y 2 -xy-2x 2 +2y-4x ≡ x 3 -xy-2x 2 +2y mod (y 2 =x 3 +4x) = (x-2)(x 2 -y) 12. then D = div(x 2 -y) Let’s check div(x 2 -y) 1.We have simple zeros at: (0,0), (2,4), (4, 5), (6, 3) 2.We have ord ∞ (x 2 -y) = -4—[dominate at x 2 ] 3.That is, div(x 2 -y) = [(0,0)]+[(2,4)]+[(4,5)]+[(6, 3)]-4[∞] = D