Sciweavers

8 search results - page 1 / 2
» On the unique representability of spikes over prime fields
Sort
View
DM
2006
91views more  DM 2006»
13 years 5 months ago
On the unique representability of spikes over prime fields
For an integer n 3, a rank-n matroid is called an n-spike if it consists of n three-point lines through a common point such that, for all k {1, 2, . . . , n - 1}, the union of e...
Zhaoyang Wu, Zhi-Wei Sun
JCT
2010
85views more  JCT 2010»
13 years 3 months ago
On inequivalent representations of matroids over non-prime fields
Abstract. For each finite field F of prime order there is a constant c such that every 4-connected matroid has at most c inequivalent representations over F. We had hoped that th...
Jim Geelen, Bert Gerards, Geoff Whittle
EUROCRYPT
2006
Springer
13 years 8 months ago
The Function Field Sieve in the Medium Prime Case
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
Antoine Joux, Reynald Lercier
JSC
2010
155views more  JSC 2010»
13 years 3 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan
JOC
2010
96views more  JOC 2010»
12 years 11 months ago
On the Efficient Generation of Prime-Order Elliptic Curves
We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...