Presentation is loading. Please wait.

Presentation is loading. Please wait.

Discrete Methods in Mathematical Informatics Lecture 1: What is Elliptic Curve? 9 th October 2012 Vorapong Suppakitpaisarn

Published byMay Floyd Modified over 9 years ago

Similar presentations

Presentation on theme: "Discrete Methods in Mathematical Informatics Lecture 1: What is Elliptic Curve? 9 th October 2012 Vorapong Suppakitpaisarn"— Presentation transcript:

1 Discrete Methods in Mathematical Informatics Lecture 1: What is Elliptic Curve? 9 th October 2012 Vorapong Suppakitpaisarn http://www-imai.is.s.u-tokyo.ac.jp/~mr_t_dtone/ vorapong@mist.i.u-tokyo.ac.jp, Eng. 6 Room 363 Download Slide at: https://www.dropbox.com/s/xzk4dv50f4cvs18/Lecture%201.pptx?m

2 First Section of This Course [5 lectures] Lecture 1: What is Elliptic Curve? Lecture 2: Elliptic Curve Cryptography Lecture 3-4: Fast Implementation for Elliptic Curve Cryptography Lecture 5: Factoring and Primality Testing L. C. Washington, “Elliptic Curves: Number Theory and Cryptography”, Chapman & Hall/CRC, 2003. Lecture 1: Chapter 1, Chapter 2 (2.1, 2.2) Lecture 2: Chapter 6 (6.1 – 6.6) Lecture 5: Chapter 7 L. C. Washington, “Elliptic Curves: Number Theory and Cryptography”, Chapman & Hall/CRC, 2003. Lecture 1: Chapter 1, Chapter 2 (2.1, 2.2) Lecture 2: Chapter 6 (6.1 – 6.6) Lecture 5: Chapter 7 Recommended Reading H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, F. Vercauteren, "Handbook of Elliptic and Hyperelliptic Curve Cryptography", Chapman & Hall/CRC, 2005. A. Cilardo, L. Coppolino, N. Mazzocca, L. Romano, "Elliptic Curve Cryptography Engineering", Proc. of IEEE Vol. 94, No. 2, pp. 395- 406 (2006). H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, F. Vercauteren, "Handbook of Elliptic and Hyperelliptic Curve Cryptography", Chapman & Hall/CRC, 2005. A. Cilardo, L. Coppolino, N. Mazzocca, L. Romano, "Elliptic Curve Cryptography Engineering", Proc. of IEEE Vol. 94, No. 2, pp. 395- 406 (2006). In each lecture, 1-2 exercises will be given, Choose 3 Problems out of them. Submit to vorapong@mist.i.u-tokyo.ac.jp before 31 Dec 2012 In each lecture, 1-2 exercises will be given, Choose 3 Problems out of them. Submit to vorapong@mist.i.u-tokyo.ac.jp before 31 Dec 2012 Grading

3 First Section of This Course [5 lectures] Lecture 1: What is Elliptic Curve? Lecture 2: Elliptic Curve Cryptography Lecture 3-4: Fast Implementation for Elliptic Curve Cryptography Lecture 5: Factoring and Primality Testing L. C. Washington, “Elliptic Curves: Number Theory and Cryptography”, Chapman & Hall/CRC, 2003. Lecture 1: Chapter 1, Chapter 2 (2.1, 2.2) Lecture 2: Chapter 6 (6.1 – 6.6) Lecture 5: Chapter 7 L. C. Washington, “Elliptic Curves: Number Theory and Cryptography”, Chapman & Hall/CRC, 2003. Lecture 1: Chapter 1, Chapter 2 (2.1, 2.2) Lecture 2: Chapter 6 (6.1 – 6.6) Lecture 5: Chapter 7 Recommended Reading H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, F. Vercauteren, "Handbook of Elliptic and Hyperelliptic Curve Cryptography", Chapman & Hall/CRC, 2005. A. Cilardo, L. Coppolino, N. Mazzocca, L. Romano, "Elliptic Curve Cryptography Engineering", Proc. of IEEE Vol. 94, No. 2, pp. 395- 406 (2006). H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, F. Vercauteren, "Handbook of Elliptic and Hyperelliptic Curve Cryptography", Chapman & Hall/CRC, 2005. A. Cilardo, L. Coppolino, N. Mazzocca, L. Romano, "Elliptic Curve Cryptography Engineering", Proc. of IEEE Vol. 94, No. 2, pp. 395- 406 (2006). In each lecture, 1-2 exercises will be given, Choose 3 Problems out of them. Submit to vorapong@mist.i.u-tokyo.ac.jp before 31 Dec 2012 In each lecture, 1-2 exercises will be given, Choose 3 Problems out of them. Submit to vorapong@mist.i.u-tokyo.ac.jp before 31 Dec 2012 Grading

4 Problem 1: The Artillerymens Dilemma (is not a) Puzzle http://cashflowco.hubpages.com/ ? Height = 0: 0 Ball  Square Height = 1: 1 Ball  Square Height = 2: 1 + 4 = 5 Balls  Not Square Height = 3: 1 + 4 + 9 = 14 Balls  Not Square Height = 4: 1 + 4 + 9 + 16 = 30 Balls  Not Square Elliptic Curve

5 Problem 1: The Artillerymens Dilemma (is not a) Puzzle (cont.) (0,0) (1,1) y = x (1/2,1/2)

6 Problem 1: The Artillerymens Dilemma (is not a) Puzzle (cont.) (0,0) (1,1) y = x (1/2,1/2) (1/2,-1/2) y = 3x-2

7 Problem 2: Right Triangle with Rational Sides We want to find a right triangle with rational sides in which area = 5 3 4 5 6 15 8 17 60 15/2 4 17/2 15 5

8 Problem 2: Right Triangle with Rational Sides (cont.) a b c ab/2 = 5 Elliptic Curve Note

9 Problem 2: Right Triangle with Rational Sides (cont.) (-4,6)

10 Problem 2: Right Triangle with Rational Sides (cont.) (-4,6) (1681/144,62279/1728)

11 Problem 2: Right Triangle with Rational Sides (cont.) 20/3 3/2 41/6 5 (-4,6) (1681/144,62279/1728)

12 Exercises Exercise 1 Exercise 2

13 Problem 3: Fermat’s Last Theorem http://wikipedia.com/ Conjectured by Pierre de Fermat in Arithmetica (1637). “I have discovered a marvellous proof to this theorem, that this margin is too narrow to contain” There are more than 1,000 attempts, but the theorem is not proved until 1995 by Andrew Wiles. One of his main tools is Elliptic Curve!!!

14 Problem 3: Fermat’s Last Theorem (cont.) Fermat kindly provided the proof for the case when n = 4 Elliptic Curve By several elliptic curves techniques, Fermat found that all rational solutions of the elliptic curve are (0,0), (2,0), (-2,0)

15 Formal Definitions of Elliptic Curve (0,0) (1,1) y = x (1/2,1/2) (1/2,-1/2) Weierstrass Equation Elliptic Curve Point Addition

16 Formal Definitions of Elliptic Curve (cont.) Point Addition

17 Formal Definitions of Elliptic Curve (cont.) x = 1/2 (1/2,1/2) (1/2,-1/2) Point Addition Point Double (-4,6) (1681/144,62279/1728)

18 Formal Definitions of Elliptic Curve (cont.) Point Double

19 First Section of This Course [5 lectures] Lecture 1: What is Elliptic Curve? Lecture 2: Elliptic Curve Cryptography Lecture 3-4: Fast Implementation for Elliptic Curve Cryptography Lecture 5: Factoring and Primality Testing L. C. Washington, “Elliptic Curves: Number Theory and Cryptography”, Chapman & Hall/CRC, 2003. Lecture 1: Chapter 1, Chapter 2 (2.1, 2.2) Lecture 2: Chapter 6 (6.1 – 6.6) Lecture 5: Chapter 7 L. C. Washington, “Elliptic Curves: Number Theory and Cryptography”, Chapman & Hall/CRC, 2003. Lecture 1: Chapter 1, Chapter 2 (2.1, 2.2) Lecture 2: Chapter 6 (6.1 – 6.6) Lecture 5: Chapter 7 Recommended Reading H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, F. Vercauteren, "Handbook of Elliptic and Hyperelliptic Curve Cryptography", Chapman & Hall/CRC, 2005. A. Cilardo, L. Coppolino, N. Mazzocca, L. Romano, "Elliptic Curve Cryptography Engineering", Proc. of IEEE Vol. 94, No. 2, pp. 395- 406 (2006). H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, F. Vercauteren, "Handbook of Elliptic and Hyperelliptic Curve Cryptography", Chapman & Hall/CRC, 2005. A. Cilardo, L. Coppolino, N. Mazzocca, L. Romano, "Elliptic Curve Cryptography Engineering", Proc. of IEEE Vol. 94, No. 2, pp. 395- 406 (2006). In each lecture, 1-2 exercises will be given, Choose 3 Problems out of them. Submit to vorapong@mist.i.u-tokyo.ac.jp before 31 Dec 2012 In each lecture, 1-2 exercises will be given, Choose 3 Problems out of them. Submit to vorapong@mist.i.u-tokyo.ac.jp before 31 Dec 2012 Grading

20 Exercises Exercise 1 Exercise 2

21 Thank you for your attention Please feel free to ask questions or comment.

22 Scalar Multiplication Scalar Multiplication on Elliptic Curve S = P + P + … + P = rP when r 1 is positive integer, S,P is a member of the curve Double-and-add method Let r = 14 = (01110) 2 Compute rP = 14P r = 14 = (0 1 1 1 0) 2 Weight = 3 P3P3P7P7P14P 6P6P2P2P 3 – 1 = 2 Point Additions 4 – 1 = 3 Point Doubles r times O

Download ppt "Discrete Methods in Mathematical Informatics Lecture 1: What is Elliptic Curve? 9 th October 2012 Vorapong Suppakitpaisarn"

Similar presentations

Fermat’s Last Theorem Dr. S. Lawrence ©2005.

Fermat’s Last Theorem Dr. S. Lawrence ©2005.
Discrete Methods in Mathematical Informatics Lecture 3: Other Applications of Elliptic Curve 23h October 2012 Vorapong Suppakitpaisarn http://www-imai.is.s.u-tokyo.ac.jp/~mr_t_dtone/

Discrete Methods in Mathematical Informatics Lecture 3: Other Applications of Elliptic Curve 23h October 2012 Vorapong Suppakitpaisarn
Proving Fermat’s last theorem FLT and lessons on the nature and practice of mathematics.

Proving Fermat’s last theorem FLT and lessons on the nature and practice of mathematics.
SPLASH! 2012 QUADRATIC RECIPROCITY Michael Belland.

SPLASH! 2012 QUADRATIC RECIPROCITY Michael Belland.
Fermat’s Last Theorem by Kelly Oakes. Pierre de Fermat (1601 – 1665) Born in Beaumont-de-Lomagne, 36 miles north- west of Toulouse, in France. He was.

Fermat’s Last Theorem by Kelly Oakes. Pierre de Fermat (1601 – 1665) Born in Beaumont-de-Lomagne, 36 miles north- west of Toulouse, in France. He was.
Cryptography and Network Security Chapter 8 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Modified – Tom Noack.

Cryptography and Network Security Chapter 8 Fourth Edition by William Stallings Lecture slides by Lawrie Brown Modified – Tom Noack.
Introduction to Elliptic Curves. What is an Elliptic Curve? An Elliptic Curve is a curve given by an equation E : y 2 = f(x) Where f(x) is a square-free.

Introduction to Elliptic Curves. What is an Elliptic Curve? An Elliptic Curve is a curve given by an equation E : y 2 = f(x) Where f(x) is a square-free.
Cannonballs, Donuts, and Secrets

Cannonballs, Donuts, and Secrets
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,

Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
Discrete Methods in Mathematical Informatics Lecture 2: Elliptic Curve Cryptography 16 th October 2012 Vorapong Suppakitpaisarn

Discrete Methods in Mathematical Informatics Lecture 2: Elliptic Curve Cryptography 16 th October 2012 Vorapong Suppakitpaisarn
More Number Theory Proofs Rosen 1.5, 3.1. Prove or Disprove If m and n are even integers, then mn is divisible by 4. The sum of two odd integers is odd.

More Number Theory Proofs Rosen 1.5, 3.1. Prove or Disprove If m and n are even integers, then mn is divisible by 4. The sum of two odd integers is odd.
Number Theory: Fermat’s Last Theorem Fermat’s last conjecture/Wiles’ Theorem: For n>2 the equation x n +y n =z n has no solutions in terms of non-zero.

Number Theory: Fermat’s Last Theorem Fermat’s last conjecture/Wiles’ Theorem: For n>2 the equation x n +y n =z n has no solutions in terms of non-zero.
Set, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides.

Set, Combinatorics, Probability, and Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides.
Math 409/409G History of Mathematics Pythagorean Triples.

Math 409/409G History of Mathematics Pythagorean Triples.
Fermat’s Last Theorem Samina Saleem Math5400. Introduction The Problem The seventeenth century mathematician Pierre de Fermat created the Last Theorem.

Fermat’s Last Theorem Samina Saleem Math5400. Introduction The Problem The seventeenth century mathematician Pierre de Fermat created the Last Theorem.
A GENERALIZATION OF FERMAT’S LAST THEOREM BY ALHAJI ALKALI* AND G. U. GARBA DEPARTMENT OF MATHEMATICS AHMADU BELLO UNIVERSITY, ZARIA A PAPER PRESENTED.

A GENERALIZATION OF FERMAT’S LAST THEOREM BY ALHAJI ALKALI* AND G. U. GARBA DEPARTMENT OF MATHEMATICS AHMADU BELLO UNIVERSITY, ZARIA A PAPER PRESENTED.
Number Theory – Introduction (1/22) Very general question: What is mathematics? Possible answer: The search for structure and patterns in the universe.

Number Theory – Introduction (1/22) Very general question: What is mathematics? Possible answer: The search for structure and patterns in the universe.
BY RICKY LIU Fermat’s The last theorem, his proof and the author of the proof.

BY RICKY LIU Fermat’s The last theorem, his proof and the author of the proof.
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.

CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
 2012 Pearson Education, Inc. Slide 5-3-1 Chapter 5 Number Theory.

 2012 Pearson Education, Inc. Slide Chapter 5 Number Theory.

Similar presentations

Ads by Google