x = 2 b2 + c 2 , y = 4 b(b2 + c 2 ) page 10, line -7: the coefficient of x should be a 4 + a 1a 3

Size: px
Start display at page:

Download "x = 2 b2 + c 2 , y = 4 b(b2 + c 2 ) page 10, line -7: the coefficient of x should be a 4 + a 1a 3"

Transcription

1 Errata for Elliptic Curves: Number Theory and Cryptography by Lawrence C. Washington page 5, line -5: change integer to rational page 7, line 5: change 881/6 to 881/60 page 7, line 17: the displayed formulas should be x = b + c, y = 4 b(b + c ) a a 3 page 10, line -7: the coefficient of x should be a 4 + a 1a 3 page 1, Figure.: The point P in the diagram should be P 3. page 14, line 11: change L to E page 1, line -5: change u u 0 v 0 to u u 0 page 1, line -4: change (v 0 u u 0 ) k to (u u 0 ) k page 1, line -3: change H(u, v) = v m k h(u/v) to H(u, v) = (v m k /v0 m )h(uv 0 /v) page 1, line -1: this line should read: ( ) v m ( ) ( ) uv0 G(u, v) = g = vm k (v v0 v v0 m 0 u u 0 v) k uv0 h = (v 0 u u 0 v) k H(u, v), v page 3, line -1: change (3x 3 + A) to (3x + A) page 3, Definition.4: change P 1 K to P K page 5, line 18: add comma between 0 and b 3 page 5, line 0: change F z / x to F z /F x page 6, lines 10, 11: change Since P 11, P 1, P 13 lie on m j, we have m j (u i, v i ) = 0 for i = 1,, 3 to Since P 1,j lies on m j, we have m j (u j, v j ) = 0 for j = 1,, 3 page 8, line -13: the first can be replaced by = page 3, line 9: add or Q + R = R page 3, line 1: Add the sentence The case Q + R = R is similar. page 37, line 9: change x to x + p to u to u + p page 39, line 1: change first to second page 41, line 15: change v = 1 m m to v = 1 m m 1+m 1+m page 41, line -9: change Weierstrass equation to generalized Weierstrass equation page 41, line -6: change y1 = x3 + x 5x + 8 to y1 = x3 + x 5x 6 page 4, line -3: change 0 to 4A 3 i + 7B i 0 page 43, line -3: change defined over K. to defined over K). 1

2 page 44, line 8: change y to y 0 page 48, line -9: change Section.8 to Proposition.7 page 50, line-6: change α 1 to α page 51, line 15: change z 3 + Aa + B to a 3 + Aa + B page 5, line 14: the a should be A (4 occurrences) page 53, line -5: change.3 to.5 page 56, line 15: change Substituting x i = 1/t 3 i yields to Substituting x i = 1/t i and y i = 1/t 3 i yields page 59, line 1: change x = 4αt i (t i to x = 4α t i 1) (t i 1) page 59, line 4: change = x = to = page 59, line 10: change t 1 t = t to t 1 t = t 3 page 60, line -8: the curve should be y = x 3 + 3x 3 page 60, line -6: the second coordinate of the point should be 16379/6859 (positive, not negative) page 61, line -4: change a primitive m n matrix to an m n matrix (primitivity is assumed later in the sentence) page 64, line -9: change (x 3, y 3, z 3 ) = (0, 1, 0) to (x 3, y 3, z 3 ) = (0, 1, 0) page 65. line 6: change if to is page 67, line 9: change 3x 3 + A to 3x + A page 67, line 13: change.1 to page 18, Section. page 68, line 16: change (1 : 1, 0) to (1 : 1 : 0) page 69, line -18: the second equation should be y = x 3 + a 4 x + a 6 page 69, line -16: the change of variables should be y ay, x bx + c, with a, b K and c K. page 77, line 13: change m to m 3 page 80, line 7: change a to A and b to B page 90, line 6: the equation should be 0 = x 3 4x + x + 1 page 9, line -1: the first φ should be φ q page 94, lines 1, 3: change φ n 1 to φ n q 1 page 94, line 7: change φ to φ q page 96, lines 5, 7, 8, 9 (twice): change φ to φ q page 98, line 7: change + ( 1+ 7 ) to ( 1 7 page 98, line 15: change the second 7 to 7 page 101, line 16: change the elliptic curve x 3 + 7x + 1 to the elliptic curve y = x 3 + 7x + 1 page 103, line -1: the line should be M is the order of the point P )

3 page 103, line -10: change greatest to least page 104, line 16: change (M/p i )P to (M/p i )g page 107, line -10: change points at infinity to the point at infinity page 11, line -3: remove one of the equality signs page 115, line 9: change q l = q to q l q page 115, line -10: change (x, y) to q l (x, y) page 115: the last few lines should read as follows: for integers j. We may compute x j and y j using division polynomials, as in Section 3.. Moreover, x j = r 1,j (x) and y j = r,j (x)y, as on page 47. We have ( ) y x q y ql = x q x x q x. ql ql Writing ( y q y ql ) = y ( y q 1 r,ql (x) ) = (x 3 + Ax + B) ( (x 3 + Ax + B) (q 1)/ r,ql (x) ), page 118, line 4: change (y y j ) to (y yj) q page 118, line -3: change x + 13x + 14 to x + 1x + 14 page 119, line -5: change (x 1, y 1 ) to (x, y ) and change (x, y ) to (x, y ) page 10, line : change x 1 to x and change x to x page 10, line 7: change (x 1, y 1 ) to (x, y ) page 10, line 1: change (y 1 + y 19 ) to (y + y 19 page 10, line 14: change (x 1, y 1 ) to (x, y ) page 11, line 10: change a n 1 to s n 1 page 11, Corollary 4.30: E is defined over F p page 1, line 7: insert if after only page 14, line -10: change the sentence to By Proposition 4.9, E is supersingular if and only if A q = 0 in F q. page 19, line 5: change δ (mod 3) to δ (3) and change δ 3 (mod 4) to δ 3(4) page 19, line 8: change j = 178 to j = 0 page 130, Exercise 4.: it should be n + 1 ( ) n/ if n is even page 130, line -13: change ( ) ( ) r s F q to r s F q ) 3

4 page 131, line 15: change Show that if n is sufficiently large, then to Use Hasse s theorem in the form a 4q to show that page 131, line 1: change () to (b) page 13, line 8: change #E(F q ) to #E (d) (F q ) page 13, line 10: change F to F q page 13, line -14: change a = 4b to a 4b page 135, line -16: change (mod 117) to (mod 116) page 135, line -3: change exp to exp page 136, line 10: Insert For simplicity, it is usually assumed that P generates G. page 136, line -11: change k 0 = k to k 0 k page 137, line 7: change 0 i 7 to 1 i 7 page 138, line -7: change (v j + b j )Q to v j + b i )Q page 149, line 7: change Ẽ1 to Ẽr page 150, lines -16 to -13: Remove the sentences Usually and replace with Since P 1 Ẽ, we have p in the denominator of x, so P 1 is already at mod p. Therefore, we cannot obtain information directly from calculating λ 1 ( P 1 ). page 151, lines 8-14: The curve should be Ẽ : y = x x + 4. The point Q should be (563, 66436). The point P should be (159511, 58855) and the point Q should be (56463, ). Also, and m 1 = = m = = (The curve given in the original text works if it is regarded as a curve mod 853.) page 151, line -4: this actually should say that a/(b + O(p k )) can be changed to (a/b) + O(p k ). (The problem with = is that the right side sometimes cannot be changed back to the left side.) page 15, line 4: the denominator v x 1 should be u x 1 page 154, line 6: change τ n (P 1 + P 1, Q) to τ n (P 1 + P, Q) page 155, lines 11, 1: change (mod p) to (mod l) page 155, line -9: change φ m I to ((φ q ) l ) m I 4

5 page 156, line -4: change Q jp for j = 0, 1,,, m to Q jmp for j = 0, 1,,, m 1 page 156, line -: change Q jp to Q jmp page 16, line -9: change Joux [43] to Joux [43] (see also [E. Verheul, Evidence that XTR is more secure than supersingular elliptic curve cryptosystems, in B. Pfitzmann (ed.), Eurocrypt 001, Springer LNCS 045 (001) ]) page 165, line 5: change E(F q ) to E(F q ) page 168, line 5: change h(m 1 ) = h(m ) to H(m 1 ) = H(m ) page 168, line 17: change V 1 = f(r)b + sr to V 1 = f(r H )B + s H R H page 171, line 13: change Equation 6.1 to (6.1) page 171, line -16: change Z n to Z n page 173, line -: change idbob to bobid page 174, line -5: change ẽ to ẽ l page 175, line 1: change ẽ to ẽ l page 175, line 4: (4 times) change ẽ to ẽ l page 175, line -4: change ) to.) page 176, line -11: insert for some n 0 (mod p) after E(F p ) page 180, lines -5, -6: change 4553 to 4453 page 181, line 14: change prime factors of B to prime factors of m page 183, line -6: change x (x 1) to x (x + 1) page 187, line -5: change t to t 1 4 page 188, line 11: change P modp to P mod p page 190, line 14: E r /E r+1 should be E r /E 5r page 191, line : change Ast to Ats page 191, line -11: insert (and therefore E r is a subgroup) before. Therefore page 19, line -15: change s = t 3 + Ats = Bs 3 to s = t 3 + Ats + Bs 3 page 19, line -15: change (t, s) = (x/y, 1/y) to (s, t) = (1/y, x/y) page 193, lines 3, 5, 6, 8: change 3s to 3Bs page 193, line 6: change (t, s) to (s, t) page 193, line -1: change (t 1, s 1 ) and (t, s ) to (s 1, t 1 ) and (s, t ) page 194, line : change s = t 3 + As t + Bs 3 to s = t 3 + Ats + Bs 3 page 195, line 6: change P E 4r. Since 4r > r to P E 5r. Since 5r > r page 196, line -18: change 17B to 7B 5

6 page 197, line -10: change order 1 times a power of 7 to order dividing 1 times a power of 7 page 197, line -7: change group of to in page 199, lines -16 to -13: change Note that... same sign. to Since x(x 1)(x + ) = y > 0, we have cw = x + > 0, so c > 0. Since abc > 0, it follows that a and b must have the same sign. page 00, line 3: change (,, 1) to (,, 1) page 00, line -10: change Write to Assuming that x, y Q, write page 01, line 18: change v 1 to u page 0, line -11 to page 03, line 6: Franz Lemmermeyer pointed out that the argument can be simplified as follows: By inspection, φ 1 (P )φ (P )φ 3 (P ) = 1 for all P. Since φ i (P 1 )φ i (P ) = φ i (P 1 + P ) for i =, 3, the relation holds for i = 1, too. Therefore, φ is a homomorphism. page 03, line -1: change the first e 1 to v 1 page 03, line -11: change the first e to v page 03, line -10: change the first e 3 to v 3 page 04, line 15: change u /u 3 to 1/u page 05, line 3: change (,, 1) to (,, 1) page 07, line 16: Add H(x, y) = H(x), H( ) = 1 to the displayed formula. page 09, line 4: the displayed formula should be h(p + Q) + h(p Q) h(p ) h(q) c 1 page 09, line 4: the displayed formula should be 1 h( n P + n Q) + 4 n h( n P n Q) h( n P ) h( n Q) c 1. 4 n page 10, line -5: remove with gcd(c i, d i ) = 1 for i = 1, page 11, line 8: change c 1 d to c d 1 page 1, line 9: change b 3 b 3 to b 3 b 4 page 17, line -6 to page 18, line 13: The argument in the last 6 lines of page 17 is incorrect and not needed. The whole argument can be simplified with the following: Let (a, b) be any pair. There is a point P with φ(p ) = (a, b) on the list L for some a. If there is a point Q with φ(q) = (a, b), then φ(p Q) = (a, b)(a, b) 1 = (a, 1) for some a. We showed that (a, 1) is not in the image of φ when a 1. Therefore, a = 1, so a = a and (a, b) = (a, b) = φ(p ). Consequently, the only pairs in the image of φ are those on the list L. 6

