In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...

This paper rearranges a key property of anytime algorithms to derive a technique that determines an admissible lower bound on the minimum solution cost. In conjunction with a class of performance metric known as ‘time-focussed metrics’, the technique can be used to determine when to abort the deflation process within an anytime planning algorithm. The aim of this paper is to exploit this techni...

Network latency can have a significant impact on the performance of transactional storage systems, particularly in wide area or geo-distributed deployments. To reduce latency, systems typically rely on a cache to service read-requests closer to the client. However, caches are not effective for write-heavy workloads, which have to be processed by the storage system in order to maintain serializa...

This paper shows, assuming standard heuristics regarding the number-field sieve, that a “batch NFS” circuit of area L factors L separate B-bit RSA keys in time L. Here L = exp((log 2)(log log 2)). The circuit’s area-time product (priceperformance ratio) is just L per key. For comparison, the best area-time product known for a single key is L. This paper also introduces new “early-abort” heurist...

In transactional memory, conflicts between two concurrently executing transactions reduce performance, reduce scalability, and may lead to aborts, which waste computing resources. Ideally, concurrent execution of transactions would be ordered to minimise conflicts, but such an ordering is often complex, or unfeasible, to obtain. This paper identifies a pattern, called repeat conflicts, that can...

In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered to minimise aborts, but such an ordering is often either complex, or unfeasible, to obtain. This paper introduces a new technique called steal-on-abort, which aims to improve transaction ordering at runtime. Suppose transactio...