Sciweavers

137 search results - page 1 / 28
» Probabilistic algorithm for finding roots of linearized poly...
Sort
View
DCC
2008
IEEE
14 years 3 months ago
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
Vitaly Skachek, Ron M. Roth
CORR
2006
Springer
163views Education» more  CORR 2006»
13 years 3 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
ISSAC
1995
Springer
93views Mathematics» more  ISSAC 1995»
13 years 7 months ago
Finding Roots of Unity Among Quotients of the Roots of an Integral Polynomial
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...
Kazuhiro Yokoyama, Ziming Li, István Nemes
ESA
2000
Springer
84views Algorithms» more  ESA 2000»
13 years 7 months ago
On Representations of Algebraic-Geometric Codes for List Decoding
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
Venkatesan Guruswami, Madhu Sudan
EUROCRYPT
2004
Springer
13 years 9 months ago
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
Jean-Sébastien Coron