Sciweavers

223 search results - page 34 / 45
» Multivariates Polynomials for Hashing
Sort
View
122
Voted
HYBRID
2010
Springer
15 years 9 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
106
Voted
ICASSP
2009
IEEE
15 years 9 months ago
Instantaneous frequency rate estimation for high-order polynomial-phase signal
—Instantaneous frequency rate (IFR) estimation for high-order polynomial phase signals (PPSs) is considered. Specifically, an IFR estimator with only a second-order nonlinearity ...
Pu Wang, Hongbin Li, Igor Djurovic, Jianyu Yang
127
Voted
TCC
2005
Springer
132views Cryptology» more  TCC 2005»
15 years 8 months ago
Evaluating 2-DNF Formulas on Ciphertexts
Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an en...
Dan Boneh, Eu-Jin Goh, Kobbi Nissim
118
Voted
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
15 years 6 months ago
On the Complexity of Boolean Functions in Different Characteristics
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
Parikshit Gopalan, Shachar Lovett, Amir Shpilka
ICISC
2007
125views Cryptology» more  ICISC 2007»
15 years 4 months ago
A Cryptanalysis of the Double-Round Quadratic Cryptosystem
In the 80’s Matsumoto and Imai [8] proposed public key cryptosystems based on the difficulty of solving systems of polynomials in several variables. Although these first schemes...
Antoine Scemama