Low Complexity Cubing and Cube Root Computation over $\F_ {3^ m} $ in Polynomial Basis

O Ahmadi, FR Henriquez - IEEE Transactions on Computers, 2010 - ieeexplore.ieee.org
We present low complexity formulae for the computation of cubing and cube root over IF 3 m
constructed using special classes of irreducible trinomials, tetranomials and pentanomials …

Low Complexity Cubing and Cube Root Computation over 3^m in Polynomial Basis

O Ahmadi, F Rodriguez-Henriquez - IEEE Transactions on Computers, 2010 - dl.acm.org
We present low complexity formulae for the computation of cubing and cube root over 3^m
constructed using special classes of irreducible trinomials, tetranomials and pentanomials …

[PDF][PDF] Low Complexity Cubing and Cube Root Computation over F3m in Polynomial Basis

O Ahmadi, F Rodrıguez-Henrıquez - academia.edu
We present low complexity formulae for the computation of cubing and cube root over F3m
constructed using special classes of irreducible trinomials, tetranomials and pentanomials …

Low Complexity Cubing and Cube Root Computation over $\F_ {3^ m} $ in Polynomial Basis

O Ahmadi, FR Henríquez - IEEE Transactions on Computers, 2010 - infona.pl
We present low complexity formulae for the computation of cubing and cube root over IF 3 m
constructed using special classes of irreducible trinomials, tetranomials and pentanomials …

Low Complexity Cubing and Cube Root Computation over $\F_ {3^ m} $ in Polynomial Basis

O Ahmadi, FR Henríquez - IEEE Transactions on Computers, 2011 - computer.org
We present low complexity formulae for the computation of cubing and cube root over $\F_
{3^ m} $ constructed using special classes of irreducible trinomials, tetranomials and …

[PDF][PDF] Low Complexity Cubing and Cube Root Computation over IF3m in Polynomial Basis

O Ahmadi, F Rodrıguez-Henrıquez - IEEE TRANSACTIONS ON …, 2010 - ece.uvic.ca
We present low complexity formulas for the computation of cubing and cube root over IF3m
constructed using special classes of irreducible trinomials, tetranomials, and pentanomials …

Low Complexity Cubing and Cube Root Computation over F3m in Polynomial Basis

O Ahmadi, F Rodrıguez-Henrıquez - ieeexplore.ieee.org
We present low complexity formulae for the computation of cubing and cube root over F3m
constructed using special classes of irreducible trinomials, tetranomials and pentanomials …

Low Complexity Cubing and Cube Root Computation over $\F_ {3^ m} $ in Polynomial Basis

O Ahmadi, F Rodríguez-Henriquez - Cryptology ePrint Archive, 2009 - eprint.iacr.org
We present low complexity formulae for the computation of cubing and cube root over $\F_
{3^ m} $ constructed using special classes of irreducible trinomials, tetranomials and …

[PDF][PDF] Low Complexity Cubing and Cube Root Computation over F3m in Polynomial Basis

O Ahmadi, F Rodrıguez-Henrıquez - Citeseer
We present low complexity formulae for the computation of cubing and cube root over F3m
constructed using special classes of irreducible trinomials, tetranomials and pentanomials …

[引用][C] Low Complexity Cubing and Cube Root Computation over $\F_ {3^ m} $ in Polynomial Basis

O Ahmadi, FR Henríquez - IEEE Transactions on Computers, 2010 - cir.nii.ac.jp
Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis |
CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォーム …