Sciweavers

287 search results - page 15 / 58
» On the Complexity of Register Coalescing
Sort
View
WISA
2007
Springer
14 years 1 months ago
A Compact Architecture for Montgomery Elliptic Curve Scalar Multiplication Processor
We propose a compact architecture of a Montgomery elliptic curve scalar multiplier in a projective coordinate system over GF(2m ). To minimize the gate area of the architecture, we...
Yong Ki Lee, Ingrid Verbauwhede
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
13 years 11 months ago
Finding reset nondeterminism in RTL designs - scalable X-analysis methodology and case study
Due to increases in design complexity, routing a reset signal to all registers is becoming more difficult. One way to solve this problem is to reset only certain registers and rely...
Hong-Zu Chou, Haiqian Yu, Kai-Hui Chang, Dylan Dob...
PODC
2004
ACM
14 years 29 days ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
FSE
2006
Springer
99views Cryptology» more  FSE 2006»
13 years 11 months ago
Reducing the Space Complexity of BDD-Based Attacks on Keystream Generators
The main application of stream ciphers is online-encryption of arbitrarily long data, for example when transmitting speech data between a Bluetooth headset and a mobile GSM phone o...
Matthias Krause, Dirk Stegemann
FSE
2006
Springer
95views Cryptology» more  FSE 2006»
13 years 11 months ago
Cryptanalysis of Achterbahn
We present several attacks against Achterbahn, one of the new stream ciphers proposed to the eSTREAM competition. Our best attack breaks the reduced version of the cipher with comp...
Thomas Johansson, Willi Meier, Frédé...