17 search results - page 3 / 4 » Security on Generalized Feistel Scheme with SP Round Functio... |
CRYPTO
2008
Springer
14 years 11 months ago
2008
Springer
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al. showed...
CTRSA
2003
Springer
15 years 2 months ago
2003
Springer
In this paper, we present a general framework for evaluating the performance characteristics of block cipher structures composed of S-boxes and Maximum Distance Separable (MDS) ma...
108
click to vote
IWSEC
2009
Springer
15 years 4 months ago
2009
Springer
Impossible boomerang attack [5] (IBA) is a new variant of differential cryptanalysis against block ciphers. Evident from its name, it combines the ideas of both impossible differ...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
102
click to vote
CRYPTO
2007
Springer
15 years 3 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...