Montgomery Modular Multiplication

Slides:

Advertisements

Similar presentations

Fundamental Elliptic Curve Cryptography Algorithms draft-mcgrew-fundamental-ecc-02

Advertisements

Polynomial Evaluation. Straightforward Evaluation P(x) = 3x 5 +2x 4 +7x 3 +8x 2 +2x+4P(x) = 3x 5 +2x 4 +7x 3 +8x 2 +2x+4 t1 = (3*x*x*x*x*x)t1 = (3*x*x*x*x*x)

Chapter 4 Finite Fields. Introduction of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key concern operations on “numbers”

Cryptography and Network Security Chapter 4 Fourth Edition by William Stallings.

Chapter 4 – Finite Fields. Introduction will now introduce finite fields of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key.

Fast Modular Reduction

OEO: O PTIMIZATION OF E XPONENTIATION O PERATION ~ A B RIEF D ISCUSSION ~ Kirti Chawla

Introduction to Modern Cryptography, Lecture 11 1) More about efficient computation: Montgomery arithmetic, efficient exponentiation 2)Secret Sharing schemes.

COM 5336 Cryptography Lecture 7a Primality Testing

Number Theory and Cryptography

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

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

Elliptic Curve Cryptography Shane Almeida Saqib Awan Dan Palacio.

6/20/2015 5:05 AMNumerical Algorithms1 x x1x

An Expandable Montgomery Modular Multiplication Processor Adnan Abdul-Aziz GutubAlaaeldin A. M. Amin Computer Engineering Department King Fahd University.

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

CHES20021 Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2 n ) A. Gutub, A. Tenca, E. Savas, and C. Koc Information Security.

CSE 246: Computer Arithmetic Algorithms and Hardware Design Numbers: RNS, DBNS, Montgomory Prof Chung-Kuan Cheng Lecture 3.

1 Montgomery Multiplication David Harris and Kyle Kelley Harvey Mudd College Claremont, CA {David_Harris,

Montgomery multiplication Algorithm Mohammad Farmani Under supervision of : Dr. S. Bayat-sarmadi 2 nd. Semister, Sharif University of Technology.

Peter Lam Discrete Math CS.  Sometimes Referred to Clock Arithmetic  Remainder is Used as Part of Value ◦ i.e Clocks  24 Hours in a Day However, Time.

Brian Padalino Sammy Lin Arnold Perez Helen Chen

CPSC 3730 Cryptography and Network Security

1 Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown Chapter 4 – Finite Fields.

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

School of Electrical Engineering & Computer Science National University of Sciences & Technology (NUST), Pakistan Research Profile Dr. Nazar Abbas Saqib.

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

Fall 2004/Lecture 201 Cryptography CS 555 Lecture 20-b Zero-Knowledge Proof.

Gaj1P230/MAPLD 2004 Elliptic Curve Cryptography over GF(2 m ) on a Reconfigurable Computer: Polynomial Basis vs. Optimal Normal Basis Representation Comparative.

Implementation of the RSA Algorithm on a Dataflow Architecture

Research on the Discrete Logarithm Problem Wang Ping Meng Xuemei

1 Simple and Unbreakable: The Mathematics of Internet Security Dr. Monica Nevins Department of Mathematics and Statistics University of Ottawa University.

Paper Reading - A New Approach to Pipeline FFT Processor Presenter:Chia-Hsin Chen, Yen-Chi Lee Mentor:Chenjo Instructor:Andy Wu.

PARALLELIZATION OF MULTIPLE BACKSOLVES James Stanley April 25, 2002 Project #2.

Elliptic Curve Cryptography

Lecture 6.1: Misc. Topics: Number Theory CS 250, Discrete Structures, Fall 2011 Nitesh Saxena.

Faster Implementation of Modular Exponentiation in JavaScript

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

EPFL-IC-IIF-LACAL Marcelo E. Kaihara April 27 th, 2007 Algorithms for public-key cryptology Montgomery Arithmetic.

Ref: Pfleeger96, Ch.31 Properties of Arithmetic Reference: Pfleeger, Charles P., Security in Computing, 2nd Edition, Prentice Hall, 1996.

Introduction to Number Theory

Introduction to Elliptic Curves CSCI 5857: Encoding and Encryption.

An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm Miaoqing Huang 1, Kris Gaj 2, Soonhak Kwon 3, Tarek El-Ghazawi 1 1 The George.

Introduction to Elliptic Curve Cryptography CSCI 5857: Encoding and Encryption.

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

Motivation Basis of modern cryptosystems

Key Exchange in Systems VPN usually has two phases –Handshake protocol: key exchange between parties sets symmetric keys –Traffic protocol: communication.

An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm Miaoqing Huang Nov. 5, 2010.

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.

Timing Attacks on Elliptic Curve Cryptosystems (ECC)

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

Public Key Cryptosystems - RSA

IMPLEMENTATION OF MULTIPLE-PRECISION MODULAR MULTIPLICATION ON GPU

Elliptic Curve Cryptography over GF(2m) on a Reconfigurable Computer:

Survey of Crypto CoProcessor Design

Lecture 5 Multiplication and Division

Lecture 20 Guest lecturer: Neal Gupta

CPU Design & Computer Arithmetic

QR Code Authentication with Embedded Message Authentication Code

Divisibility Rules.

Modular Arithmetic ICS 6D Sandy Irani.

Divisibility Rules.

Modular Arithmetic and Elliptic Curves

Assignment #1 Solutions

Introduction to Elliptic Curve Cryptography

Going round in circles… Going round in circles…

Clements MAΘ October 30th, 2014

RSA Cryptosystem 電機四 B 游志強 2019/8/25.

Presentation transcript:

Montgomery Modular Multiplication By K. C. Cinnati Loi For EE 800: Circuit Elements in Digital Computations Project Proposal

Long Division Algorithm 11111101111110 (mod) 100011011 ^100011011 1110000011110 110110101110 10101110110 0100011010 ^000000000 100011010 00000001 Reference: http://en.wikipedia.org/wiki/Finite_field_arithmetic

Montgomery Algorithm TR-1 mod N Function REDC(T) m ← (T mod R)N’ mod R t ← (T + mN) / R if t ≥ N then return t – N else return t R: R = 2b, R > N and gcd(R, N) = 1 0 < R-1 < N, 0 < N’ < R and RR-1 – NN’ = 1

Montgomery Algorithm (cont.) xy mod N REDC(x) = xR-1 mod N REDC(y) = yR-1 mod N Let z = REDC(xy) = (xy)R-1 mod N REDC(x) * REDC(y) = (xy)R-1R-1 mod N = zR-1 mod N REDC(x) * REDC(y) = REDC(z)

Project Proposal FPGA Implementation of the processor proposed in: J. Huang, H. Li, P. Sweany, “An FPGA Implementation of Elliptic Curve Cryptography for Future Secure Web Transaction”, International Conference on Parallel and Distributed Computing Systems (PDCS 2007), pp. 296 – 301, Sept. 2007. Explore performance improvements Explore other coordinate systems