15 search results - page 1 / 3 » Results on Algebraic Immunity for Cryptographically Signific... |
INDOCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
TIT
2008
13 years 4 months ago
2008
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
DAGSTUHL
2006
13 years 6 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. One of the most basic requirements concerning Boolean functions used in cryptosystems is that they must have high algebraic degrees. This simple criterion is not always w...
FSE
2004
Springer
13 years 10 months ago
2004
Springer
Recent research shows that the class of Rotation Symmetric Boolean Functions (RSBFs), i.e., the class of Boolean functions that are invariant under circular translation of indices,...