Sciweavers

1400 search results - page 11 / 280
» On multiplication in finite fields
Sort
View
CRYPTO
1993
Springer
118views Cryptology» more  CRYPTO 1993»
13 years 11 months ago
A Subexponential Algorithm for Discrete Logarithms over All Finite Fields
Abstract. There are numerous subexponential algorithms for computing discrete logarithms over certain classes of finite fields. However, there appears to be no published subexponen...
Leonard M. Adleman, Jonathan DeMarrais
CORR
2008
Springer
110views Education» more  CORR 2008»
13 years 7 months ago
Rational streams coalgebraically
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
Jan J. M. M. Rutten
FFA
2008
75views more  FFA 2008»
13 years 7 months ago
Syntactical and automatic properties of sets of polynomials over finite fields
Syntactical properties of representations of integers in various number systems are well-known and have been extensively studied. In this paper, we transpose the notion of recogniz...
Michel Rigo
CORR
2006
Springer
163views Education» more  CORR 2006»
13 years 7 months ago
Finding roots of polynomials over finite fields
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
TC
2002
13 years 7 months ago
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show ...
Zeljko Zilic, Zvonko G. Vranesic