Sciweavers

223 search results - page 18 / 45
» Multivariates Polynomials for Hashing
Sort
View
132
Voted
MP
2010
172views more  MP 2010»
15 years 1 months ago
Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...
Simai He, Zhening Li, Shuzhong Zhang
110
Voted
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
15 years 8 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
128
Voted
CRYPTO
2000
Springer
124views Cryptology» more  CRYPTO 2000»
15 years 7 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
123
Voted
AES
2004
Springer
139views Cryptology» more  AES 2004»
15 years 8 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
106
Voted
ISSAC
1999
Springer
116views Mathematics» more  ISSAC 1999»
15 years 7 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