Advanced Information Security 2 SCALAR MULTIPLICATION Dr. Turki F. Al-Somani 2015.

Slides:

Advertisements

Similar presentations

Key Management Nick Feamster CS 6262 Spring 2009.

Advertisements

1 Computational Complexity Size Matters!. 2 Suppose there are several algorithms which can all be used to perform the same task. We need some way to judge.

1 A New Multiplication Technique for GF(2 m ) with Cryptographic Significance Athar Mahboob and Nassar Ikram National University of Sciences & Technology,

Randomized Signed-Scalar Multiplication of ECC to Resist Power Attacks JaeCheol Ha * and SangJae Moon ** * Korea Nazarene University **

Are standards compliant Elliptic Curve Cryptosystems feasible on RFID?

Analysis of Algorithms

Fast Multi-Scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy using Montgomery Trick Hitachi Ltd. Katsuyuki Okeya Kouichi Sakurai.

Lecture Implementations. The efficiency of a particular cryptographic scheme based on any one of the algebraic structures will depend on a number.

Aritmética Computacional Francisco Rodríguez Henríquez Modular Exponentiation.

CENG536 Computer Engineering Department Çankaya University.

Elliptic curve arithmetic and applications to cryptography By Uros Abaz Supervised by Dr. Shaun Cooper and Dr. Andre Barczak.

Advanced Information Security 4 Field Arithmetic

Efficient generation of cryptographically strong elliptic curves Shahar Papini Michael Krel Instructor : Barukh Ziv 1.

Advanced in Cryptology – CRYPT 2004, Santa Barbara, August 16, 2004 Signed Binary Representations Revisited Katsuyuki Okeya, Hitachi Katja Schmidt-Samoa,

1 Efficient Algorithms for Elliptic Curve Cryptosystems Original article by Jorge Guajardo and Christof Paar Of WPI ECE Department Presentation by Curtis.

Dr. Turki F. Al-Somani VHDL synthesis and simulation – Part 2 Microcomputer Systems Design (Embedded Systems)

Dr. Lo’ai Tawalbeh Fall 2005 Chapter 10 – Key Management; Other Public Key Cryptosystems Dr. Lo’ai Tawalbeh Computer Engineering Department Jordan University.

IHP Im Technologiepark Frankfurt (Oder) Germany IHP Im Technologiepark Frankfurt (Oder) Germany ©

Radu Muresan CODES+ISSS'04, September 8-10, 2004, Stockholm, Sweden1 Current Flattening in Software and Hardware for Security Applications Authors: R.

Dr. Turki F. Al-Somani VHDL synthesis and simulation – Part 1 Microcomputer Systems Design (Embedded Systems)

Bob can sign a message using a digital signature generation algorithm

By Abhijith Chandrashekar and Dushyant Maheshwary.

Lecture 10: Elliptic Curve Cryptography Wayne Patterson SYCS 653 Fall 2009.

Multiplication CPSC 252 Computer Organization Ellen Walker, Hiram College.

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

Complement Numbers. Outline  Negative Numbers Representation  Sign-and-magnitude  1s Complement  2s Complement  Comparison of Sign-and-Magnitude.

ECE 545 – Introduction to VHDL ECE 645—Project 2 Project Options.

Advanced Information Security 1 INTRODUCTION TO ECC Dr. Turki F. Al-Somani

Advanced Information Security 6 SIDE CHANNEL ATTACKS Dr. Turki F. Al-Somani 2015.

Data Security and Encryption (CSE348) 1. Lecture # 12 2.

Research on the Discrete Logarithm Problem Wang Ping Meng Xuemei

Complexity 20-1 Complexity Andrei Bulatov Parallel Arithmetic.

Exploiting the Order of Multiplier Operands: A Low-Cost Approach for HCCA Resistance Poulami Das and Debapriya Basu Roy under the supervision of Dr. Debdeep.

Understanding Cryptography by Christof Paar and Jan Pelzl These slides were prepared by Tim Güneysu, Christof Paar and Jan Pelzl.

Cryptography and Network Security

Optimizing Robustness while Generating Shared Secret Safe Primes Emil Ong and John Kubiatowicz University of California, Berkeley.

Cryptography and Network Security Chapter 4. Introduction  will now introduce finite fields  of increasing importance in cryptography AES, Elliptic.

Cryptographic coprocessor

CS/EE 3700 : Fundamentals of Digital System Design Chris J. Myers Lecture 5: Arithmetic Circuits Chapter 5 (minus 5.3.4)

Lecture 9 Elliptic Curves. In 1984, Hendrik Lenstra described an ingenious algorithm for factoring integers that relies on properties of elliptic curves.

1 Analysis of Fractional Window Recoding Methods and Their Application to Elliptic Curve Cryptosystems 片斷視窗編碼法的分析及應用到 ECC IEEE Transactions on Computers,

11 RSA Variants.  Scheme ◦ Select s.t. p and q = 3 mod 4 ◦ n=pq, public key =n, private key =p,q ◦ y= e k (x)=x (x+b) mod n ◦ x=d k (y)=  y mod n.

Security of Using Special Integers in Elliptic Scalar Multiplication Mun-Kyu Lee o Jin Wook Kim Kunsoo Park School of CSE, Seoul National University.

Lecture 11: Elliptic Curve Cryptography Wayne Patterson SYCS 653 Fall 2008.

Recursive Architectures for 2DLNS Multiplication RESEARCH CENTRE FOR INTEGRATED MICROSYSTEMS - UNIVERSITY OF WINDSOR 11 Recursive Architectures for 2DLNS.

1 Network Security Dr. Syed Ismail Shah

In The Name of Allah Fault attacks on ECC

1 Cryptanalysis Lab Elliptic Curves. Cryptanalysis Lab Elliptic Curves 2 Outline [1] Elliptic Curves over R [2] Elliptic Curves over GF(p) [3] Properties.

Advanced Information Security 3 PROJECTIVE COORDINATES Dr. Turki F. Al-Somani 2015.

1 Message Authentication using Message Digests and the MD5 Algorithm Message authentication is important where undetected manipulation of messages can.

Efficient Montgomery Modular Multiplication Algorithm Using Complement and Partition Techniques Speaker: Te-Jen Chang.

Motivation Basis of modern cryptosystems

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.

Chapter 9 – Elliptic Curve Cryptography ver. November 3rd, 2009

Timing Attacks on Elliptic Curve Cryptosystems (ECC)

Network Security Design Fundamentals Lecture-13

Advanced Information Security 5 ECC Cryptography

D. Cheung – IQC/UWaterloo, Canada D. K. Pradhan – UBristol, UK

Advanced Information Security 6 Side Channel Attacks

CSE 102 Introduction to Computer Engineering

Chapter 2 – Computer hardware

MIRACL & PBC Yung-Hsiang Liu.

Number Systems Lecture 2.

Transform and Conquer Transform and Conquer Transform and Conquer.

4-9问题的形式化描述.

Transform and Conquer Transform and Conquer Transform and Conquer.

Chapter 4 計算機算數.

x/÷ Numbers Year 3-4 – Multiply and divide a multiple of 10

Cryptology Design Fundamentals

Network Security Design Fundamentals Lecture-13

Presentation transcript:

Advanced Information Security 2 SCALAR MULTIPLICATION Dr. Turki F. Al-Somani 2015

Module Outlines 2  Scalar Multiplications (SM) in ECC  Generic-Point SM Algorithms double-and-add (or binary), w-ary, addition-subtraction, signed w-ary, and width-w addition-subtraction.  Fixed Point SM Algorithms Fixed-Point Windowing Fixed-Point Comb  New Generic Point Parallel SM Algorithms Postcomputations Precomputations

Module Outlines 3  Complexities Comparisons  Time  Area  Summary

Scalar Multiplication 4  Scalar multiplication is the basic operation for ECCs.  Scalar multiplication in the group of points of an elliptic curve is the analogous of exponentiation in the multiplicative group of integers modulo a fixed integer m.  The scalar multiplication operation, denoted as kP, where k is an integer and P is a point on the elliptic curve, represents the addition of k copies of point P.

Scalar Multiplication (contd.) 5  Scalar multiplication is computed by a series of point doubling and point addition operations of the point P depending upon the bit sequence representing the scalar multiplier k.

6 Scalar Multiplication (contd.)  K can be expanded to binary representation. INPUTK, P OUTPUT KP 1.Initialize Q[0] = , Q[1] = P 2for i = 0 to m-1 3 if k[i] = 1 then 4 Q[0] = ADD(Q[0],Q[1]) 5 end if 6 Q[1] = DBL(Q[1]) 7end for 8return Q[0]

7 Scalar Multiplication (contd.)  most-to-least (left-to-right) version INPUTK, P OUTPUT KP 1.Initialize Q[0] = P 2for i = m-2 downto 0 3 Q[0] = DBL(Q[0]) 4 if k[i] = 1 then 5 Q[0] = ADD(Q[0],P) 6 end if 7end for 8return Q[0]

Scalar Multiplication Algorithms 8  Generic Scalar Multiplication Algorithms:  can be used to compute an arbitrary point multiplication  fixed-point multiplication is a common operation in elliptic curve cryptographic algorithms.  Fixed-point Scalar Multiplication Algorithms:  can be used to compute point multiplications involving known points.  point multiplication with a known point can be computed much more efficiently than for arbitrary points.

Generic-Point SM Algorithms 9  Algorithms:  double-and-add (or binary),  w-ary,  addition-subtraction,  signed w-ary,  and width-w addition-subtraction.

double-and-add (or binary) 10

w-ary 11

addition-subtraction 12

signed w-ary 13

width-w addition-subtraction 14

Fixed-Point SM Algorithms 15  Algorithms:  Fixed-Point Windowing  Fixed-Point Comb

Fixed-Point Windowing 16

Fixed-Point Comb 17  Arrangement of k:

Fixed-Point Comb (contd.) 18  The precomputation table:

Fixed-Point Comb (contd.) 19

Time & Area Complexities 20

New Generic Point Parallel SM Algorithms 21

Postcompuations Methods (2009) 22

Postcompuations Methods 23

Postcompuations Methods 24

Postcompuations Methods (2014) 25

Postcompuations Methods 26

Precomputations Methods (2015) 27

Precomputations Methods (2015) 28

Summary 29  Scalar Multiplication is the sole of ECC.  The selection the scalar multiplication algorithm depends on your design objectives:  Time  Area  Power  Security !!

THANKS & GOOD LUCK NEXT IS: 3 PROJECTIVE COORDINATES Dr. Turki F. Al-Somani 2015