Sciweavers

6897 search results - page 237 / 1380
» Parallelization of Modular Algorithms
Sort
View
EUROCRYPT
2004
Springer
15 years 8 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron
155
Voted
ISDA
2006
IEEE
15 years 8 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
ARTS
1997
Springer
15 years 6 months ago
Refinement of Time
We introduce a mathematical model of the timed behaviour of components with streams as input and output using a hierarchy of timing concepts. We distinguish non-timed streams, dis...
Manfred Broy
115
Voted
HPCN
1994
Springer
15 years 6 months ago
Communication Cost Reduction for Krylov Methods on Parallel Computers
On large distributed memory parallel computers the global communication cost of inner products seriously limits the performance of Krylov subspace methods 3]. We consider improved ...
Eric de Sturler, Henk A. van der Vorst
109
Voted
EUROPAR
2000
Springer
15 years 6 months ago
Parallelizing an Unstructured Grid Generator with a Space-Filling Curve Approach
A new parallel load distribution algorithm for unstructured parallel grid generation is presented. This new approach is based on a space-filling curve. The space-filling curve'...
Jörn Behrens, Jens Zimmermann