532 search results - page 1 / 107 » New Results on the Complexity of the Middle Bit of Multiplic... |
COCO
2005
Springer
13 years 10 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
ISPEC
2011
Springer
12 years 7 months ago
2011
Springer
The AES block cipher has a 128-bit block length and a user key of 128, 192 or 256 bits, released by NIST for data encryption in the USA; it became an ISO international standard in ...
ASIACRYPT
2010
Springer
13 years 2 months ago
2010
Springer
We revisit narrow-pipe designs that are in practical use, and their security against preimage attacks. Our results are the best known preimage attacks on Tiger, MD4, and reduced SH...
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
IACR
2011
12 years 4 months ago
2011
The block cipher family for lightweight devices, KTANTAN, is analyzed in this paper. We propose a new cryptanalysis method which improves results of Meet-in-the-Middle attacks on K...