Sciweavers

561 search results - page 14 / 113
» Using number fields to compute logarithms in finite fields
Sort
View
IEEEIAS
2009
IEEE
14 years 3 months ago
Network Security Situation Awareness Using Exponential and Logarithmic Analysis
: Network security situation awareness (NSSA) is a hotspot in the network security research field, and it’s the perception, comprehension, and forecast of network security situat...
Xiaobin Tan, Qin Guihong, Zhang Yong, Liang Ping
MOC
2002
109views more  MOC 2002»
13 years 8 months ago
The parallelized Pollard kangaroo method in real quadratic function fields
Abstract. We show how to use the parallelized kangaroo method for computing invariants in real quadratic function fields. Specifically, we show how to apply the kangaroo method to ...
Andreas Stein, Edlyn Teske
SI3D
2006
ACM
14 years 2 months ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
IJNSEC
2006
98views more  IJNSEC 2006»
13 years 8 months ago
Comment on Improvement of the Miyazaki-Takaragi Threshold Digital Signature Scheme
To enhance applications of smart cards, Miyazaki and Takaragi proposed a (t, n) threshold digital signature scheme based on the security of elliptic curve discrete logarithm (ECDL...
Zuhua Shao
TC
2008
13 years 8 months ago
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...