Sciweavers

223 search results - page 14 / 45
» Multivariates Polynomials for Hashing
Sort
View
JSC
2006
76views more  JSC 2006»
15 years 2 months ago
Fast computation of special resultants
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
Alin Bostan, Philippe Flajolet, Bruno Salvy, &Eacu...
121
Voted
ICCAD
2005
IEEE
160views Hardware» more  ICCAD 2005»
15 years 11 months ago
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
Namrata Shekhar, Priyank Kalla, Florian Enescu, Si...
107
Voted
ADCM
2004
58views more  ADCM 2004»
15 years 2 months ago
Classification of Bivariate Configurations with Simple Lagrange Interpolation Formulae
In 1977 Chung and Yao introduced a geometric characterization in multivariate interpolation in order to identify distributions of points such that the Lagrange functions are produc...
Jesús M. Carnicer, Mariano Gasca
CHES
2004
Springer
135views Cryptology» more  CHES 2004»
15 years 8 months ago
TTS: High-Speed Signatures on a Low-Cost Smart Card
TTS is a genre of multivariate digital signature schemes first proposed in 2002. Its public map is composed of two affine maps sandwiching a Tame Map, which is a map invertible t...
Bo-Yin Yang, Jiun-Ming Chen, Yen-Hung Chen
114
Voted
CSJM
2008
126views more  CSJM 2008»
15 years 2 months ago
Private Key Extension of Polly Cracker Cryptosystems
In 1993 Koblitz and Fellows proposed a public key cryptosystem, Polly Cracker, based on the problem of solving multivariate systems of polynomial equations, which was soon general...
Nina Taslaman