4047 search results - page 24 / 810 » The Discrete Basis Problem |
PKC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
MCS
2007
Springer
13 years 7 months ago
2007
Springer
Most results related to discrete nonnegativity conservation principles (DNCP) for elliptic problems are limited to finite differences (FDM) and lowest-order finite element meth...
DAM
2006
13 years 7 months ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
SETA
2004
Springer
14 years 23 days ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
CCCG
2007
13 years 9 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...