Sciweavers

1400 search results - page 154 / 280
» On multiplication in finite fields
Sort
View
GMP
2010
IEEE
214views Solid Modeling» more  GMP 2010»
14 years 1 months ago
Efficient Computation of 3D Clipped Voronoi Diagram
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D d...
Dong-Ming Yan, Wenping Wang, Bruno Lévy, Ya...
CRYPTO
1998
Springer
105views Cryptology» more  CRYPTO 1998»
14 years 1 months ago
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
Sarvar Patel, Ganapathy S. Sundaram
SC
1993
ACM
14 years 1 months ago
Solving the Boltzmann equation at 61 gigaflops on a 1024-node CM-5
This paper documents the use of a massively parallel computer, specifically the Connection Machine CM-5, to solve the Boltzmann equation to model one-dimensional shock wave struct...
Lyle N. Long, Jacek Myczkowski
ATAL
2006
Springer
14 years 24 days ago
ActorNet: an actor platform for wireless sensor networks
We present actorNet, a mobile agent platform for wireless sensor networks (WSNs). WSNs are well-suited to multiagent systems: agent autonomy reduces the need for communication, sa...
YoungMin Kwon, Sameer Sundresh, Kirill Mechitov, G...
CIS
2006
Springer
14 years 24 days ago
Efficient Implementation of Tate Pairing on a Mobile Phone Using Java
Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosy...
Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto