منابع مشابه
Time - Memory - Processor Trade - offs HAMID
-It is demonstrated that usual time-memory trade-offs offer no asymptotic advantage over exhaustive search. Instead, trade-offs between time, memory, and parallel processing are proposed. Using this approach it is shown that most searching problems allow a trade-off between C,, the cost per solution, and C,,,, the cost of the machine: doubling C,,, increases the solution rate by a factor of fou...
متن کاملTime-Memory Trade-Offs for Near-Collisions
In this work we consider generic algorithms to find nearcollisions for a hash function. If we consider only hash computations, it is easy to compute a lower-bound for the complexity of near-collision algorithms, and to build a matching algorithm. However, this algorithm needs a lot of memory, and makes more than 2 memory accesses. Recently, several algorithms have been proposed without this mem...
متن کاملArchitecture Technique Trade-Offs Using Mean Memory Delay Time
Many architecture features are available for improving the performance of a cache-based system. These hardware techniques include cache memories, processor stalling characteristics, memory cycle time, the external data bus width of a processor, and pipelined memory system, etc. Each of these techniques affects the cost, design, and performance of a system. We present a powerful approach to asse...
متن کاملTime-Memory Trade-Offs: False Alarm Detection Using Checkpoints
Since the original publication of Martin Hellman’s cryptanalytic time-memory trade-off, a few improvements on the method have been suggested. In all these variants, the cryptanalysis time decreases with the square of the available memory. However, a large amount of work is wasted during the cryptanalysis process due to so-called “false alarms”. In this paper we present a method of detection of ...
متن کاملTime-memory trade-offs for index calculus in genus 3
In this paper, we present a variant of Diem’s Õ(q) index calculus algorithm to attack the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a finite field Fq. We implement this new variant in C++ and study the complexity in both theory and practice, making the logarithmic factors and constants hidden in the Õ-notation precise. Our variant improves the comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1988
ISSN: 0018-9448
DOI: 10.1109/18.6030