Abstract
In the past years several authors have considered finite fields extensions of odd characteristic optimised for a given architecture to obtain performance gains. The considered fields were however very specific.
We define a Processor Adequate Finite Field (PAFF) as a field of odd characteristic p<2w where w is a CPU related word length. PAFFs have several attractive properties for cryptography. In this paper we concentrate on arithmetic aspects. We present some algorithms usually providing better performance in PAFFs than in prime fields and in previously proposed instances of extension fields of comparable size.
Chapter PDF
References
Adleman, L.M., DeMarrais, J.: A subexponential algorithm for discrete logarithms over all finite fields. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 147–158. Springer, Heidelberg (1994)
Avanzi, R.: On multi-exponentiation in cryptography (2002) (preprint), Available from http://eprint.iacr.org , Newer version: On the complexity of certain multi-exponentiation techniques in cryptography (submitted)
Avanzi, R., Lange, T.: Cryptographic Applications of Trace Zero Varieties (preprint)
Bailey, D.V., Paar, C.: Efficient Arithmetic in Finite Field Extensions with Applications in Elliptic Curve Cryptography. Journal of Cryptography 14(3), 153–176 (2001)
Barrett, P.: Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 311–323. Springer, Heidelberg (1987)
Blahut, R.: Fast Algorithm for Digital Signal Processing. Addison-Wesley, Reading (1987)
Bosselaers, A., Govaerts, R., Vandewalle, J.: Comparison of three modular reduction functions. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 175–186. Springer, Heidelberg (1994)
Chung, J., Hasan, A.: More generalized Mersenne Numbers (Extended Abstract). In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, Springer, Heidelberg (2004)
von zur Gathen, J., Nöcker, M.: Exponentiation in finite fields: theory and practice. In: Mattson, H.F., Mora, T. (eds.) AAECC 1997. LNCS, vol. 1255, pp. 88–133. Springer, Heidelberg (1997)
Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190–200. Springer, Heidelberg (2001)
Grandlund, T.: GMP. A software library for arbitrary precision integers, Available from http://www.swox.com/gmp/
Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Physics-Doklady 7, 595–596 (1963)
Koblitz, N.: Elliptic curve cryptosystems. Math. Comp. 48(177), 203–209 (1987)
Koblitz, N.: Hyperelliptic cryptosystems. J. of Cryptology 1, 139–150 (1989)
Koblitz, N.: CM-Curves with good Cryptographic Properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 279–287. Springer, Heidelberg (1992)
Knuth, D.E.: The art of computer programming, 3rd edn. Series in Computer Science and Information Processing. Addison-Wesley, Reading (1997)
Lange, T.: Trace Zero Subvariety for Cryptosystems (submitted)
Lenstra, A.K.: Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems over Finite Fields. In: Mu, Y., Pieprzyk, J.P., Varadharajan, V. (eds.) ACISP 1997. LNCS, vol. 1270, pp. 127–138. Springer, Heidelberg (1997)
Lim, S., Kim, S., Yie, I., Kim, J., Lee, H.: XTR Extended to GF(p6m). In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 301–312. Springer, Heidelberg (2001)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Montgomery, P.L.: Modular multiplication without trial division. Math. Comp. 44(170), 519–521 (1985)
Mihăilescu, P.: Optimal Galois Field Bases which are not Normal. In: Recent Results Session, Fast Software Encryption Symposium, Haifa (1997)
Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)
Müller, V.: Efficient Point Multiplication for Elliptic Curves over Special Optimal Extension Fields. In: Public-Key Cryptography and Computational Number Theory, September 11-15, 2000, Warschau, pp. 197–207. De Gruyter (2001)
Odlyzko, A.: Discrete Logarithms: The past and the future. Designs, Codes and Cryptography 19, 129–145 (2000)
Quisquater, J.-J.: Procédé de Codage selon la Methode dite RSA, par un Microcontr ôleur et Dispositifs Utilisant ce Procédé. Demande de brevet Français (Dépôt numéro: 90 02274) (February 1990)
Quisquater, J.-J.: Encoding System According to the So-called RSA Method, by Means of a Microcontroller and Arrangement Implementing this System. U.S. Patent 5,166,978 (November 1992)
Reitwiesner, G.W.: Binary arithmetic. Advances in Computers 1, 231–308 (1960)
Schönhage, A., Strassen, V.: Schnelle Multiplikation großer Zahlen. Computing 7, 281–292
Schirokauer, O.: Using number fields to compute logarithms in finite fields. Math. Comp. 69, 1267–1283 (2000)
Sica, F., Ciet, M., Quisquater, J.-J.: Analysis of the Gallant-Lambert-Vanstone Method based on Efficient Endomorphisms: Elliptic and Hyperelliptic Curves. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 21–36. Springer, Heidelberg (2003)
Solinas, J.A.: An improved algorithm for arithmetic on a family of elliptic curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 357–371. Springer, Heidelberg (1997)
Stam, M., Lenstra, A.K.: Efficient subgroup exponentiation in quadratic and sixth degree extensions. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 318–332. Springer, Heidelberg (2003)
Stam, M.: Speeding up Subgroup Cryptosystems. Ph.D. Thesis, Technical University of Eindhoven (2003) ISBN 90-386-0692-3
Verheul, E.R., Lenstra, A.K.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 1–19. Springer, Heidelberg (2000)
Yao, A.C.: On the evaluation of powers. SIAM Journal on Computing 5, 100–103 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avanzi, R.M., Mihăilescu, P. (2004). Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures. In: Matsui, M., Zuccherato, R.J. (eds) Selected Areas in Cryptography. SAC 2003. Lecture Notes in Computer Science, vol 3006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24654-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-24654-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21370-3
Online ISBN: 978-3-540-24654-1
eBook Packages: Springer Book Archive