Sciweavers

42 search results - page 4 / 9
» Fast evaluation of polynomials and inverses of polynomials
Sort
View
CORR
2008
Springer
82views Education» more  CORR 2008»
14 years 9 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
81
Voted
WSCG
2004
157views more  WSCG 2004»
14 years 11 months ago
Efficient Implementation of Higher Order Image Interpolation
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...
Roland Perko, Horst Bischof
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
14 years 1 months ago
An Improved Algebraic Attack on Hamsi-256
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
Itai Dinur, Adi Shamir
MASCOTS
2001
14 years 11 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement
111
Voted
ARITH
2009
IEEE
15 years 1 months ago
A New Binary Floating-Point Division Algorithm and Its Software Implementation on the ST231 Processor
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
Claude-Pierre Jeannerod, Herve Knochel, Christophe...