172 search results - page 5 / 35 » Improving the Time Complexity of Matsui's Linear Cryptanalys... |
145
click to vote
JOC
2008
15 years 6 months ago
2008
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
185
click to vote
FCCM
2006
IEEE
16 years 15 hour ago
2006
IEEE
This paper presents a hardware-optimized variant of the well-known Gaussian elimination over GF(2) and its highly efficient implementation. The proposed hardware architecture, we...
182
click to vote
EUROCRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
190
click to vote
CCECE
2006
IEEE
16 years 22 hour ago
2006
IEEE
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
147
click to vote
ASIACRYPT
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. AES is the most widely used block cipher today, and its security is one of the most important issues in cryptanalysis. After 13 years of analysis, related-key attacks wer...