7 page 3, line 10: change Equation 8.13 to (8.13) page 4, line 7: change Equation 8.14 to (8.14) page 7, line 4: the equation should be y = x 3 Cx + (C 4A)x page 7, line 6: C should be A page 7, line 8: switch A and C page 30: The statement of Theorem 8.8 should read: If p 9 (mod 16), then C 1,p,p has q-adic points for all primes q, but has no rational points. page 31, line 17: change Equation 8.15 to (8.15) page 31, line -15: change p = to q = page 37, line -: add a right parenthesis at the end of the sentence page 38, line -14: change T 0 to T g page 38, line -5: change T g 1g to T g1 g page 39, line -15: change τ phii to τ φi page 40, line 3: change Equation 8.4 to (8.4) page 4, lines 8, 13, 14: change g p to g( p) page 4, line 1: add a right parenthesis at the end of the sentence page 44, line -5: (twice) change φ to ψ page 44,line -1: change φ to ψ page 47, line -: change C/L to C/L page 50, line -11: change f = to f(z) = page 53, line 1: the double integral should be multiplied by 1/area of F page 54, line -1: remove adding a page 55, line 15: change the second (z) to f(z) page 58, line -6: change By 9.1 to By Theorem 9.1 page 56, line 6: change ω 3 to ω page 63, line -4: change k 1 to k page 64, line -9: change (πi) k to (πi) k page 68, line -: change α + Zβ to Zα + Zβ page 73, line 16: change µ to µ 4 page 79, line : change the second displayed formula to b n b n 1 b n 1 = b n 1 page 79, line 6.5: Insert Therefore, a n b n (1/) n (a b), so a n b n 0. page 84, line 3: change f to f n page 85, line 6: change ω i to ω j page 85, line -10: the last factor should be squared 7

8 page 85, line -9: remove the, so the line should read = ( ) 1 1 n z +, page 9, lines 5 and 7: the summations should start at n = 0 instead of n = 1 page 9, line 14: the sum should be for z i, ρ, i page 93, line 7: change {y + 1y, y} to {y + 1 i, y} page 93, line -3: change 1 x 1 k to 1 k x x 1 x page 94, line 3: change 4aE( 1 (a/b) ) to 4bE( 1 (a/b) ) page 94, line -6: change 1 dx to x(x 1) 1 page 95, line -3: change i (z) to i (z) page 97, line 9: change α(z) to α(h) page 98, line -1: change δ to fδ page 99, line 15: change β = a to β = j page 99, line -9: change 4x 4 to 4x 4 page 303, line 5: change R to R page 307, line -3: Insert By multiplying by dx x(x 1) ( ) if necessary, we may also assume that s > 0. page 308, line 5: Insert S N after the matrix. page 308, line -9: change j S to (j S)(τ) page 317, line -4: change (1, ±17, 43), (5, ±11, 67), (1, 9, 9) to (17, ±1, 43), (11, ±5, 67), (9, 1, 9) page 318, lines 7, 8, 9(twice), -8, -7: change a to a p page 319, line3: change a to a p page 31, line -1: change the second factor to (a bi cj dk) page 37, line 7: the denominator of the fraction should be x x 3 page 37, line -13: change P 1 + P 1 to P 1 + P page 38, line -9: change E(K) to E(K) page 330, line 4: change ord Q = 0 to ord Q (f) = 0 page 330, line 11: the superscript on h should be ord Q (f) page 331, line 8: change P AP 1 P + BP 3 to P AP 1 P + BP 3 page 336, line -10: change f τ jt to f τ jt n page 338, line 9: (6) should be be (5) page 349, line -11: change deg(div(k)) to deg(k) page 358, line 8: the factors in the product should be ( 1 1 p s ) 1 8

9 page 36, line -4: change the first half of the line to f E (τ) is a modular form (in fact, a cusp form (see page 376)) of weight and level N. page 363, line -1: change e t to e t page 365, line -5: change 11π to 11/π page 376, formula 13.6: change n=1 b n q rn to n=1 rb n q rn page 379, line 5: change ρ M to ρ page 388, line -7: change p to p page 396, lines 11, 1, 16: insert l S in the product and move where S is a finite set of bad primes (in our example, S = {5, 17, 37}) to line 1 page 403,line -6: change g i = g j to ig = jg page 41, Proposition C.7: The assumption that the set is finite can be changed to assuming that the set is countable, with essentially the same proof. page 41, line -10: Change C.7 to C.5 (last updated 9/7/007) Many thanks to Satoshi Tomabechi, Ashvin Rajan, Michael Cheng, Susan Schmoyer, Pinaki Das, Simon Allewaert, David Goldberg, Steven Galbraith, Chris Christopoulos, Robin Chapman, Keith Conrad, Cory Brunson, Gottfried Barthel, Ryuji Tsushima, Ning Shang, Tsz Wo Sze, Anders Nielsen, Jerry Metzger, Ralph May, Susan Margulies, Franz Lemmermeyer, Will Murray, Chang An Zhao, Rainer Urian, Qiao Zhang, Rahul P, and Koichiro Harada for finding the above errors. 9

x 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line?

x 9 or x > 10 Name: Class: Date: 1 How many natural numbers are between 1.5 and 4.5 on the number line? 1 How many natural numbers are between 1.5 and 4.5 on the number line? 2 How many composite numbers are between 7 and 13 on the number line? 3 How many prime numbers are between 7 and 20 on the number

More information

Public-key Cryptography: Theory and Practice

Public-key Cryptography: Theory and Practice Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues

More information

LECTURE 7, WEDNESDAY

