1379 search results - page 1 / 276 » The Complexity of the Annihilating Polynomial |
53
Voted
COCO
2009
Springer
15 years 4 months ago
2009
Springer
CANS
2009
Springer
15 years 4 months ago
2009
Springer
At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an ini...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
PKC
2009
Springer
15 years 10 months ago
2009
Springer
TCHo is a public key encryption scheme based on a stream cipher component, which is particular suitable for low cost devices like RFIDs. In its basic version, TCHo offers no IND-CC...