237 search results - page 3 / 48 » Algorithms for Exponentiation in Finite Fields |
DAM
2006
13 years 7 months ago
2006
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
MOC
2000
13 years 7 months ago
2000
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
ANOR
2008
13 years 7 months ago
2008
This paper provides a general framework for establishing the relation between various moments of matrix exponential and Markovian processes. Based on this framework we present an a...
ALGORITHMICA
2002
13 years 7 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
ACISP
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especial...