560 search results - page 43 / 112 » Multiplication by a Constant is Sublinear |
GLOBECOM
2010
IEEE
13 years 6 months ago
2010
IEEE
We propose an analytical model to assess the throughput and connection blocking rate of Opportunistic Spectrum Orthogonal Frequency Division Multiple Access network constituted of ...
CRYPTO
2001
Springer
14 years 17 days ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
CHES
2000
Springer
14 years 12 days ago
2000
Springer
The Montgomery multiplication is commonly used as the core algorithm for cryptosystems based on modular arithmetic. With the advent of new classes of attacks (timing attacks, power...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
ASAP
2006
IEEE
14 years 2 months ago
2006
IEEE
Data-Pipelining is a widely used model to represent streaming applications. Incremental decomposition and optimization of a data-pipelining application onto a multi-processor plat...