Sciweavers

506 search results - page 51 / 102
» The Block Cipher Square
Sort
View
117
Voted
ASIACRYPT
2005
Springer
15 years 8 months ago
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
Alexander Maximov, Thomas Johansson
AFRICACRYPT
2008
Springer
15 years 9 months ago
Improving Integral Attacks Against Rijndael-256 Up to 9 Rounds
Rijndael is a block cipher designed by V. Rijmen and J. Daemen and it was chosen in its 128-bit block version as AES by the NIST in October 2000. Three key lengths - 128, 192 or 25...
Samuel Galice, Marine Minier
138
Voted
ASIACRYPT
2004
Springer
15 years 8 months ago
Eliminating Random Permutation Oracles in the Even-Mansour Cipher
Abstract. Even and Mansour [EM97] proposed a block cipher construction that takes a publicly computable random permutation oracle P and XORs different keys prior to and after appl...
Craig Gentry, Zulfikar Ramzan
106
Voted
TIT
2002
146views more  TIT 2002»
15 years 2 months ago
Least squares estimation of 2-D sinusoids in colored noise: Asymptotic analysis
This paper considers the problem of estimating the parameters of real-valued two-dimensional (2-D) sinusoidal signals observed in colored noise. This problem is a special case of t...
Guy Cohen, Joseph M. Francos
101
Voted
COMBINATORICS
2000
74views more  COMBINATORICS 2000»
15 years 2 months ago
Frequency Squares and Affine Designs
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
Vassili C. Mavron