New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

Soonhak Kwon; Taekyoung Kwon; Young Ho Park

doi:10.1007/11734727_27

New architecture for multiplication in GF(2^m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

Soonhak Kwon, Taekyoung Kwon, Young Ho Park

Graduate School of Information

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

We propose a new linear multiplier which is comparable to linear polynomial basis multipliers in terms of the area and time complexity. Also we give a very detailed comparison of our multiplier with the normal and polynomial basis multipliers for the five binary fields GF(2^m),m = 163, 233, 283, 409, 571, recommended by NIST for elliptic curve digital signature algorithm.

Original language	English
Title of host publication	Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers
Publisher	Springer Verlag
Pages	335-351
Number of pages	17
ISBN (Print)	3540333541, 9783540333548
DOIs	https://doi.org/10.1007/11734727_27
Publication status	Published - 2006 Jan 1
Event	8th International Conference on Information Security and Cryptology, ICISC 2005 - Seoul, Korea, Republic of Duration: 2005 Dec 1 → 2005 Dec 2

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3935 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	8th International Conference on Information Security and Cryptology, ICISC 2005
Country/Territory	Korea, Republic of
City	Seoul
Period	05/12/1 → 05/12/2

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11734727_27

Cite this

Kwon, S., Kwon, T., & Park, Y. H. (2006). New architecture for multiplication in GF(2^m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography. In Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers (pp. 335-351). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3935 LNCS). Springer Verlag. https://doi.org/10.1007/11734727_27

Kwon, Soonhak ; Kwon, Taekyoung ; Park, Young Ho. / New architecture for multiplication in GF(2^m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography. Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers. Springer Verlag, 2006. pp. 335-351 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{62ccabf71a7f4bfc9fb9bb029c19f480,

title = "New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography",

abstract = "We propose a new linear multiplier which is comparable to linear polynomial basis multipliers in terms of the area and time complexity. Also we give a very detailed comparison of our multiplier with the normal and polynomial basis multipliers for the five binary fields GF(2m),m = 163, 233, 283, 409, 571, recommended by NIST for elliptic curve digital signature algorithm.",

author = "Soonhak Kwon and Taekyoung Kwon and Park, {Young Ho}",

year = "2006",

month = jan,

day = "1",

doi = "10.1007/11734727_27",

language = "English",

isbn = "3540333541",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "335--351",

booktitle = "Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers",

address = "Germany",

note = "8th International Conference on Information Security and Cryptology, ICISC 2005 ; Conference date: 01-12-2005 Through 02-12-2005",

}

Kwon, S, Kwon, T & Park, YH 2006, New architecture for multiplication in GF(2^m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography. in Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3935 LNCS, Springer Verlag, pp. 335-351, 8th International Conference on Information Security and Cryptology, ICISC 2005, Seoul, Korea, Republic of, 05/12/1. https://doi.org/10.1007/11734727_27

New architecture for multiplication in GF(2^m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography. / Kwon, Soonhak; Kwon, Taekyoung; Park, Young Ho.
Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers. Springer Verlag, 2006. p. 335-351 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3935 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - New architecture for multiplication in GF(2m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography

AU - Kwon, Soonhak

AU - Kwon, Taekyoung

AU - Park, Young Ho

PY - 2006/1/1

Y1 - 2006/1/1

N2 - We propose a new linear multiplier which is comparable to linear polynomial basis multipliers in terms of the area and time complexity. Also we give a very detailed comparison of our multiplier with the normal and polynomial basis multipliers for the five binary fields GF(2m),m = 163, 233, 283, 409, 571, recommended by NIST for elliptic curve digital signature algorithm.

AB - We propose a new linear multiplier which is comparable to linear polynomial basis multipliers in terms of the area and time complexity. Also we give a very detailed comparison of our multiplier with the normal and polynomial basis multipliers for the five binary fields GF(2m),m = 163, 233, 283, 409, 571, recommended by NIST for elliptic curve digital signature algorithm.

UR - http://www.scopus.com/inward/record.url?scp=33745933500&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745933500&partnerID=8YFLogxK

U2 - 10.1007/11734727_27

DO - 10.1007/11734727_27

M3 - Conference contribution

SN - 3540333541

SN - 9783540333548

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 335

EP - 351

BT - Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers

PB - Springer Verlag

T2 - 8th International Conference on Information Security and Cryptology, ICISC 2005

Y2 - 1 December 2005 through 2 December 2005

ER -

Kwon S, Kwon T, Park YH. New architecture for multiplication in GF(2^m) and comparisons with normal and polynomial basis multipliers for elliptic curve cryptography. In Information Security and Cryptology, ICISC 2005 - 8th International Conference, Revised Selected Papers. Springer Verlag. 2006. p. 335-351. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11734727_27