Horner's rule-based multiplication over GF(p) and GF(pn ): A survey

International Journal of Electronics

Volumn 95, Issue 7, 2008, Pages 669-684

  Beuchat, J L ^a   Miyoshi, T ^a   Muller, J M ^b   Okamoto, E ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b UNIV LYON   (France)

Author keywords

Binary field; FPGA; Modular multiplication; Prime field

Indexed keywords

BINARY FIELD; CODE GENERATORS; FINITE FIELD ARITHMETIC; FPGA; GENERIC ARCHITECTURES; MODULAR MULTIPLICATION; PRIME FIELD; PROCESSING ELEMENTS; RECONFIGURABLE HARDWARE; RULE-BASED; VHDL DESCRIPTION;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 49149108778     PISSN: 00207217     EISSN: 13623060     Source Type: Journal    
DOI: 10.1080/00207210801924099     Document Type: Conference Paper

References (23)

1. Amanor, D.N., Paar, C., Pelzl, J., Bunimov, V., and Schimmler, M. (2005), "Efficient Hardware Architectures for Modular Multiplication on FPGAs," in Proceedings of FPL 2005, pp. 539-542.
2. Bajard, J.-C., Didier, L.-S., and Kornerup, P. (1998), "A RNS Montgomery Modular Multiplication Algorithm," IEEE Transactions on Computers, 47, 766-776.
3. Beuchat, J.-L., and Muller, J.-M. (2004), "Modulo M Multiplication-Addition: Algorithms and FPGA Implementation," Electronics Letters, 40, 654-655.
4. Beuchat, J.-L., and Muller, J.-M. (2007), "Automatic Generation of Modular Multipliers for FPGA Applications". Technical Report, École Normale Supérieure de Lyon, 46 Allée d'Italie, 69364 Lyon Cedex 07.
5. T Pairing Calculation in Characteristic Three and its Hardware Implementation," in Proceedings of the 18th IEEE Symposium on Computer Arithmetic, Montpellier, France, pp. 97-104.
6. pm on FPGA: A Survey," in Reconfigurable Computing: Architectures, Tools and Applications - Proceedings of ARC 2007, Mangaratiba, Brazil, pp. 214-225.
7. Blakley, G.R. (1983), "A Computer Algorithm for Calculating the Product AB Modulo M," IEEE Transactions on Computers, C-32, 497-500.
8. Bunimov, V., and Schimmler, M. (2003), "Area and Time Efficient Modular Multiplication of Large Integers," in Proceedings of the 14th IEEE International Conference on Application-Specific Systems, Architectures, and Processors, The Hague, The Netherlands, pp. 400-409.
9. m)," Acta Applicandae Mathematicae, 93, 33-55.
10. Grabher, P., and Page, D. (2005), "Hardware Acceleration of the Tate Pairing in Characteristic Three," in Cryptographic Hardware and Embedded Systems - CHES 2005, pp. 398-411.
11. Guajardo, J., Güneysu, T., Kumar, S., Paar, C., and Pelzl, J. (2006), "Efficient Hardware Implementation of Finite Fields with Applications to Cryptography," Acta Applicandae Mathematicae, 93, 75-118.
12. Jeong, Y.-J., and Burleson, W.P. (1997), "VLSI Array Algorithms and Architectures for RSA Modular Multiplication," IEEE Transactions on Very Large Scale Integration Systems, 5, 211-217.
13. Kim, S., and Sobelman, G.E. (2001), "Digit-Serial Modular Multiplication Using Skew-Tolerant Domino CMOS," in Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Salt Lake City, Utah, USA, pp. 1173-1176.
14. Koç, Ç.K., and Hung, C.Y. (1990a), "Multi-operand Modulo Addition using Carry Save Adders," Electronics Letters, 26, 361-363.
15. Koç, Ç.K., and Hung, C.Y. (1990b), "Carry-save Adders for Computing the Product AB Modulo N," Electronics Letters, 26, 899-900.
16. Koç, Ç.K., and Hung, C.Y. (1998), "A Fast Algorithm for Modular Reduction," IEE Proceedings: Computers and Digital Techniques, 145, 265-271.
17. m) Multipliers for Curve-Based Cryptography," IEEE Transactions on Computers, 55, 1306-1311.
18. Montgomery, P.L. (1985), "Modular Multiplication Without Trial Division," Mathematics of Computation, 44, 519-521.
19. Peeters, E., Neve, M., and Ciet, M. (2004), "XTR Implementation on Reconfigurable Hardware," in Cryptographic Hardware and Embedded Systems CHES 2004, Cambridge, MA, USA, pp. 386-399.
20. Song, L., and Parhi, K.K. (1998), "Low Energy Digit-Serial/Parallel Finite Field Multipliers," Journal of VLSI Signal Processing, 19, 149-166.
21. Shu, C., Kwon, S., and Gaj, K. (2006), "FPGA Accelerated Tate Pairing Based Cryptosystem over Binary Fields". Technical Report, Cryptology ePrint Archive.
22. Takagi, N., and Yajima, S. (1992), "Modular Multiplication Hardware Algorithms with a Redundant Representation and their Application to RSA Cryptosystem," IEEE Transactions on Computers, 41, 887-891.
23. Takagi, N. (1992), "A Radix-4 Modular Multiplication Hardware Algorithm for Modular Exponentiation," IEEE Transactions on Computers, 41, 949-956.