FINITE FIELD MULTIPLICATION IN LAGRANGE REPRESENTATION USING FAST FOURRIER TRANSFORM

Christophe Negre

Abstract

The multiplication in Fpn can be performed using a polynomial version of Montgomery multiplication (Montgomery, 1985). In (Bajard et al., 2003) Bajard et al. improved this method by using a Lagrange representation: the elements of Fpn are represented by their values at a fixed set of points. The costly operations in this new algorithm are the two changes of Lagrange representation which require 2r2 operations in Fp with n ≤ r ≤ 2⌈log2 (n)⌉ . In this paper we present a new method to perform the change of Lagrange representation. This method uses Fast Fourier Transform and has a cost equal to 3rlog2 (r) operations in Fp with r = 2⌈log2 (n)⌉ .

References

  1. Bailey, D. and Paar, C. (1998). Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. Lecture Notes in Computer Science, 1462:472.
  2. Bajard, J.-C., Imbert, L., Negre, C., and Plantard, T. (2003). Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography. In ARITH 16, 16th IEEE Symposium on Computer Arithmetic June 15-18, 2003 Santiago de Compostela, SPAIN.
  3. Berlekamp, E. (1982). Bit-serial Reed-Solomon encoder. IEEE Transaction on Information Theory, IT-28(6).
  4. Johnson, J., Kumhom, P., and Nagvajara, P. (2000). Design, optimization, and implementation of a universal fft processor. In 13th IEEE International ASIC/SOC Conference, Washington, DC.
  5. Koblitz, N. (1987). Elliptic curve cryptosystems. Mathematics of Computation, 48(177):203-209.
  6. Miller, V. (1986). Use of elliptic curves in cryptography. Advances in Cryptology, proceeding's of CRYPTO'85, 218:417-426.
  7. Montgomery, P. (1985). Modular multiplication without trial division. Mathematic of computation, 44(170).
  8. Ning, P. and Yin, Y. (2001). Efficient Software Implementation for Finite Field Multiplication in Normal Basis. Lecture Notes in Computer Science, 2229:177.
  9. Sunar, B. and Koc, C. (1999). Mastrovito Multiplier for All Trinomials. IEEE Transaction on Computers.
  10. von zur Gathen, J. and Gerhard, J. (1999). Modern computer algebra. Cambridge University Press, New York, NY, USA.
Download


Paper Citation


in Harvard Style

Negre C. (2006). FINITE FIELD MULTIPLICATION IN LAGRANGE REPRESENTATION USING FAST FOURRIER TRANSFORM . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2006) ISBN 978-972-8865-63-4, pages 320-324. DOI: 10.5220/0002096503200324


in Bibtex Style

@conference{secrypt06,
author={Christophe Negre},
title={FINITE FIELD MULTIPLICATION IN LAGRANGE REPRESENTATION USING FAST FOURRIER TRANSFORM},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2006)},
year={2006},
pages={320-324},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002096503200324},
isbn={978-972-8865-63-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2006)
TI - FINITE FIELD MULTIPLICATION IN LAGRANGE REPRESENTATION USING FAST FOURRIER TRANSFORM
SN - 978-972-8865-63-4
AU - Negre C.
PY - 2006
SP - 320
EP - 324
DO - 10.5220/0002096503200324