Pairing Friendly Elliptic Curves of Prime Order with Embedding degree 12 Paulo Barreto and Michael Naehrig Presented by Mike Scott.

Slides:

Advertisements

Similar presentations

CLASSICAL ENCRYPTION TECHNIQUES

Advertisements

Warm-up Make a T-Table and graph the equation y = 2x + 2 x y

Step 1 : Loop one end of the pipe cleaner to form a U-shape as shown in the diagram about 4 cm.

There is a pattern for factoring trinomials of this form, when c

Factors, Primes & Composite Numbers

Attacking Cryptographic Schemes Based on Perturbation Polynomials Martin Albrecht (Royal Holloway), Craig Gentry (IBM), Shai Halevi (IBM), Jonathan Katz.

Customary System: Used mainly in the United States Metric System: Used in the rest of the world and in most scientific research and development.

Prime and Composite Numbers. These are numbers that have only two factors – themselves and one. These are numbers that have only two factors – themselves.

Area and Perimeter.

Multiples and Factors Lesson 4.1.

Public Key Cryptosystem

Factors What are factors??. Factors What are the factors of 10? Can you find a pair of numbers that multiply together to give 10? 5 x 2 = 10 So 5 and.

Area and Perimeter.

Use the measurements provided to find out the surface area of these nets. They are not drawn to scale, so don’t try to measure them! 8cm 12cm 8cm 7cm 9cm.

C1 Sequences and series. Write down the first 4 terms of the sequence u n+1 =u n +6, u 1 =6 6, 12, 18, 24.

Factorise the following 10x a – 20 36m a + 27b + 9c 9y² - 12y 30ab³ + 35a²b 24x4y³ - 40x²y.

PUBLIC KEY CRYPTOSYSTEMS Symmetric Cryptosystems 6/05/2014 | pag. 2.

Binary Relations Binary Relations on Real Numbers.

Area in the amount of space inside an enclosed region. Area of Rectangle = base x height Base =10 Height = 6 Area = (10)(6) = 60 square units.

Least Common Multiple LCM 2 Methods

EXAMPLE 1 Find the number of solutions or zeros

Vector-Valued Functions 12 Copyright © Cengage Learning. All rights reserved.

Squares and Square Root WALK. Solve each problem REVIEW:

10-6 Solving Quadratic Equations by Factoring

CRT RSA Algorithm Protected Against Fault Attacks WISTP - 5/10/07 Arnaud BOSCHER Spansion EMEA Robert NACIRI Oberthur Card Systems Emmanuel PROUFF Oberthur.

Higher Outcome 1 Higher Unit 2 What is a polynomials Evaluating / Nested / Synthetic Method Factor Theorem Factorising higher Orders.

Graph Linear Systems Written in Standard Form

Practice Skip Counting

6.7 Areas of Triangles and Quadrilaterals

An Introduction to Pairing Based Cryptography Dustin Moody October 31, 2008.

Russell Martin August 9th, Contents Introduction to CPABE Bilinear Pairings Group Selection Key Management Key Insulated CPABE Conclusion & Future.

Efficient Implementation of Cryptographic pairings Mike Scott Dublin City University.

Graduate School of Natural Science and Technology Okayama University Yumi Sakemi, Hidehiro Kato, Shoichi Takeuchi, Yasuyuki Nogami and Yoshitaka Morikawa.

Implementing Cryptographic Pairings on Smartcards Mike Scott.

YSLInformation Security -- Public-Key Cryptography1 Elliptic Curve Cryptography (ECC) For the same length of keys, faster than RSA For the same degree.

Secure Hashing and DSS Sultan Almuhammadi ICS 454 Principles of Cryptography.

Hidden pairings and trapdoor DDH groups Alexander W. Dent Joint work with Steven D. Galbraith.

Paulo S. L. M. Barreto (SFI Walton Fellow) Pairings in “Real Life”

Cryptography1 CPSC 3730 Cryptography Chapter 13 Digital Signature Standard (DSS)

Bob can sign a message using a digital signature generation algorithm

Implementing Cryptographic Pairings Mike Scott TexPoint fonts used in EMF: AAAA A A AAAA A AA A A A.

Elliptic Curve Cryptography

Presented by Mike Scott

September 20 th, 2006 U-Prove crypto overview Copyright © 2006, Quebec Inc. Proprietary and Confidential.

CS 627 Elliptic Curves and Cryptography Paper by: Aleksandar Jurisic, Alfred J. Menezes Published: January 1998 Presented by: Sagar Chivate.

Selecting Class Polynomials for the Generation of Elliptic Curves Elisavet Konstantinou joint work with Aristides Kontogeorgis Department of Information.

Scott CH Huang COM 5336 Cryptography Lecture 6 Public Key Cryptography & RSA Scott CH Huang COM 5336 Cryptography Lecture 6.

Pairing Based Cryptography Standards Terence Spies VP Engineering Voltage Security

Elliptic Curve Cryptography

A Survey on Factoring Large Numbers ～巨大数の因数分解に関する調査～ Kanada Lab. M Yoshida Hitoshi.

Digital Signature Standard (DSS) US Govt approved signature scheme designed by NIST & NSA in early 90's published as FIPS-186 in 1991 revised in 1993,

PSEC-KEM NTT Tetsutaro Kobayashi. 2001/10/10CRYPTREC Policy Elliptic curve cryptsystem IND-CCA2.

Cryptography services Lecturer: Dr. Peter Soreanu Students: Raed Awad Ahmad Abdalhalim

Elliptic Curve Public Key Cryptography Why ? ● ECC offers greater security for a given key size. ● The smaller key size also makes possible much more compact.

Public Key Encryption Major topics The RSA scheme was devised in 1978

Elliptic Curve Public Key Cryptography

An Introduction to Pairing Based Cryptography

Asymmetric-Key Cryptography

An Introduction to Pairing Based Cryptography

Elliptic Curve Cryptography (ECC)

MIRACL & PBC Yung-Hsiang Liu.

Elliptic Curve Cryptography (ECC)

The Application of Elliptic Curves Cryptography in Embedded Systems

CHAPTER 4 COUNTER.

SIGNCRYPTION Dr. Attila A. Yavuz.

Searchable Encryption

Pu Duan, Shi Cui and Choong Wah Chan

A note on efficient computation of cube roots in characteristic 3

Presentation transcript:

Pairing Friendly Elliptic Curves of Prime Order with Embedding degree 12 Paulo Barreto and Michael Naehrig Presented by Mike Scott

BN Curves An elliptic curve E: y 2 =x 3 +B mod p, where #E=p+1-t, and defined by p(x) = 36x 4 +36x 3 +24x 2 +6x+1 #E(x)=36x 4 +36x 3 +18x 2 +6x+1 t(x)= 6x 2 +1

BN Curves … has an embedding degree of 12 … has a CM discriminant of 3 … facilitates pairings at the 128-bit level of security … is good for all pairing applications (including short signature) … supports a sextic twist, so the P and Q parameters of the pairing can be over F p 2 and F p respectively

BN Curves … supports pairing compression … is efficient for both the Tate and Ate pairings (half length loop) … curves are plentiful and are easily found. … I could go on… … The End