Sciweavers

1400 search results - page 31 / 280
» On multiplication in finite fields
Sort
View
CRYPTO
1991
Springer
150views Cryptology» more  CRYPTO 1991»
13 years 11 months ago
CM-Curves with Good Cryptographic Properties
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
Neal Koblitz
VIS
2007
IEEE
108views Visualization» more  VIS 2007»
14 years 8 months ago
Efficient Visualization of Lagrangian Coherent Structures by Filtered AMR Ridge Extraction
This paper presents a method for filtered ridge extraction based on adaptive mesh refinement. It is applicable in situations where the underlying scalar field can be refined during...
Filip Sadlo, Ronald Peikert
AAECC
2002
Springer
98views Algorithms» more  AAECC 2002»
13 years 7 months ago
A Polynomial Representation of the Diffie-Hellman Mapping
Let Fq be the finite field of order q and be an element of Fq of order d. The construction of an explicit polynomial f (X) Fq[X] of degree d - 1 with the property f i = i2 for ...
Wilfried Meidl, Arne Winterhof
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 7 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
MOC
2000
132views more  MOC 2000»
13 years 7 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer