Hardware implementation of elliptic curve cryptosystem over GF(PM)

Ilker Yavuz; Berna Ors

Hardware implementation of elliptic curve cryptosystem over GF(P^M)

Ilker Yavuz
, Berna Ors

Elektronik ve Hab.Müh.Bölümü

Araştırma sonucu: Kitap/Rapor/Konferans Bildirisinde Bölüm › Konferans katkısı › bilirkişi

Özet

This paper describes an efficient FPGA implementation for modular multiplication operation in the field GF (p^M) that is suitable for implementing Elliptic Curve Cryptosystems. We have developed a systolic array implementation of a Montgomery modular multiplication (MMM). This implementation is efficient for large finite fields (m =160 - 193 bit) that offer a high security level. Also our implementation is independent of reduction polynomial because of MMM technique. We have specialized to fields GF (3^M) and provide implementation results. We choose m = 97 to compare our results with previous elliptic curve implementations that use different multiplication techniques. In contrast to earlier works, Montgomery multiplication technique has never been used in the field GF (p^M).

Orijinal dil	İngilizce
Ana bilgisayar yayını başlığı	Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007
Yayınlayan	Tafford Publishing
Sayfalar	24-33
Sayfa sayısı	10
ISBN (Basılı)	9781425141097
Yayın durumu	Yayınlandı - 2008
Etkinlik	1st International Conference on Security of Information and Networks, SIN 2007 - Gazimagusa, Turkey Süre: 7 May 2007 → 10 May 2007

Yayın serisi

Adı	Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???	1st International Conference on Security of Information and Networks, SIN 2007
Ülke/Bölge	Turkey
Şehir	Gazimagusa
Periyot	7/05/07 → 10/05/07

Diğer Dosyalar ve Linkler

Link to publication in Scopus

Alıntı Yap

Yavuz, I., & Ors, B. (2008). Hardware implementation of elliptic curve cryptosystem over GF(P^M). In Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007 (pp. 24-33). (Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007). Tafford Publishing.

Yavuz, Ilker ; Ors, Berna. / Hardware implementation of elliptic curve cryptosystem over GF(P^M). Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007. Tafford Publishing, 2008. pp. 24-33 (Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007).

@inproceedings{5e4f87ebc8f942a49385cea9631bd85f,

title = "Hardware implementation of elliptic curve cryptosystem over GF(PM)",

abstract = "This paper describes an efficient FPGA implementation for modular multiplication operation in the field GF (pM) that is suitable for implementing Elliptic Curve Cryptosystems. We have developed a systolic array implementation of a Montgomery modular multiplication (MMM). This implementation is efficient for large finite fields (m =160 - 193 bit) that offer a high security level. Also our implementation is independent of reduction polynomial because of MMM technique. We have specialized to fields GF (3M) and provide implementation results. We choose m = 97 to compare our results with previous elliptic curve implementations that use different multiplication techniques. In contrast to earlier works, Montgomery multiplication technique has never been used in the field GF (pM).",

keywords = "Elliptic Curve, FPGA, Montgomery, Systolic Array",

author = "Ilker Yavuz and Berna Ors",

year = "2008",

language = "English",

isbn = "9781425141097",

series = "Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007",

publisher = "Tafford Publishing",

pages = "24--33",

booktitle = "Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007",

note = "1st International Conference on Security of Information and Networks, SIN 2007 ; Conference date: 07-05-2007 Through 10-05-2007",

}

Yavuz, I & Ors, B 2008, Hardware implementation of elliptic curve cryptosystem over GF(P^M). in Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007. Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007, Tafford Publishing, pp. 24-33, 1st International Conference on Security of Information and Networks, SIN 2007, Gazimagusa, Turkey, 7/05/07.

Hardware implementation of elliptic curve cryptosystem over GF(P^M). / Yavuz, Ilker; Ors, Berna.
Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007. Tafford Publishing, 2008. p. 24-33 (Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007).

Araştırma sonucu: Kitap/Rapor/Konferans Bildirisinde Bölüm › Konferans katkısı › bilirkişi

TY - GEN

T1 - Hardware implementation of elliptic curve cryptosystem over GF(PM)

AU - Yavuz, Ilker

AU - Ors, Berna

PY - 2008

Y1 - 2008

N2 - This paper describes an efficient FPGA implementation for modular multiplication operation in the field GF (pM) that is suitable for implementing Elliptic Curve Cryptosystems. We have developed a systolic array implementation of a Montgomery modular multiplication (MMM). This implementation is efficient for large finite fields (m =160 - 193 bit) that offer a high security level. Also our implementation is independent of reduction polynomial because of MMM technique. We have specialized to fields GF (3M) and provide implementation results. We choose m = 97 to compare our results with previous elliptic curve implementations that use different multiplication techniques. In contrast to earlier works, Montgomery multiplication technique has never been used in the field GF (pM).

AB - This paper describes an efficient FPGA implementation for modular multiplication operation in the field GF (pM) that is suitable for implementing Elliptic Curve Cryptosystems. We have developed a systolic array implementation of a Montgomery modular multiplication (MMM). This implementation is efficient for large finite fields (m =160 - 193 bit) that offer a high security level. Also our implementation is independent of reduction polynomial because of MMM technique. We have specialized to fields GF (3M) and provide implementation results. We choose m = 97 to compare our results with previous elliptic curve implementations that use different multiplication techniques. In contrast to earlier works, Montgomery multiplication technique has never been used in the field GF (pM).

KW - Elliptic Curve

KW - FPGA

KW - Montgomery

KW - Systolic Array

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

M3 - Conference contribution

AN - SCOPUS:84893197871

SN - 9781425141097

T3 - Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007

SP - 24

EP - 33

BT - Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007

PB - Tafford Publishing

T2 - 1st International Conference on Security of Information and Networks, SIN 2007

Y2 - 7 May 2007 through 10 May 2007

ER -

Yavuz I, Ors B. Hardware implementation of elliptic curve cryptosystem over GF(P^M). In Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007. Tafford Publishing. 2008. p. 24-33. (Security of Information and Networks - Proceedings of the 1st International Conference on Security of Information and Networks, SIN 2007).