LECTURE 7, WEDNESDAY LECTURE 7, WEDNESDAY 25.02.04 FRANZ LEMMERMEYER 1. Singular Weierstrass Curves Consider cubic curves in Weierstraß form (1) E : y 2 + a 1 xy + a 3 y = x 3 + a 2 x 2 + a 4 x + a 6, the coefficients a i

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #24 12/03/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #24 12/03/2013 18.78 Introduction to Arithmetic Geometry Fall 013 Lecture #4 1/03/013 4.1 Isogenies of elliptic curves Definition 4.1. Let E 1 /k and E /k be elliptic curves with distinguished rational points O 1 and

More information

ELLIPTIC CURVES OVER FINITE FIELDS

ELLIPTIC CURVES OVER FINITE FIELDS Further ELLIPTIC CURVES OVER FINITE FIELDS FRANCESCO PAPPALARDI #4 - THE GROUP STRUCTURE SEPTEMBER 7 TH 2015 SEAMS School 2015 Number Theory and Applications in Cryptography and Coding Theory University

More information

Points of Finite Order

Points of Finite Order Points of Finite Order Alex Tao 23 June 2008 1 Points of Order Two and Three If G is a group with respect to multiplication and g is an element of G then the order of g is the minimum positive integer

More information

Number Theory in Cryptology

Number Theory in Cryptology Number Theory in Cryptology Abhijit Das Department of Computer Science and Engineering Indian Institute of Technology Kharagpur October 15, 2011 What is Number Theory? Theory of natural numbers N = {1,

More information

20 The modular equation

20 The modular equation 18.783 Elliptic Curves Spring 2015 Lecture #20 04/23/2015 20 The modular equation In the previous lecture we defined modular curves as quotients of the extended upper half plane under the action of a congruence

More information

A Remark on Implementing the Weil Pairing

A Remark on Implementing the Weil Pairing A Remark on Implementing the Weil Pairing Cheol Min Park 1, Myung Hwan Kim 1 and Moti Yung 2 1 ISaC and Department of Mathematical Sciences, Seoul National University, Korea {mpcm,mhkim}@math.snu.ac.kr

More information

Integral points of a modular curve of level 11. by René Schoof and Nikos Tzanakis

Integral points of a modular curve of level 11. by René Schoof and Nikos Tzanakis June 23, 2011 Integral points of a modular curve of level 11 by René Schoof and Nikos Tzanakis Abstract. Using lower bounds for linear forms in elliptic logarithms we determine the integral points of the

More information

Counting points on elliptic curves over F q

Counting points on elliptic curves over F q Counting points on elliptic curves over F q Christiane Peters DIAMANT-Summer School on Elliptic and Hyperelliptic Curve Cryptography September 17, 2008 p.2 Motivation Given an elliptic curve E over a finite

More information

LECTURE 22, WEDNESDAY in lowest terms by H(x) = max{ p, q } and proved. Last time, we defined the height of a rational number x = p q

LECTURE 22, WEDNESDAY in lowest terms by H(x) = max{ p, q } and proved. Last time, we defined the height of a rational number x = p q LECTURE 22, WEDNESDAY 27.04.04 FRANZ LEMMERMEYER Last time, we defined the height of a rational number x = p q in lowest terms by H(x) = max{ p, q } and proved Proposition 1. Let f, g Z[X] be coprime,

More information

Grade 11/12 Math Circles Rational Points on an Elliptic Curves Dr. Carmen Bruni November 11, Lest We Forget

Grade 11/12 Math Circles Rational Points on an Elliptic Curves Dr. Carmen Bruni November 11, Lest We Forget Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 11/12 Math Circles Rational Points on an Elliptic Curves Dr. Carmen Bruni November 11, 2015 - Lest

More information

Arithmetic Progressions Over Quadratic Fields

Arithmetic Progressions Over Quadratic Fields Arithmetic Progressions Over Quadratic Fields Alexander Diaz, Zachary Flores, Markus Vasquez July 2010 Abstract In 1640 Pierre De Fermat proposed to Bernard Frenicle de Bessy the problem of showing that

More information

Congruent Number Problem and Elliptic curves

Congruent Number Problem and Elliptic curves Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using

More information

Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2

Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2 Math 101 Study Session Spring 2016 Test 4 Chapter 10, Chapter 11 Chapter 12 Section 1, and Chapter 12 Section 2 April 11, 2016 Chapter 10 Section 1: Addition and Subtraction of Polynomials A monomial is

More information

Mathematics for Cryptography

Mathematics for Cryptography Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1

More information

CORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS

CORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS CORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS DEPARTMENT OF MATHEMATICS AND STATISTICS UNIVERSITY OF OTTAWA SUPERVISOR: PROFESSOR MONICA NEVINS STUDENT: DANG NGUYEN

More information

p-adic Properites of Elliptic Divisibility Sequences Joseph H. Silverman

p-adic Properites of Elliptic Divisibility Sequences Joseph H. Silverman p-adic Properites of Elliptic Divisibility Sequences Joseph H. Silverman Brown University ICMS Workshop on Number Theory and Computability Edinburgh, Scotland Wednesday, June 27, 2007 0 Elliptic Divisibility

More information

Introduction to Elliptic Curves

Introduction to Elliptic Curves IAS/Park City Mathematics Series Volume XX, XXXX Introduction to Elliptic Curves Alice Silverberg Introduction Why study elliptic curves? Solving equations is a classical problem with a long history. Starting

More information

LEGENDRE S THEOREM, LEGRANGE S DESCENT

LEGENDRE S THEOREM, LEGRANGE S DESCENT LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +

More information

Chapter 4 Finite Fields

Chapter 4 Finite Fields Chapter 4 Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers what constitutes a number

More information

On the Bit Security of Elliptic Curve Diffie Hellman

On the Bit Security of Elliptic Curve Diffie Hellman On the Bit Security of Elliptic Curve Diffie Hellman Barak Shani Department of Mathematics, University of Auckland, New Zealand Abstract This paper gives the first bit security result for the elliptic

More information

20 The modular equation

20 The modular equation 18.783 Elliptic Curves Lecture #20 Spring 2017 04/26/2017 20 The modular equation In the previous lecture we defined modular curves as quotients of the extended upper half plane under the action of a congruence

More information

Katherine Stange. Pairing, Tokyo, Japan, 2007

Katherine Stange. Pairing, Tokyo, Japan, 2007 via via Department of Mathematics Brown University http://www.math.brown.edu/~stange/ Pairing, Tokyo, Japan, 2007 Outline via Definition of an elliptic net via Definition (KS) Let R be an integral domain,

More information

1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.

1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =

More information

Secure Bilinear Diffie-Hellman Bits

Secure Bilinear Diffie-Hellman Bits Secure Bilinear Diffie-Hellman Bits Steven D. Galbraith 1, Herbie J. Hopkins 1, and Igor E. Shparlinski 2 1 Mathematics Department, Royal Holloway University of London Egham, Surrey, TW20 0EX, UK Steven.Galbraith@rhul.ac.uk,

More information

Part 1. For any A-module, let M[x] denote the set of all polynomials in x with coefficients in M, that is to say expressions of the form

Part 1. For any A-module, let M[x] denote the set of all polynomials in x with coefficients in M, that is to say expressions of the form Commutative Algebra Homework 3 David Nichols Part 1 Exercise 2.6 For any A-module, let M[x] denote the set of all polynomials in x with coefficients in M, that is to say expressions of the form m 0 + m

More information

Errata List for Rational Points on Elliptic Curves by Joseph H. Silverman and John Tate Version 1.3a July 5, 1994; revised by JEC, 1998

Errata List for Rational Points on Elliptic Curves by Joseph H. Silverman and John Tate Version 1.3a July 5, 1994; revised by JEC, 1998 Errata List for Rational Points on Elliptic Curves by Joseph H. Silverman and John Tate Version 1.3a July 5, 1994; revised by JEC, 1998 The authors would like to thank the following individuals for their

More information

Aspects of Pairing Inversion

Aspects of Pairing Inversion Applications of Aspects of ECC 2007 - Dublin Aspects of Applications of Applications of Aspects of Applications of Pairings Let G 1, G 2, G T be groups of prime order r. A pairing is a non-degenerate bilinear

More information

Hans Wenzl. 4f(x), 4x 3 + 4ax bx + 4c

Hans Wenzl. 4f(x), 4x 3 + 4ax bx + 4c MATH 104C NUMBER THEORY: NOTES Hans Wenzl 1. DUPLICATION FORMULA AND POINTS OF ORDER THREE We recall a number of useful formulas. If P i = (x i, y i ) are the points of intersection of a line with the

More information

1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11.

1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 000 Chapter 1 Arithmetic in 1.1 The Division Algorithm Revisited 1. (a) q = 4, r = 1. (b) q = 0, r = 0. (c) q = 5, r = 3. 2. (a) q = 9, r = 3. (b) q = 15, r = 17. (c) q = 117, r = 11. 3. (a) q = 6, r =

More information

Ordinary Pairing Friendly Curve of Embedding Degree 3 Whose Order Has Two Large Prime Factors

Ordinary Pairing Friendly Curve of Embedding Degree 3 Whose Order Has Two Large Prime Factors Memoirs of the Faculty of Engineering, Okayama University, Vol. 44, pp. 60-68, January 2010 Ordinary Pairing Friendly Curve of Embedding Degree Whose Order Has Two Large Prime Factors Yasuyuki NOGAMI Graduate

More information

Errata for Stochastic Calculus for Finance II Continuous-Time Models September 2006

Errata for Stochastic Calculus for Finance II Continuous-Time Models September 2006 1 Errata for Stochastic Calculus for Finance II Continuous-Time Models September 6 Page 6, lines 1, 3 and 7 from bottom. eplace A n,m by S n,m. Page 1, line 1. After Borel measurable. insert the sentence

More information

ON ISOGENY GRAPHS OF SUPERSINGULAR ELLIPTIC CURVES OVER FINITE FIELDS

ON ISOGENY GRAPHS OF SUPERSINGULAR ELLIPTIC CURVES OVER FINITE FIELDS ON ISOGENY GRAPHS OF SUPERSINGULAR ELLIPTIC CURVES OVER FINITE FIELDS GORA ADJ, OMRAN AHMADI, AND ALFRED MENEZES Abstract. We study the isogeny graphs of supersingular elliptic curves over finite fields,

More information

Cyclic Groups in Cryptography

Cyclic Groups in Cryptography Cyclic Groups in Cryptography p. 1/6 Cyclic Groups in Cryptography Palash Sarkar Indian Statistical Institute Cyclic Groups in Cryptography p. 2/6 Structure of Presentation Exponentiation in General Cyclic

More information

ELLIPTIC CURVES AND CRYPTOGRAPHY

ELLIPTIC CURVES AND CRYPTOGRAPHY ELLIPTIC CURVES AND CRYPTOGRAPHY JOHN KOPPER Abstract. This paper begins by discussing the foundations of the study of elliptic curves and how a the points on an elliptic curve form an additive group.

More information

Definition of a finite group

Definition of a finite group Elliptic curves Definition of a finite group (G, * ) is a finite group if: 1. G is a finite set. 2. For each a and b in G, also a * b is in G. 3. There is an e in G such that for all a in G, a * e= e *

More information

( ) Chapter 6 ( ) ( ) ( ) ( ) Exercise Set The greatest common factor is x + 3.

( ) Chapter 6 ( ) ( ) ( ) ( ) Exercise Set The greatest common factor is x + 3. Chapter 6 Exercise Set 6.1 1. A prime number is an integer greater than 1 that has exactly two factors, itself and 1. 3. To factor an expression means to write the expression as the product of factors.

More information

Scalar multiplication in compressed coordinates in the trace-zero subgroup

Scalar multiplication in compressed coordinates in the trace-zero subgroup Scalar multiplication in compressed coordinates in the trace-zero subgroup Giulia Bianco and Elisa Gorla Institut de Mathématiques, Université de Neuchâtel Rue Emile-Argand 11, CH-2000 Neuchâtel, Switzerland

More information

ON TORSION POINTS ON AN ELLIPTIC CURVES VIA DIVISION POLYNOMIALS

ON TORSION POINTS ON AN ELLIPTIC CURVES VIA DIVISION POLYNOMIALS UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XLIII 2005 ON TORSION POINTS ON AN ELLIPTIC CURVES VIA DIVISION POLYNOMIALS by Maciej Ulas Abstract. In this note we propose a new way to prove Nagel

More information

Sect Least Common Denominator

Sect Least Common Denominator 4 Sect.3 - Least Common Denominator Concept #1 Writing Equivalent Rational Expressions Two fractions are equivalent if they are equal. In other words, they are equivalent if they both reduce to the same

More information

{ independent variable some property or restriction about independent variable } where the vertical line is read such that.

{ independent variable some property or restriction about independent variable } where the vertical line is read such that. Page 1 of 5 Introduction to Review Materials One key to Algebra success is identifying the type of work necessary to answer a specific question. First you need to identify whether you are dealing with

More information

Katherine Stange. ECC 2007, Dublin, Ireland

Katherine Stange. ECC 2007, Dublin, Ireland in in Department of Brown University http://www.math.brown.edu/~stange/ in ECC Computation of ECC 2007, Dublin, Ireland Outline in in ECC Computation of in ECC Computation of in Definition A integer sequence

More information

CM2104: Computational Mathematics General Maths: 2. Algebra - Factorisation

CM2104: Computational Mathematics General Maths: 2. Algebra - Factorisation CM204: Computational Mathematics General Maths: 2. Algebra - Factorisation Prof. David Marshall School of Computer Science & Informatics Factorisation Factorisation is a way of simplifying algebraic expressions.

More information

Elliptic Curves: Theory and Application

Elliptic Curves: Theory and Application s Phillips Exeter Academy Dec. 5th, 2018 Why Elliptic Curves Matter The study of elliptic curves has always been of deep interest, with focus on the points on an elliptic curve with coe cients in certain

More information

Isogenies in a quantum world

Isogenies in a quantum world Isogenies in a quantum world David Jao University of Waterloo September 19, 2011 Summary of main results A. Childs, D. Jao, and V. Soukharev, arxiv:1012.4019 For ordinary isogenous elliptic curves of equal

More information

Explicit Complex Multiplication

Explicit Complex Multiplication Explicit Complex Multiplication Benjamin Smith INRIA Saclay Île-de-France & Laboratoire d Informatique de l École polytechnique (LIX) Eindhoven, September 2008 Smith (INRIA & LIX) Explicit CM Eindhoven,

More information

Notes on Primitive Roots Dan Klain

Notes on Primitive Roots Dan Klain Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed

More information

Algebra II Vocabulary Word Wall Cards

Algebra II Vocabulary Word Wall Cards Algebra II Vocabulary Word Wall Cards Mathematics vocabulary word wall cards provide a display of mathematics content words and associated visual cues to assist in vocabulary development. The cards should

More information

SM9 identity-based cryptographic algorithms Part 1: General

SM9 identity-based cryptographic algorithms Part 1: General SM9 identity-based cryptographic algorithms Part 1: General Contents 1 Scope... 1 2 Terms and definitions... 1 2.1 identity... 1 2.2 master key... 1 2.3 key generation center (KGC)... 1 3 Symbols and abbreviations...

More information

GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)

GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over

More information

Elliptic curves and modularity

Elliptic curves and modularity Elliptic curves and modularity For background and (most) proofs, we refer to [1]. 1 Weierstrass models Let K be any field. For any a 1, a 2, a 3, a 4, a 6 K consider the plane projective curve C given

More information

Algebra I Vocabulary Cards

Algebra I Vocabulary Cards Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression

More information

MS 2001: Test 1 B Solutions

MS 2001: Test 1 B Solutions MS 2001: Test 1 B Solutions Name: Student Number: Answer all questions. Marks may be lost if necessary work is not clearly shown. Remarks by me in italics and would not be required in a test - J.P. Question

More information

disc f R 3 (X) in K[X] G f in K irreducible S 4 = in K irreducible A 4 in K reducible D 4 or Z/4Z = in K reducible V Table 1

disc f R 3 (X) in K[X] G f in K irreducible S 4 = in K irreducible A 4 in K reducible D 4 or Z/4Z = in K reducible V Table 1 GALOIS GROUPS OF CUBICS AND QUARTICS IN ALL CHARACTERISTICS KEITH CONRAD 1. Introduction Treatments of Galois groups of cubic and quartic polynomials usually avoid fields of characteristic 2. Here we will

More information

ARITHMETIC PROGRESSIONS OF THREE SQUARES

ARITHMETIC PROGRESSIONS OF THREE SQUARES ARITHMETIC PROGRESSIONS OF THREE SQUARES KEITH CONRAD 1 Introduction Here are the first 10 perfect squares (ignoring 0): 1, 4, 9, 16, 25, 36, 49, 64, 81, 100 In this list there is an arithmetic progression:

More information

Constructing Families of Pairing-Friendly Elliptic Curves

Constructing Families of Pairing-Friendly Elliptic Curves Constructing Families of Pairing-Friendly Elliptic Curves David Freeman Information Theory Research HP Laboratories Palo Alto HPL-2005-155 August 24, 2005* cryptography, pairings, elliptic curves, embedding

More information

ARITHMETIC PROGRESSIONS OF THREE SQUARES

ARITHMETIC PROGRESSIONS OF THREE SQUARES ARITHMETIC PROGRESSIONS OF THREE SQUARES KEITH CONRAD 1. Introduction Here are the first 10 perfect squares (ignoring 0): 1, 4, 9, 16, 25, 36, 49, 64, 81, 100. In this list there is an arithmetic progression:

More information

Eighth Homework Solutions

Eighth Homework Solutions Math 4124 Wednesday, April 20 Eighth Homework Solutions 1. Exercise 5.2.1(e). Determine the number of nonisomorphic abelian groups of order 2704. First we write 2704 as a product of prime powers, namely

More information

Elliptic Curves over Q

