Fully paramaterisable galois field arithmetic processor over GF(3 m) suitable for elliptic curve cryptography

T. Kerins; E. M. Popovici; W. P. Marnane

Fully paramaterisable galois field arithmetic processor over GF(3 ^m) suitable for elliptic curve cryptography

University College Cork

Research output: Contribution to conference › Paper › peer-review

Abstract

In this paper we present an architecture for a flexible GF(3^m) multiplicative arithmetic processor. The ABC processor performs computations of the form R = (AB/C) mod F in 2m clock cycles, where A,B,C and F are polynomials over GF(3). The same hardware can be used for different Held sizes offering full paramaterisability up to a maximum field size. We present prototype implementation results on FPGA for a field size of GF(3²⁵⁵). The processor is suitable for cryptographic applications where variable levels of security are required.

Original language	English
Pages	739-742
Number of pages	4
Publication status	Published - 2004
Event	Proceedings - 2004 24th International Conference on Microelectronics, MIEL 2004 - Nis Duration: 16 May 2004 → 19 May 2004

Conference

Conference	Proceedings - 2004 24th International Conference on Microelectronics, MIEL 2004
City	Nis
Period	16/05/04 → 19/05/04

Cite this

@conference{55e81cb3fb294210be6697077aeeaad7,

title = "Fully paramaterisable galois field arithmetic processor over GF(3 m) suitable for elliptic curve cryptography",

abstract = "In this paper we present an architecture for a flexible GF(3m) multiplicative arithmetic processor. The ABC processor performs computations of the form R = (AB/C) mod F in 2m clock cycles, where A,B,C and F are polynomials over GF(3). The same hardware can be used for different Held sizes offering full paramaterisability up to a maximum field size. We present prototype implementation results on FPGA for a field size of GF(3255). The processor is suitable for cryptographic applications where variable levels of security are required.",

author = "T. Kerins and Popovici, \{E. M.\} and Marnane, \{W. P.\}",

year = "2004",

language = "English",

pages = "739--742",

note = "Proceedings - 2004 24th International Conference on Microelectronics, MIEL 2004 ; Conference date: 16-05-2004 Through 19-05-2004",

}

TY - CONF

T1 - Fully paramaterisable galois field arithmetic processor over GF(3 m) suitable for elliptic curve cryptography

AU - Kerins, T.

AU - Popovici, E. M.

AU - Marnane, W. P.

PY - 2004

Y1 - 2004

N2 - In this paper we present an architecture for a flexible GF(3m) multiplicative arithmetic processor. The ABC processor performs computations of the form R = (AB/C) mod F in 2m clock cycles, where A,B,C and F are polynomials over GF(3). The same hardware can be used for different Held sizes offering full paramaterisability up to a maximum field size. We present prototype implementation results on FPGA for a field size of GF(3255). The processor is suitable for cryptographic applications where variable levels of security are required.

AB - In this paper we present an architecture for a flexible GF(3m) multiplicative arithmetic processor. The ABC processor performs computations of the form R = (AB/C) mod F in 2m clock cycles, where A,B,C and F are polynomials over GF(3). The same hardware can be used for different Held sizes offering full paramaterisability up to a maximum field size. We present prototype implementation results on FPGA for a field size of GF(3255). The processor is suitable for cryptographic applications where variable levels of security are required.

UR - https://www.scopus.com/pages/publications/3142694795

M3 - Paper

AN - SCOPUS:3142694795

SP - 739

EP - 742

T2 - Proceedings - 2004 24th International Conference on Microelectronics, MIEL 2004

Y2 - 16 May 2004 through 19 May 2004

ER -

Fully paramaterisable galois field arithmetic processor over GF(3 ^m) suitable for elliptic curve cryptography

Abstract

Conference

Other files and links

Fingerprint

Cite this