Sciweavers

1379 search results - page 1 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
CANS
2009
Springer
164views Cryptology» more  CANS 2009»
14 years 5 months ago
Extensions of the Cube Attack Based on Low Degree Annihilators
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...
Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei We...
ICIP
2005
IEEE
15 years 15 days ago
Sampling schemes for 2-D signals with finite rate of innovation using kernels that reproduce polynomials
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....
Pancham Shukla, Pier Luigi Dragotti
DCC
2006
IEEE
14 years 10 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
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...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
PKC
2009
Springer
102views Cryptology» more  PKC 2009»
14 years 11 months ago
A Practical Key Recovery Attack on Basic TCHo
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...
Mathias Herrmann, Gregor Leander