561 search results - page 49 / 113 » Using number fields to compute logarithms in finite fields |
DCC
2000
IEEE
14 years 9 months ago
2000
IEEE
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
DCC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
CGF
2008
14 years 9 months ago
2008
The powerful yet conceptually simple notions of Finite-Time Lyapunov Exponent (FTLE) and Lagrangian Coherent Structures provide a powerful framework for the analysis and visualiza...
ICWN
2007
14 years 11 months ago
2007
— Management of power and other resources that effect field life is an important consideration in sensor networks. This paper presents and compares alternative agent paradigms ap...
CJ
2008
14 years 9 months ago
2008
This article advocates a new computing paradigm, called computing with time, that is capable of efficiently performing a certain class of computation, namely, searching in paralle...