Sciweavers

694 search results - page 1 / 139
» The Power of the Middle Bit
Sort
View
70
Voted
COCO
1992
Springer
114views Algorithms» more  COCO 1992»
15 years 2 months ago
The Power of the Middle Bit
Frederic Green, Johannes Köbler, Jacobo Tor&a...
IMECS
2007
14 years 11 months ago
Low Power Bus Encoding Technique Considering Coupling Effects
— In this paper, we propose a bus encoding scheme to minimize coupling effects which cause significant power consumption in the on-chip interconnects. The proposed bus encoding s...
H. W. Lin, K. C. Wei
PKC
2010
Springer
126views Cryptology» more  PKC 2010»
15 years 2 days ago
Implicit Factoring with Shared Most Significant and Middle Bits
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
Jean-Charles Faugère, Raphaël Marinier...
COCO
2005
Springer
80views Algorithms» more  COCO 2005»
15 years 3 months ago
New Results on the Complexity of the Middle Bit of Multiplication
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...
Ingo Wegener, Philipp Woelfel
134
Voted
ISPEC
2011
Springer
14 years 1 months ago
Meet-in-the-Middle Attack on 8 Rounds of the AES Block Cipher under 192 Key Bits
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 ...
Yongzhuang Wei, Jiqiang Lu, Yupu Hu