Elliptic Curves over Q Elliptic Curves over Q Peter Birkner Technische Universiteit Eindhoven DIAMANT Summer School on Elliptic and Hyperelliptic Curve Cryptography 16 September 2008 What is an elliptic curve? (1) An elliptic

More information

3.4. ZEROS OF POLYNOMIAL FUNCTIONS

3.4. ZEROS OF POLYNOMIAL FUNCTIONS 3.4. ZEROS OF POLYNOMIAL FUNCTIONS What You Should Learn Use the Fundamental Theorem of Algebra to determine the number of zeros of polynomial functions. Find rational zeros of polynomial functions. Find

More information

Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q

Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q Computing a Lower Bound for the Canonical Height on Elliptic Curves over Q John Cremona 1 and Samir Siksek 2 1 School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7

More information

LECTURE 5, FRIDAY

LECTURE 5, FRIDAY LECTURE 5, FRIDAY 20.02.04 FRANZ LEMMERMEYER Before we start with the arithmetic of elliptic curves, let us talk a little bit about multiplicities, tangents, and singular points. 1. Tangents How do we

More information

Elliptic Curves: An Introduction

Elliptic Curves: An Introduction Elliptic Curves: An Introduction Adam Block December 206 Introduction The goal of the following paper will be to explain some of the history of and motivation for elliptic curves, to provide examples and

More information

Common Divisors of Elliptic Divisibility Sequences over Function Fields

Common Divisors of Elliptic Divisibility Sequences over Function Fields Common Divisors of Elliptic Divisibility Sequences over Function Fields Jori W. Matthijssen Master Thesis written at the University of Utrecht, under the supervision of Prof. Gunther Cornelissen. September

More information

Selected Math 553 Homework Solutions

Selected Math 553 Homework Solutions Selected Math 553 Homework Solutions HW6, 1. Let α and β be rational numbers, with α 1/2, and let m > 0 be an integer such that α 2 mβ 2 = 1 δ where 0 δ < 1. Set ǫ:= 1 if α 0 and 1 if α < 0. Show that

More information

Number Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.

Number Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory. CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,

More information

LECTURE 2 FRANZ LEMMERMEYER

LECTURE 2 FRANZ LEMMERMEYER LECTURE 2 FRANZ LEMMERMEYER Last time we have seen that the proof of Fermat s Last Theorem for the exponent 4 provides us with two elliptic curves (y 2 = x 3 + x and y 2 = x 3 4x) in the guise of the quartic

More information

Introduction to Elliptic Curve Cryptography. Anupam Datta

Introduction to Elliptic Curve Cryptography. Anupam Datta Introduction to Elliptic Curve Cryptography Anupam Datta 18-733 Elliptic Curve Cryptography Public Key Cryptosystem Duality between Elliptic Curve Cryptography and Discrete Log Based Cryptography Groups

More information

Algebra I Vocabulary Cards

Algebra I Vocabulary Cards Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Order of Operations Expression Variable Coefficient

More information

The Congruent Number Problem and the Birch and Swinnerton-Dyer Conjecture. Florence Walton MMathPhil

The Congruent Number Problem and the Birch and Swinnerton-Dyer Conjecture. Florence Walton MMathPhil The Congruent Number Problem and the Birch and Swinnerton-Dyer Conjecture Florence Walton MMathPhil Hilary Term 015 Abstract This dissertation will consider the congruent number problem (CNP), the problem

More information

ERRATA. Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on February 14, 2018)

ERRATA. Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on February 14, 2018) ERRATA Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on February 14, 2018) These are errata for the Third Edition of the book. Errata from previous editions have been

More information

Curves, Cryptography, and Primes of the Form x 2 + y 2 D

Curves, Cryptography, and Primes of the Form x 2 + y 2 D Curves, Cryptography, and Primes of the Form x + y D Juliana V. Belding Abstract An ongoing challenge in cryptography is to find groups in which the discrete log problem hard, or computationally infeasible.

More information

A Digital Signature Scheme based on two hard problems

A Digital Signature Scheme based on two hard problems A Digital Signature Scheme based on two hard problems Dimitrios Poulakis and Robert Rolland Abstract In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization

More information

Some Efficient Algorithms for the Final Exponentiation of η T Pairing

Some Efficient Algorithms for the Final Exponentiation of η T Pairing Some Efficient Algorithms for the Final Exponentiation of η T Pairing Masaaki Shirase 1, Tsuyoshi Takagi 1, and Eiji Okamoto 2 1 Future University-Hakodate, Japan 2 University of Tsukuba, Japan Abstract.

More information

x = x y and y = x + y.

x = x y and y = x + y. 8. Conic sections We can use Legendre s theorem, (7.1), to characterise all rational solutions of the general quadratic equation in two variables ax 2 + bxy + cy 2 + dx + ey + ef 0, where a, b, c, d, e

More information

Number Fields Generated by Torsion Points on Elliptic Curves

Number Fields Generated by Torsion Points on Elliptic Curves Number Fields Generated by Torsion Points on Elliptic Curves Kevin Liu under the direction of Chun Hong Lo Department of Mathematics Massachusetts Institute of Technology Research Science Institute July

More information

Modern Number Theory: Rank of Elliptic Curves

Modern Number Theory: Rank of Elliptic Curves Modern Number Theory: Rank of Elliptic Curves Department of Mathematics University of California, Irvine October 24, 2007 Rank of Outline 1 Introduction Basics Algebraic Structure 2 The Problem Relation

More information

Elliptic curve cryptography. Matthew England MSc Applied Mathematical Sciences Heriot-Watt University

Elliptic curve cryptography. Matthew England MSc Applied Mathematical Sciences Heriot-Watt University Elliptic curve cryptography Matthew England MSc Applied Mathematical Sciences Heriot-Watt University Summer 2006 Abstract This project studies the mathematics of elliptic curves, starting with their derivation

More information

Divisibility Sequences for Elliptic Curves with Complex Multiplication

Divisibility Sequences for Elliptic Curves with Complex Multiplication Divisibility Sequences for Elliptic Curves with Complex Multiplication Master s thesis, Universiteit Utrecht supervisor: Gunther Cornelissen Universiteit Leiden Journées Arithmétiques, Edinburgh, July

