172 search results - page 8 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
ASIACRYPT
2005
Springer
15 years 5 months ago
2005
Springer
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 ...
104
click to vote
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Enhanced Data Rates for Global Evolution (EDGE) based systems are expected to facilitate the same services as third generation WCDMA systems. This goal is achieved through phys...
130
click to vote
TASLP
2011
14 years 6 months ago
2011
Abstract—The shifted delta cepstrum (SDC) is a widely used feature extraction for language recognition (LRE). With a high context width due to incorporation of multiple frames, S...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
A construction of expander codes is presented with the following three properties: (i) the codes lie close to the Singleton bound, (ii) they can be encoded in time complexity that ...