Sciweavers

610 search results - page 18 / 122
» Fast Modular Reduction
Sort
View
120
Voted
DC
2006
15 years 25 days ago
Fast Paxos
Abstract. Paxos and Fast Paxos are optimal consensus algorithms that are simple and elegant, while suitable for efficient implementation. In this paper, we compare the performance ...
Leslie Lamport
114
Voted
IACR
2011
135views more  IACR 2011»
14 years 13 days ago
Algebraic Complexity Reduction and Cryptanalysis of GOST
Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. Its large key size of 256 bits at a particularly low implementa...
Nicolas Courtois
127
Voted
ASIACRYPT
2006
Springer
15 years 4 months ago
On the (In)security of Stream Ciphers Based on Arrays and Modular Addition
Abstract. Stream ciphers play an important role in symmetric cryptology because of their suitability in high speed applications where block ciphers fall short. A large number of fa...
Souradyuti Paul, Bart Preneel
124
Voted
IJSI
2008
109views more  IJSI 2008»
15 years 24 days ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
VLSID
2003
IEEE
180views VLSI» more  VLSID 2003»
16 years 1 months ago
Automating Formal Modular Verification of Asynchronous Real-Time Embedded Systems
Most verification tools and methodologies such as model checking, equivalence checking, hardware verification, software verification, and hardware-software coverification often fl...
Pao-Ann Hsiung, Shu-Yu Cheng