Our Poster Paper

This is our poster paper to be appeared on

Pameran Hasil Penelitian

Program Riset ITB dan Program Hibah DIKTI DIPA ITB 2011

Galeri Utama Campus Centre Timur ITB

29 – 30 November 2011

Note: We do not follow the template because the posters have been printed before we found out that there is a template! 🙂

So let us present our research in contemporary design 😀

• CG 3:15 pm on April 6, 2011 Permalink | Reply Tags: composite field

http://www.math.kau.se/igorgach/Statji/statja(2010)1.pdf

Testing non-composite & composite operation with Python

for 299 bit.

Thx for Fajar Yuliawan for the code. I’m going to use this for testing the multiplier design.

2. Phyton tutorial is here.

the only thing that I understand from this post –> Fajar Yuliawan…

🙂

How secure is ECC with composite field binary?

An interesting discussion about ECC with composite field security with Dr. Michael Rosing here.

• CG 11:01 am on August 20, 2010 Permalink | Reply Tags: composite field, finite fields ( 9 ), massey omura

1. Efficient Normal Basis Multipliers in Composite Fields – Sangho Oh, Chang Han Kim, Jongin Lim, and Dong Hyeon Cheon
2. Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields $GF(2^n)$ – M. A. Hasan, M. Z. Wang and V. K. Bhargava
3. A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields – M. A. Hasan, M. Z. Wang and V. K. Bhargava

Choosing n and m for composite field

Referring to “Efficient Normal Basis Multipliers in Composite Fields” – Sangho Oh, Chang Han Kim, Jongin Lim, and Dong Hyeon Cheon, there is classification of hardware-applicable composite fields:

1. Type I composite field where a subfield $GF(2^n)$ in ONB2 and an extension field $GF(2^{nm})$ in ONB1
2. Type II composite field where a subfield $GF(2^n)$ in ONB1 and an extension field $GF(2^{nm})$ in ONB2
3. Type III composite field where a subfield $GF(2^n)$ in ONB2 and an extension field $GF(2^{nm})$ in ONB2

This is different with composite fields presented in “Efficient Methods for Composite Field Arithmetic” – E. Sava ̧s and C ̧. K. Koc, where the selection of $n$ and $m$  does not put their normal basis types (ONB1 or ONB2) into consideration.

Now the questions are:

1. Would it be better if we choose $n$, $m$ and $nm$ in ONB1/ONB2?
2. Which polynomial irreducible to be used? With degree = $n$, or degree = $m$ or degree = $nm$?

[pounding headache, and without answering these questions i wouldnt be able to start the hw design.]

Desperate Log

The existing algorithm for $GF((2^n)^m)$ is only for $n = 2^i$ and $m = 2^j$.
And GF with those restrictions don’t have ONB2 representation.

Oh well.

Selecting composite field that have ONBII representation

…is not that easy.

• CG 6:18 pm on June 1, 2010 Permalink | Reply Tags: composite field, galois fields, Mastrovito ( 2 ), multiplier ( 11 )

Mastrovito Edoardo, “VLSI Architectures for Computations in Galois Fields”, PhD Thesis, 1991.

Conclusion:

is there anything-has-never-been-done-as-phd-thesis left so i can finish mine? aarrrgghhhh

c
Compose new post
j
Next post/Next comment
k
Previous post/Previous comment
r