Sciweavers

188 search results - page 19 / 38
» A multivariate interlace polynomial
Sort
View
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
14 years 1 months ago
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
Michael B. Monagan, Roman Pearce
CRYPTO
2000
Springer
124views Cryptology» more  CRYPTO 2000»
13 years 12 months ago
Fast Correlation Attacks through Reconstruction of Linear Polynomials
The task of a fast correlation attack is to efficiently restore the initial content of a linear feedback shift register in a stream cipher using a detected correlation with the out...
Thomas Johansson, Fredrik Jönsson
AES
2004
Springer
139views Cryptology» more  AES 2004»
14 years 1 months ago
The Inverse S-Box, Non-linear Polynomial Relations and Cryptanalysis of Block Ciphers
This paper is motivated by the design of AES. We consider a broader question of cryptanalysis of block ciphers having very good non-linearity and diffusion. Can we expect anyway, ...
Nicolas Courtois
ISSAC
1999
Springer
116views Mathematics» more  ISSAC 1999»
13 years 12 months ago
On the Genericity of the Modular Polynomial GCD Algorithm
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
Erich Kaltofen, Michael B. Monagan
IPPS
1997
IEEE
13 years 12 months ago
Fast Parallel Computation of the Polynomial Shift
Given an n-degree polynomial fx over an arbitrary ring, the shift of fx by c is the operation which computes coefficients of the polynomial fx + c. In this paper we conside...
Eugene V. Zima