More information

THERE ARE NO ELLIPTIC CURVES DEFINED OVER Q WITH POINTS OF ORDER 11

THERE ARE NO ELLIPTIC CURVES DEFINED OVER Q WITH POINTS OF ORDER 11 THERE ARE NO ELLIPTIC CURVES DEFINED OVER Q WITH POINTS OF ORDER 11 ALLAN LACY 1. Introduction If E is an elliptic curve over Q, the set of rational points E(Q), form a group of finite type (Mordell-Weil

More information

Elliptic Curves Spring 2017 Lecture #5 02/22/2017

Elliptic Curves Spring 2017 Lecture #5 02/22/2017 18.783 Elliptic Curves Spring 017 Lecture #5 0//017 5 Isogenies In almost every branch of mathematics, when considering a category of mathematical objects with a particular structure, the maps between

More information

FINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016

FINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016 FINITE GROUPS AND EQUATIONS OVER FINITE FIELDS A PROBLEM SET FOR ARIZONA WINTER SCHOOL 2016 PREPARED BY SHABNAM AKHTARI Introduction and Notations The problems in Part I are related to Andrew Sutherland

More information

Fall 2004 Homework 7 Solutions

Fall 2004 Homework 7 Solutions 18.704 Fall 2004 Homework 7 Solutions All references are to the textbook Rational Points on Elliptic Curves by Silverman and Tate, Springer Verlag, 1992. Problems marked (*) are more challenging exercises

More information

Simplifying Rational Expressions and Functions

Simplifying Rational Expressions and Functions Department of Mathematics Grossmont College October 15, 2012 Recall: The Number Types Definition The set of whole numbers, ={0, 1, 2, 3, 4,...} is the set of natural numbers unioned with zero, written

More information

An Additive Characterization of Fibers of Characters on F p

An Additive Characterization of Fibers of Characters on F p An Additive Characterization of Fibers of Characters on F p Chris Monico Texas Tech University Lubbock, TX c.monico@ttu.edu Michele Elia Politecnico di Torino Torino, Italy elia@polito.it January 30, 2009

More information

HASSE-MINKOWSKI THEOREM

HASSE-MINKOWSKI THEOREM HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.

More information

HOME ASSIGNMENT: ELLIPTIC CURVES OVER FINITE FIELDS

HOME ASSIGNMENT: ELLIPTIC CURVES OVER FINITE FIELDS HOME ASSIGNMENT: ELLIPTIC CURVES OVER FINITE FIELDS DANIEL LARSSON CONTENTS 1. Introduction 1 2. Finite fields 1 3. Elliptic curves over finite fields 3 4. Zeta functions and the Weil conjectures 6 1.

More information

ERRATA. Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on March 4, 2009)

ERRATA. Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on March 4, 2009) ERRATA Abstract Algebra, Third Edition by D. Dummit and R. Foote (most recently revised on March 4, 2009) These are errata for the Third Edition of the book. Errata from previous editions have been fixed

More information

Twists of elliptic curves of rank at least four

Twists of elliptic curves of rank at least four 1 Twists of elliptic curves of rank at least four K. Rubin 1 Department of Mathematics, University of California at Irvine, Irvine, CA 92697, USA A. Silverberg 2 Department of Mathematics, University of

More information

Fast hashing to G2 on pairing friendly curves

Fast hashing to G2 on pairing friendly curves Fast hashing to G2 on pairing friendly curves Michael Scott, Naomi Benger, Manuel Charlemagne, Luis J. Dominguez Perez, and Ezekiel J. Kachisa School of Computing Dublin City University Ballymun, Dublin

More information

Topics in Number Theory: Elliptic Curves

Topics in Number Theory: Elliptic Curves Topics in Number Theory: Elliptic Curves Yujo Chen April 29, 2016 C O N T E N T S 0.1 Motivation 3 0.2 Summary and Purpose 3 1 algebraic varieties 5 1.1 Affine Varieties 5 1.2 Projective Varieties 7 1.3

More information

PELL S EQUATION, II KEITH CONRAD

PELL S EQUATION, II KEITH CONRAD PELL S EQUATION, II KEITH CONRAD 1. Introduction In Part I we met Pell s equation x dy = 1 for nonsquare positive integers d. We stated Lagrange s theorem that every Pell equation has a nontrivial solution

More information

On a Problem of Steinhaus

On a Problem of Steinhaus MM Research Preprints, 186 193 MMRC, AMSS, Academia, Sinica, Beijing No. 22, December 2003 On a Problem of Steinhaus DeLi Lei and Hong Du Key Lab of Mathematics Mechanization Institute of Systems Science,

More information

Post-quantum security models for authenticated encryption

Post-quantum security models for authenticated encryption Post-quantum security models for authenticated encryption Vladimir Soukharev David R. Cheriton School of Computer Science February 24, 2016 Introduction Bellare and Namprempre in 2008, have shown that

More information

Elliptic Curves. Giulia Mauri. Politecnico di Milano website:

Elliptic Curves. Giulia Mauri. Politecnico di Milano   website: Elliptic Curves Giulia Mauri Politecnico di Milano email: giulia.mauri@polimi.it website: http://home.deib.polimi.it/gmauri May 13, 2015 Giulia Mauri (DEIB) Exercises May 13, 2015 1 / 34 Overview 1 Elliptic

More information

Algebra I. Book 2. Powered by...

Algebra I. Book 2. Powered by... Algebra I Book 2 Powered by... ALGEBRA I Units 4-7 by The Algebra I Development Team ALGEBRA I UNIT 4 POWERS AND POLYNOMIALS......... 1 4.0 Review................ 2 4.1 Properties of Exponents..........

More information

Deducing Polynomial Division Algorithms using a Groebner Basis

Deducing Polynomial Division Algorithms using a Groebner Basis Deducing Polynomial Division Algorithms using a Groebner Basis In the previous Chapter I discussed a method of finding the real root of an associated cubic polynomial using a modular function, the eta

More information