Sciweavers

42 search results - page 1 / 9
» Fast evaluation of polynomials and inverses of polynomials
Sort
View
ARITH
1993
IEEE
13 years 9 months ago
Fast evaluation of polynomials and inverses of polynomials
Xavier Merrheim, Jean-Michel Muller, Hong-Jin Yeh
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
13 years 8 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
MICS
2007
88views more  MICS 2007»
13 years 4 months ago
Inversion of Analytic Functions via Canonical Polynomials: A Matrix Approach
An alternative to Lagrange inversion for solving analytic systems is our technique of dual vector fields. We implement this approach using matrix multiplication that provides a f...
Philip Feinsilver, René Schott
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
13 years 11 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
ASAP
2005
IEEE
114views Hardware» more  ASAP 2005»
13 years 10 months ago
Table-based polynomials for fast hardware function evaluation
Jérémie Detrey, Florent de Dinechin