Sciweavers

2967 search results - page 163 / 594
» Cryptology
Sort
View
CRYPTO
2010
Springer
141views Cryptology» more  CRYPTO 2010»
15 years 8 months ago
Factorization of a 768-Bit RSA Modulus
Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Ar...
AES
2010
Springer
141views Cryptology» more  AES 2010»
15 years 7 months ago
Provide Virtual Distributed Environments for Grid computing on demand
Grid users always expect to meet some challenges to employ Grid resources, such as customized computing environment and QoS support. In this paper, we propose a new methodology fo...
Lizhe Wang, Gregor von Laszewski, Marcel Kunze, Ji...
AES
2007
Springer
109views Cryptology» more  AES 2007»
15 years 7 months ago
Compatible coarsening in the multigraph algorithm
We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [1]...
Randolph E. Bank
PAIRING
2010
Springer
147views Cryptology» more  PAIRING 2010»
15 years 5 months ago
Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves
Constructing pairing-friendly hyperelliptic curves with small ρ-values is one of challenges for practicability of pairing-friendly hyperelliptic curves. In this paper, we describe...
Ezekiel J. Kachisa
PKC
2010
Springer
199views Cryptology» more  PKC 2010»
15 years 5 months ago
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
Steven D. Galbraith, Raminder S. Ruprai