Sciweavers

861 search results - page 13 / 173
» Faster integer multiplication
Sort
View
EUROCRYPT
2009
Springer
14 years 8 months ago
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
Steven D. Galbraith, Xibin Lin, Michael Scott
ICASSP
2011
IEEE
12 years 11 months ago
Integer fast lapped orthogonal transform based on direct-lifting of dcts for lossless-to-lossy image coding
Integer lapped orthogonal transforms (LOTs) are vital technologies for the unification of lossless and lossy image coding, called losslessto-lossy image coding. In this paper, we...
Taizo Suzuki, Masaaki Ikehara
ISAAC
2003
Springer
117views Algorithms» more  ISAAC 2003»
14 years 28 days ago
Approximate Regular Expression Searching with Arbitrary Integer Weights
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
Gonzalo Navarro
ARITH
2007
IEEE
14 years 2 months ago
Multiplication by a Constant is Sublinear
Abstract— This paper explores the use of the double-base number system (DBNS) for constant integer multiplication. The DBNS recoding scheme represents integers – in this case c...
Vassil S. Dimitrov, Laurent Imbert, Andrew Zakaluz...
APPT
2009
Springer
13 years 11 months ago
Efficient Multiplication of Polynomials on Graphics Hardware
We present the algorithm to multiply univariate polynomials with integer coefficients efficiently using the Number Theoretic transform (NTT) on Graphics Processing Units (GPU). The...
Pavel Emeliyanenko