Abstract
This paper describes a new efficient method of modular reduction in \( \mathbb{F}_q \)[x] suited for both software and hardware implementations. This method is particularly well adapted to smart card implementations of elliptic curve cryptography over GF(2p) using a polynomial representation. Many publications use the equivalent in \( \mathbb{F}_2 \)[x] of Montgomery’s modular multiplication over integers. We show here an equivalent in \( \mathbb{F}_q \)[x] to the generalized Barrett’s modular reduction over integers. The attractive properties of the last method in \( \mathbb{F}_2 \)[x] allow nearly ideal implementations in hardware as well as in software with minimum additional resources as compared to what is available on usual processor architecture.
An implementation minimizing the memory accesses is described for both Montgomery’s implementation and ours. This shows identical computing and memory access resources for both methods. The new method also avoids the need for the bulky normalization (denormalization) which is required by Montgomery’s method to obtain a correct result.
Chapter PDF
Similar content being viewed by others
Keywords
References
Koç, C., Acar, T.: Montgomery multiplication in GF(2k). In: Publishers, K.A. (ed.) Designs, Codes and Cryptography, Boston, vol. 14, pp. 57–69 (1998)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Montgomery, P.: Modular multiplication without trial division. Mathematics of Computation 44, 519–521 (1985)
IEEE: Std 1363-2000. IEEE standard specifications for public-key cryptography, New York, USA (2000), Informations available at http://grouper.ieee.org/groups/1363/
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)
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 (1992)
Dhem, J.F., Quisquater, J.J.: Recent results on modular multiplications for smart cards. In: Schneier, B., Quisquater, J.-J. (eds.) CARDIS 1998. LNCS, vol. 1820, pp. 336–352. Springer, Heidelberg (2000)
Cohen, H.: A Course in Computational Algebraic Number Theory, 2nd edn. Graduate Texts in Mathematics. Springer, Heidelberg (1995)
De Win, E., Bosselaers, A., Vandenberghe, S., De Gersem, P., Vandewalle, J.: A fast software implementation for arithmetic operations in GF(2n). In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol. 1163, pp. 65–76. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dhem, JF. (2003). Efficient Modular Reduction Algorithm in \( \mathbb{F}_q \)[x] and Its Application to “Left to Right” Modular Multiplication in \( \mathbb{F}_2 \)[x]. In: Walter, C.D., Koç, Ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems - CHES 2003. CHES 2003. Lecture Notes in Computer Science, vol 2779. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45238-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-45238-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40833-8
Online ISBN: 978-3-540-45238-6
eBook Packages: Springer Book Archive