11 search results - page 2 / 3 » A sparse modular GCD algorithm for polynomials over algebrai... |
IJNSEC
2010
13 years 1 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
ESA
2000
Springer
13 years 9 months ago
2000
Springer
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...
SETA
2004
Springer
13 years 11 months ago
2004
Springer
We study algebraic feedback shift registers (AFSRs) based on quotients of polynomial rings in several variables over a finite field. These registers are natural generalizations o...
ISSAC
2007
Springer
14 years 9 days ago
2007
Springer
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
ICC
2007
IEEE
14 years 14 days ago
2007
IEEE
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...