Cannonballs, Donuts, and Secrets

Slides:



Advertisements
Similar presentations
Diffie-Hellman Diffie-Hellman is a public key distribution scheme First public-key type scheme, proposed in 1976.
Advertisements

1 Key Exchange Solutions Diffie-Hellman Protocol Needham Schroeder Protocol X.509 Certification.
An Introduction to Pairing Based Cryptography Dustin Moody October 31, 2008.
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.
1 Chapter 7-2 Signature Schemes. 2 Outline [1] Introduction [2] Security Requirements for Signature Schemes [3] The ElGamal Signature Scheme [4] Variants.
Higher Mathematics: Unit 1.3 Introduction to Differentiation
Find the slope of the tangent line to the graph of f at the point ( - 1, 10 ). f ( x ) = 6 - 4x
1 390-Elliptic Curves and Elliptic Curve Cryptography Michael Karls.
Factoring Polynomials
What is Elliptic Curve Cryptography?
Notation Intro. Number Theory Online Cryptography Course Dan Boneh
YSLInformation Security -- Public-Key Cryptography1 Elliptic Curve Cryptography (ECC) For the same length of keys, faster than RSA For the same degree.
Chapter 11 Polynomial Functions
ELECTRONIC PAYMENT SYSTEMSFALL 2002COPYRIGHT © 2002 MICHAEL I. SHAMOS Electronic Payment Systems Lecture 6 Epayment Security II.
OOP/Java1 Public Key Crytography From: Introduction to Algorithms Cormen, Leiserson and Rivest.
Elliptic Curve Cryptography (ECC) Mustafa Demirhan Bhaskar Anepu Ajit Kunjal.
Windows Core Security1© 2006 Microsoft Corp Cryptography: Helping Number Theorists Bring Home the Bacon Since 1977 Dan Shumow SDE Windows Core Security.
Public Key Crytography1 From: Introduction to Algorithms Cormen, Leiserson and Rivest.
APPLICATIONS OF DIFFERENTIATION Newton’s Method In this section, we will learn: How to solve high-degree equations using Newton’s method. APPLICATIONS.
Cryptography Lecture 11: Oct 12. Cryptography AliceBob Cryptography is the study of methods for sending and receiving secret messages. adversary Goal:
Dr. Lo’ai Tawalbeh Fall 2005 Chapter 10 – Key Management; Other Public Key Cryptosystems Dr. Lo’ai Tawalbeh Computer Engineering Department Jordan University.
Electronic Payment Systems Lecture 5: ePayment Security II
WS Algorithmentheorie 03 – Randomized Algorithms (Public Key Cryptosystems) Prof. Dr. Th. Ottmann.
Theory I Algorithm Design and Analysis (9 – Randomized algorithms) Prof. Dr. Th. Ottmann.
Copyright © Cengage Learning. All rights reserved. 5 Integrals.
ELECTRONIC PAYMENT SYSTEMSFALL 2001COPYRIGHT © 2001 MICHAEL I. SHAMOS Electronic Payment Systems Lecture 6 Epayment Security II.
CPE5021 Advanced Network Security --- Advanced Cryptography: Elliptic Curve Cryptography --- Lecture 3 CPE5021 Advanced Network Security --- Advanced Cryptography:
CSCI 172/283 Fall 2010 Public Key Cryptography. New paradigm introduced by Diffie and Hellman The mailbox analogy: Bob has a locked mailbox Alice can.
Lecture 6: Public Key Cryptography
1 CIS 5371 Cryptography 8. Asymmetric encryption-.
9.1 Square Roots and the Pythagorean Theorem
ElGamal Public Key Cryptography CS 303 Alg. Number Theory & Cryptography Jeremy Johnson Taher ElGamal, "A Public-Key Cryptosystem and a Signature Scheme.
Chapter 3 Greek Number Theory The Role of Number Theory Polygonal, Prime and Perfect Numbers The Euclidean Algorithm Pell’s Equation The Chord and Tangent.
10.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 10 Symmetric-Key Cryptography.
Unit 6: Modeling Mathematics 3 Ms. C. Taylor. Warm-Up.
Application of Elliptic Curves to Cryptography
Great Theoretical Ideas in Computer Science.
Cryptography Dec 29. This Lecture In this last lecture for number theory, we will see probably the most important application of number theory in computer.
INTEGRALS Areas and Distances INTEGRALS In this section, we will learn that: We get the same special type of limit in trying to find the area under.
Cryptography and Network Security Chapter 10 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.
Copyright © Cengage Learning. All rights reserved. 4 Integrals.
PUBLIC-KEY CRYPTOGRAPH IT 352 : Lecture 2- part3 Najwa AlGhamdi, MSc – 2012 /1433.
Number Starter Split the clock in two so that the sum of the numbers on each half are the same.
CRYPTOGRAPHY. WHAT IS PUBLIC-KEY ENCRYPTION? Encryption is the key to information security The main idea- by using only public information, a sender can.
2.14 Solving Word Problems Getting Started!. There’s an amazing fact about a certain number. This fact is called “the four 4’s.” Using the number, you.
Public Key Cryptosystem Introduced in 1976 by Diffie and Hellman [2] In PKC different keys are used for encryption and decryption 1978: First Two Implementations.
An Introduction to Elliptic Curve Cryptography
Elliptic Curves Number Theory and Cryptography. A Pile of Cannonballs A Square of Cannonballs.
Cryptography issues – elliptic curves Presented by Tom Nykiel.
Conditional Probability
Elliptic Curve Crypto & ECC Diffie-Hellman Presenter: Le Thanh Binh.
7.7 Inverse Relations and Functions. Using a graphing calculator, graph the pairs of equations on the same graph. Sketch your results. Be sure to use.
1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.
Diffie-Hellman Key Exchange first public-key type scheme proposed by Diffie & Hellman in 1976 along with the exposition of public key concepts – note:
Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.
1 Diffie-Hellman (Key Exchange) Protocol Rocky K. C. Chang 9 February 2007.
최신정보보호기술 경일대학교 사이버보안학과 김 현성.
Elliptic Curve Public Key Cryptography
Copyright © Cengage Learning. All rights reserved.
Elliptic Curves.
Elliptic Curve Cryptography (ECC)
Diffie-Hellman Key-Exchange Algorithm
3.5 Write and Graph Equations of Lines
Elliptic Curve Cryptography (ECC)
El Gamal and Diffie Hellman
Practical Aspects of Modern Cryptography
Introduction to Elliptic Curve Cryptography
Geometry Section 3.5.
Presentation transcript:

