advanced information security 4 field arithmetic dr. turki f. al-somani 2015
TRANSCRIPT
![Page 1: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/1.jpg)
Advanced Information Security 4 FIELD ARITHMETIC
Dr. Turki F. Al-Somani2015
![Page 2: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/2.jpg)
2
Module Outlines
Finite Field Arithmetic GF(p) Arithmetic GF(2m) Arithmetic
Polynomial basis Normal basis
Addition/subtraction Squaring Multiplication Inversion
Summary
![Page 3: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/3.jpg)
3
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.
![Page 4: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/4.jpg)
4
Finite Field Arithmetic (contd.)
![Page 5: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/5.jpg)
5
Finite Field Arithmetic (contd.)
![Page 6: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/6.jpg)
6
Finite Field Arithmetic (contd.)
![Page 7: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/7.jpg)
7
Finite Field Arithmetic (contd.)
![Page 8: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/8.jpg)
8
Finite Field Arithmetic (contd.)
![Page 9: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/9.jpg)
9
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.
![Page 10: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/10.jpg)
10
Polynomial Basis
![Page 11: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/11.jpg)
11
Polynomial Basis
![Page 12: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/12.jpg)
12
Normal Basis
![Page 13: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/13.jpg)
13
Normal Basis (contd.)
![Page 14: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/14.jpg)
14
Normal Basis (contd.)
![Page 15: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/15.jpg)
15
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.
![Page 16: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/16.jpg)
16
Optimal Normal Basis (Contd.)
Note: Type 1 is circled.
![Page 17: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/17.jpg)
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].
![Page 18: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/18.jpg)
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.
![Page 19: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/19.jpg)
ONB Type I & II (n ≤ 230)
![Page 20: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/20.jpg)
20
Survey Paper (2006)
![Page 21: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/21.jpg)
21
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
![Page 22: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/22.jpg)
22
𝜆-matrix based multipliers
Massey and Omura Multiplier Hasan et. al. Multiplier Gao and Sobelman Multiplier Reyhani-Masoleh and Hasan Multiplier
![Page 23: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/23.jpg)
23
Example: Type I
![Page 24: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/24.jpg)
24
Example: Type II
![Page 25: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/25.jpg)
25
Massey and Omura Multiplier
![Page 26: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/26.jpg)
26
Hasan et. al. Multiplier
![Page 27: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/27.jpg)
27
Gao and Sobelman Multiplier
![Page 28: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/28.jpg)
28
Reyhani-Masoleh and Hasan Multiplier
![Page 29: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/29.jpg)
29
Comparisons
![Page 30: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/30.jpg)
30
Conversion based multipliers Sunar and Koc Multiplier Wu et. al. Multiplier
![Page 31: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/31.jpg)
31
Sunar and Koc Multiplier
![Page 32: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/32.jpg)
32
Wu et. al. Multiplier
![Page 33: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/33.jpg)
33
Comparisons
![Page 34: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/34.jpg)
34
Normal Basis Inversion
Inversion algorithms:
Standard algorithms
Exponent Decomposing algorithms
Exponent Grouping inversion algorithms
![Page 35: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/35.jpg)
35
Standard Algorithms
![Page 36: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/36.jpg)
36
Exponent Decomposing Algorithms
![Page 37: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/37.jpg)
37
Exponent Decomposing Algorithms (contd.)
![Page 38: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/38.jpg)
38
Exponent Decomposing Algorithms (contd.)
![Page 39: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/39.jpg)
39
Exponent Grouping inversion Algorithms
![Page 40: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/40.jpg)
40
Exponent Grouping inversion Algorithms (contd.)
![Page 41: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/41.jpg)
41
Exponent Grouping inversion Algorithms (contd.)
![Page 42: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/42.jpg)
42
Comparisons
![Page 43: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/43.jpg)
43
Pipelining Paper (2009)
![Page 44: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/44.jpg)
44
Pipelining Paper (2009)
![Page 45: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/45.jpg)
45
UQU Pipelining Paper (2010)
![Page 46: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/46.jpg)
46
Systolic Arrays Paper (2011)
![Page 47: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/47.jpg)
47
IEEE VLSI Systolic Arrays Paper (2014)
![Page 48: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/48.jpg)
48
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.
![Page 49: Advanced Information Security 4 FIELD ARITHMETIC Dr. Turki F. Al-Somani 2015](https://reader030.vdocuments.mx/reader030/viewer/2022032703/56649d1a5503460f949ef0cf/html5/thumbnails/49.jpg)
THANKS & GOOD LUCK NEXT IS: 5 ECC CRYPTOGRAPHY
Dr. Turki F. Al-Somani2015