Efficient arithmetic over finite fields has high relevance both in hardware and software implementations. One of the most expensive operation over finite field is the multiplication. To our knowledge, the best known explicit upper bounds for the polynomial multiplication were obtained using the multiplication technique presented in [3]. In this paper, we improve such explicit upper bounds and show how this research allows us to reduce the number of bit operations needed to multiply m-bit polynomials.
Tight upper bounds for polynomial multiplication / D. D'Angella, C.V. Schiavo, A. Visconti (RECENT ADVANCES IN COMPUTER ENGINEERING). - In: Recent advances in computer science / [a cura di] K. Psarris. - Athens : WSEAS Press, 2013. - ISBN 9789604743544. - pp. 31-37 (( convegno WSEAS International Conference tenutosi a Nanjing nel 2013.
Tight upper bounds for polynomial multiplication
C.V. Schiavo;A. Visconti
2013
Abstract
Efficient arithmetic over finite fields has high relevance both in hardware and software implementations. One of the most expensive operation over finite field is the multiplication. To our knowledge, the best known explicit upper bounds for the polynomial multiplication were obtained using the multiplication technique presented in [3]. In this paper, we improve such explicit upper bounds and show how this research allows us to reduce the number of bit operations needed to multiply m-bit polynomials.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
