Sciweavers

17541 search results - page 86 / 3509
» Complexity in scalable computing
Sort
View
ASIACRYPT
2005
Springer
15 years 3 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
15 years 3 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
CSCWD
2008
Springer
14 years 11 months ago
Computer aided architectural design: Wayfinding complexity analysis
Design is a complex process often described as a collaboration between a designer and herself. In architectural design, a designer must consider the selection of a subset of actio...
Brett Bojduj, Ben Weber, Kai-Florian Richter, Sven...
DIGRA
2005
Springer
15 years 3 months ago
Architecting Scalability for Massively Multiplayer Online Gaming Experiences
In this study, the authors propose to discuss scalability challenges posed by Massively Multiplayer Online Game (MMOG) scenarios, while outlining issues specific to the context of...
Rui Gil, José Tavares, Licinio Roque
IAJIT
2006
145views more  IAJIT 2006»
14 years 9 months ago
Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its dat...
Adnan Abdul-Aziz Gutub