Cannonballs, Donuts, and Secrets An introduction to elliptic curve cryptography Larry Washington, University of Maryland G. Milton Wing Lecture Series, University of Rochester

A Pile of Cannonballs A Square of Cannonballs

1 4 9 .

The number of cannonballs in x layers is = x (x + 1) (2x + 1)/6 x=3: 1 + 4 + 9 = 3(4)(7)/6 = 14

If x layers of the pyramid yield a y by y square, we need y2 = 1 + 4 + 9 + . . . + x2 y2 = x (x + 1) (2x + 1)/6

y2 = x (x + 1) (2x + 1)/6

y2 = x (x + 1) (2x + 1)/6 and y = x

1 + 4 + 9 + . . . + 242 = 702

Is there a right triangle with rational sides whose area is 5 ? a2 + b2 = c2 ab/2 = 5 c b a If we have a, b, c, let x-5 = ( ) . Then x+5= ( ) and x = ( ) c 2 2 a-b 2 2 a+b 2 2 ___ ___ ___ Then x3 – 25x = x(x-5)(x+5) is a square.

We need points on the curve y2 = x3 – 25x with rational coordinates. (x, y) = (-4, 6) is a point on the curve. Draw the tangent line at this point. The intersection point has x = 1681/144 = (41/12)2

41/6 3/2 20/3 We can use the tangent line at this new point and find another triangle: 3344161/747348 4920/1519 1519/492

An elliptic curve is the graph of an equation y2 = cubic polynomial in x For example, y2 = x3 – 5x + 12

Start with P1. We get P2.

Using P1 and P2, we get P3.

Using P1 and P3, we get P4.

We get points P1, P2, P3, . . . , Pn , . . . Useful facts: If we take the line through Pm and Pn and reflect the third point of intersection across the y-axis, we get Pn+m If we start with P1 , after m steps we get Pm If we start with Pm , after n steps we get Pmn

Given n , it is easy to compute Pn All of these calculations are done mod a big prime. Otherwise, the computer overflows. Given n , it is easy to compute Pn (even when n is a 1000-digit number) Given Pn , it is very difficult to figure out the value of n .

Is this good for anything?

There is no branch of mathematics, however abstract, which may not someday be applied to the phenomena of the real world. —Nikolai Lobachevsky (1792-1856)

“Do you know the secret?”

The Eavesdropper

The secret is a 200-digit integer s. Prove to me that you know the secret. I send you a random point P1. You compute PS and send it back to me. If your answer is correct, I decide that you know the secret.

3. Alice computes Pa and Bob computes Pb. They exchange Pa and Pb. Diffie – Hellman Key Establishment Alice and Bob want to agree on a key for use in a cryptosystem. 1. They choose an elliptic curve and a point P1 on the curve. 2. Alice chooses a secret integer a and Bob chooses a secret integer b. 3. Alice computes Pa and Bob computes Pb. They exchange Pa and Pb. 4. Alice does a steps starting with Pb and computes Pba , and Bob computes Pab 5. They use the coordinates of Pab to construct the desired key.

diophantus Lived from ?? to ?? Probably about 1800 years ago.

Diophantus passed one sixth of his life in childhood, one twelfth in youth, and one seventh as a bachelor. Five years after his marriage was born a son who died four years before his father, at half his father’s age. How many years did Diophantus live?

84 Diophantus passed one sixth of his life in childhood, one twelfth in youth, and one seventh as a bachelor. Five years after his marriage was born a son who died four years before his father, at half his father’s age. How many years did Diophantus live? 84

Problem 1 To divide a given number into two having given difference. Lesser number is x. Larger is x + 40. Therefore 2x+40 = 100 x = 30 The required numbers are 70, 30.

KYb DYgisMd 2x3 – 3x2 = 4 saisMb x = 2

ib fib Sxle iz a 17 1 35 12 512 x

DYie MlV en moriw DYDaMlV DYib (15 x2 – 36)/(x4 + 36 – 12 x2)

+, - 1489 = 1557 x 1620 . 1600 > 1600 a2, a3, a4, … 1634 aa, a3, a4, … 1637 (Descartes)

Diophantus’s goal: Given a solution of an equation, find another solution. Given a point on a curve, find another point.

Using P1 and P3, we get P4.

Problem: Find rational x and y such that x2 + y2 =1. We know the easy solution x=1, y=0. Draw the line through this point with slope, say, -2. The second point of intersection gives a new point, in this case x= 3/5, y=4/5.

What happens if we try higher degree curves? y2 = x5 – 7x3 + 6x +17

Faltings’s Theorem (1983): A higher degree curve (technically: genus > 1) has only a finite number of points with rational coordinates.

What about the donuts?

y2 = x (x + 1) (2x + 1)/6

y2 = x5 – 7x3 + 6x +17

THANK YOU