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

Slides:

Advertisements

Similar presentations

BCH Codes Hsin-Lung Wu NTPU.

Advertisements

Mathematics of Cryptography Part II: Algebraic Structures

Cryptography and Network Security

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.

CSE331: Introduction to Networks and Security Lecture 19 Fall 2002.

C. Walter, Data Integrity for Modular Arithmetic, CHES 2000 CHES 2000 Data Integrity in Hardware for Modular Arithmetic Colin Walter Computation Department,

Advanced Information Security 4 Field Arithmetic

1 Chapter 7– Introduction to Number Theory Instructor: 孫宏民 Room: EECS 6402, Tel: , Fax :

Cryptography and Network Security Chapter 4

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

COMP 170 L2 Page 1 Part 2 of Course Chapter 2 of Textbook.

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

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

Number Theory 04/26/07. Tasks Announcement of Final Example lecture Course evaluation Dispatch computer project reports.

Cryptography & Number Theory

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.

Lecture 3.2: Public Key Cryptography II CS 436/636/736 Spring 2012 Nitesh Saxena.

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,

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.

M. Khalily Dermany Islamic Azad University.  finite number of element  important in number theory, algebraic geometry, Galois theory, cryptography,

Mathematics of Cryptography Part I: Modular Arithmetic

MATH 224 – Discrete Mathematics

Mathematics of Cryptography Modular Arithmetic, Congruence,

FINITE FIELDS 7/30 陳柏誠.

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.

Information Security and Management 4. Finite Fields 8

Cryptography and Network Security Introduction to Finite Fields.

AES Background and Mathematics CSCI 5857: Encoding and Encryption.

Follow-up Courses. ECE Department MS in Electrical Engineering MS EE MS in Computer Engineering MS CpE COMMUNICATIONS & NETWORKING SIGNAL PROCESSING CONTROL.

Chapter 4 – Finite Fields

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

Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.

Understanding Cryptography by Christof Paar and Jan Pelzl These slides were prepared by Christof Paar and Jan Pelzl Chapter 8 –

Information Security Lab. Dept. of Computer Engineering 87/121 PART I Symmetric Ciphers CHAPTER 4 Finite Fields 4.1 Groups, Rings, and Fields 4.2 Modular.

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

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

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

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.

Implementation of Public Key Encryption Algorithms

Lecture 2-3 Basic Number Theory and Algebra. In modern cryptographic systems, the messages are represented by numerical values prior to being encrypted.

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.

CS480 Cryptography and Information Security

Cryptography and Network Security Third Edition by William Stallings Lecture slides by Lawrie Brown.

CS480 Cryptography and Information Security Huiping Guo Department of Computer Science California State University, Los Angeles 3. Mathematics of Cryptography.

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

Number-Theoretic Algorithms

Mathematical Background for Cryptography: Modular arithmetic and gcd

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

Cryptography and Information Security

Cryptology Design Fundamentals

Cryptology Design Fundamentals

Computer Security Modular Arithmetic November 12, 2018

Mathematical Background: Prime Numbers

ICS 353: Design and Analysis of Algorithms

Discrete Math for CS CMPSC 360 LECTURE 12 Last time: Stable matching

Introduction to Cryptography

Introduction to Elliptic Curve Cryptography

Mathematical Background for Cryptography

Lecture 2-3 Basic Number Theory and Algebra

Mathematical Background: Extension Finite Fields

Presentation transcript:

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

2 Main Topic  Montgomery modular multiplication algorithm Main Article: “Montgomery Multiplication in GF(2 k )” Written by: Cetin K. KOC and Tolga Acar,1998 Copyright © 2014 Hardware Security and Trust

Outline Introduction Montgomery modular multiplication of integers Montgomery modular multiplication in GF(2 k ) Conclusion Montgomery multiplication algorithm Sharif University of Technology 3 Copyright © 2014 Hardware Security and Trust

The importance and applications of the arithmetic operations in the Galois field GF(2 k ) in : Coding theory Computer algebra Cryptography …. Importance of the exponentiation Using a series of multiplication for The exponentiation Montgomery multiplication algorithm Sharif University of Technology 4 Copyright © 2014 Hardware Security and Trust

Cryptographic applications require fast arithmetic operations Proposed an effective modular multiplication of integers by P.L. Montgomery 1985 Conversion to the Montgomery domain : a : an intger M : modulus r : Radix Montgomery multiplication algorithm Sharif University of Technology 5 Copyright © 2014 Hardware Security and Trust

Example: M = 11, r = 2 4 = 16 There is a one-to-one correspondence between integers and Montgomery residues for 0 < a < M-1 Montgomery multiplication algorithm Sharif University of Technology 6 Copyright © 2014 Hardware Security and Trust

Outline Introduction Montgomery modular multiplication of integers Montgomery modular multiplication in GF(2 k ) Conclusion Montgomery multiplication algorithm Sharif University of Technology 7 Copyright © 2014 Hardware Security and Trust

Define: r -1 is the inverse of r mod M: r -1 r = 1 (mod M) Montgomery multiplication algorithm Sharif University of Technology 8 Copyright © 2014 Hardware Security and Trust

Example : Montgomery multiplication algorithm Sharif University of Technology 9 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 10 Copyright © 2014 Hardware Security and Trust

Example : Z initially 0 Z = ( ) / 2 = 8 Z = ( ) / 2 = 12 Z = ( ) / 2 = 14 Z = (14 + 0) / 2 = 7 (final result) Montgomery multiplication algorithm Sharif University of Technology 11 Copyright © 2014 Hardware Security and Trust X = 7 = 0111 Y = 5 = 0101 M = 11 = 1011 Z = 0 for i = 0 to n-1 Z = Z + xiY if Z is odd then Z = Z + M Z = Z/2 if Z ≥ M then Z = Z – M

Conversion using MM Conversion of integers to/from Montgomery residues with one MM operation Montgomery multiplication algorithm Sharif University of Technology 12 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 13 Copyright © 2014 Hardware Security and Trust MM x r2r2 X’X’ X’ 1 X

Outline Introduction Montgomery modular multiplication of integers Montgomery modular multiplication in GF(2 k ) Conclusion Montgomery multiplication algorithm Sharif University of Technology 14 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 15 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 16 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 17 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 18 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 19 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 20 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 21 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 22 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 23 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 24 Copyright © 2014 Hardware Security and Trust

Outline Introduction Montgomery modular multiplication of integers Montgomery modular multiplication in GF(2 k ) Conclusion Montgomery multiplication algorithm Sharif University of Technology 25 Copyright © 2014 Hardware Security and Trust

Montgomery multiplication algorithm Sharif University of Technology 26 Copyright © 2014 Hardware Security and Trust

End of presentation, Any question?