Presentation 2004-11-08
A Reconfigurable Dual-Field Multiplier for GF(P) and GF(2^n)
Ryo NAMBA, Masaru TAKESUE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a dual-field multiplier for the cryptographic system on GF (P) and GF (2^n) both with multiple key-sizes. The supported key-sizes are 192,224 and 256 bits over GF (P) and 163,191 and 233 bits over GF (2^n). To avoid the time-consuming division required in previous multiplication algorithms on GF (P), we predict the value of division using some intermediate values. Simulation results show that the number of cycles required for multiplication is equal to the key-sizes on GF(2^n) and about 1.5・[log_2(P)] on GF(P).
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Modular Multiplication / Elliptic Curve Cryptography / Reconfigurable / Galois field / Dual-field / MSB-First multiplication algorithm
Paper # ISEC2004-79,OIS2004-46
Date of Issue

Conference Information
Committee ISEC
Conference Date 2004/11/1(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Reconfigurable Dual-Field Multiplier for GF(P) and GF(2^n)
Sub Title (in English)
Keyword(1) Modular Multiplication
Keyword(2) Elliptic Curve Cryptography
Keyword(3) Reconfigurable
Keyword(4) Galois field
Keyword(5) Dual-field
Keyword(6) MSB-First multiplication algorithm
1st Author's Name Ryo NAMBA
1st Author's Affiliation Hosei University()
2nd Author's Name Masaru TAKESUE
2nd Author's Affiliation Hosei University
Date 2004-11-08
Paper # ISEC2004-79,OIS2004-46
Volume (vol) vol.104
Number (no) 421
Page pp.pp.-
#Pages 6
Date of Issue