Advanced Information Security 4 Field Arithmetic

Slides:

Advertisements

Similar presentations

Are standards compliant Elliptic Curve Cryptosystems feasible on RFID?

Advertisements

Finite Fields Rong-Jaye Chen. p2. Finite fields 1. Irreducible polynomial f(x)  K[x], f(x) has no proper divisors in K[x] Eg. f(x)=1+x+x 2 is irreducible.

BCH Codes Hsin-Lung Wu NTPU.

Mathematics of Cryptography Part II: Algebraic Structures

Cryptography and Network Security, Finite Fields From Third Edition by William Stallings Lecture slides by Mustafa Sakalli so much modified..

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.

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

Dr. Lo’ai Tawalbeh Summer 2007 Chapter 9 – Public Key Cryptography and RSA Dr. Lo’ai Tawalbeh New York Institute of Technology (NYIT) Jordan’s Campus INCS.

Cryptography and Network Security Chapter 4

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

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.

Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann.

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

Introduction to Modern Cryptography Lecture 3 (1) Finite Groups, Rings and Fields (2) AES - Advanced Encryption Standard.

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

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.

Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared by both sender and receiver if this key is disclosed communications.

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

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

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.

The RSA Algorithm Rocky K. C. Chang, March

From finite projective geometry to quantum phase enciphering (Discrete Math of MUBs) H. Rosu, M. Planat, M. Saniga (IPICyT-Mx, LPMO-Fr, Astronomical Inst.-Sk)

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

Number Theory and Advanced Cryptography 1. Finite Fields and AES

FINITE FIELDS 7/30 陳柏誠.

Cryptography and Network Security

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.

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

AES Background and Mathematics CSCI 5857: Encoding and Encryption.

Monoids, Groups, Rings, Fields

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

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

Cryptography and Network Security Chapter 10 Fifth Edition by William Stallings Lecture slides by Lawrie Brown.

Session 1 Stream ciphers 1.

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.

Chapter 3 – Public Key Cryptography and RSA (A). Private-Key Cryptography traditional private/secret/single-key cryptography uses one key shared by both.

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

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.

Chapter 9 Public Key Cryptography and RSA. Private-Key Cryptography traditional private/secret/single key cryptography uses one key shared by both sender.

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.

The Advanced Encryption Standard Part 2: Mathematical Background

15-499Page :Algorithms and Applications Cryptography II – Number theory (groups and fields)

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

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

Hardware Implementations of Finite Field Primitives

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.

Motivation Basis of modern cryptosystems

Page : 1 bfolieq.drw Technical University of Braunschweig IDA: Institute of Computer and Network Engineering  W. Adi 2011 Lecture-5 Mathematical Background:

CS480 Cryptography and Information Security

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

Advanced Information Security 6 Side Channel Attacks

CS480 Cryptography and Information Security

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

Mathematical Background: Extension Finite Fields

Presentation transcript:

Advanced Information Security 4 Field Arithmetic Dr. Turki F. Al-Somani 2015

Module Outlines Finite Field Arithmetic Summary GF(p) Arithmetic GF(2m) Arithmetic Polynomial basis Normal basis Addition/subtraction Squaring Multiplication Inversion Summary

Finite Field Arithmetic In abstract algebra, a finite field is a field that contains only finitely many elements. Finite fields are important in number theory, algebraic geometry, Galois theory, coding theory, and cryptography.

Finite Field Arithmetic (contd.)

Finite Field Arithmetic (contd.)

Finite Field Arithmetic (contd.)

Finite Field Arithmetic (contd.)

Finite Field Arithmetic (contd.)

GF(2m) Arithmetic The finite GF(2m) field has particular importance in cryptography since it leads to particularly efficient hardware implementations. Elements of the field are represented in terms of a basis. Most implementations use either a Polynomial Basis or a Normal Basis. Normal basis is more suitable for hardware implementations than polynomial basis since operations are mainly comprised of rotation, shifting and exclusive- OR operations which can be efficiently implemented in hardware.

Polynomial Basis

Polynomial Basis

Normal Basis

Normal Basis (contd.)

Normal Basis (contd.)

Optimal Normal Basis An optimal normal basis (ONB) is one with the minimum number of terms, or equivalently, the minimum possible number of nonzero λij This value is 2m-1, and since it allows multiplication with minimum complexity, such a basis would normally lead to more efficient hardware implementations.

Optimal Normal Basis (Contd.) Note: Type 1 is circled.

Optimal Normal Basis Types Now CN=2n-1 Type I: Rule 2 means: for every i in the range [0, n-1], (2k mod n+1) must result in a unique integer in the range [1, n].

Cont. Type II: Rule 2a means that every 2k mod 2n+1, in the range [1 to 2n]. Therefore 2 is called the generator for all the possible locations in the 2n+1 field Rule 2b means that even if 2k does not generate every element in the range [1, 2n], however, half of points in the field of form by rule 2a can be hit. It is because SQR(2k) can be taken. The points generated by rule 2b are in the form of perfect squares.

ONB Type I & II (n ≤ 230)

Survey Paper (2006)

NB Multiplication Multiplication is more complicated than addition and squaring operations in finite field arithmetic. An efficient multiplier is highly needed and is the key for efficient finite field computations. Finite filed multipliers using normal basis can be classified into two main categories: 𝜆-matrix based multipliers Conversion based multipliers

𝜆-matrix based multipliers Massey and Omura Multiplier Hasan et. al. Multiplier Gao and Sobelman Multiplier Reyhani-Masoleh and Hasan Multiplier

Example: Type I

Example: Type II

Massey and Omura Multiplier

Hasan et. al. Multiplier

Gao and Sobelman Multiplier

Reyhani-Masoleh and Hasan Multiplier

Comparisons

Conversion based multipliers Sunar and Koc Multiplier Wu et. al. Multiplier

Sunar and Koc Multiplier

Wu et. al. Multiplier

Comparisons

Normal Basis Inversion Inversion algorithms: Standard algorithms Exponent Decomposing algorithms Exponent Grouping inversion algorithms

Standard Algorithms

Exponent Decomposing Algorithms

Exponent Decomposing Algorithms (contd.)

Exponent Decomposing Algorithms (contd.)

Exponent Grouping inversion Algorithms

Exponent Grouping inversion Algorithms (contd.)

Exponent Grouping inversion Algorithms (contd.)

Comparisons

Pipelining Paper (2009)

Pipelining Paper (2009)

UQU Pipelining Paper (2010)

Systolic Arrays Paper (2011)

IEEE VLSI Systolic Arrays Paper (2014)

Summary Efficient computations in finite fields and their architectures are important in many applications, including coding theory, computer algebra systems, and public-key cryptosystems (e.g., elliptic curve cryptosystems (ECC). The most commonly used basis are polynomial basis and normal basis. Normal basis is more suitable for hardware implementations than polynomial basis since operations in normal basis representation are mainly comprised of rotation, shifting and exclusive-ORing which can be efficiently implemented in hardware.

Thanks & Good Luck Next is: 5 ECC Cryptography Dr. Turki F. Al-Somani 2015