T–functions are a new class of primitives which have recently been introduced by Klimov and Shamir. The several concrete proposals by the authors have multiplication and squaring as core nonlinear operations. Firstly, we present time-memory trade-off algorithms to solve the problems related to multiplication and squaring. Secondly, we apply these algorithms to two of the proposals of multi-word...

Enumeration algorithms in lattices are a well-known technique for solving the Short Vector Problem (SVP) and improving blockwise lattice reduction algorithms. Here, we propose a new algorithm for enumerating lattice point in a ball of radius 1.156λ1(Λ) in time 3n+o(n), where λ1(Λ) is the length of the shortest vector in the lattice Λ. Then, we show how this method can be used for solving SVP an...

When the processing times of jobs are controllable, selected processing times affect both themanufacturing cost and the scheduling performance.Awell-known example for such a case that this paper specifically deals with is the turning operation on a CNCmachine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. We also know that scheduling decisions ...

In 1980, Hellman introduced a time/memory trade-off (TMTO) algorithm satisfying the TMTO curve TM = N, where T is the online time, M is the memory and N is the size of the search space. Later work by Biryukov-Shamir incorporated multiple data to obtain the curve TMD = N, where D is the number of data points. In this paper, we describe a new table structure obtained by combining Hellman’s struct...

Discrete event simulation is a methodology to study the behavior of complex systems. Its drawback is that, in order to get reliable results, simulations have to be usually run over a long stretch of time. This time requirement could decrease through the usage of parallel or distributed computing systems. In this paper we analyze the Time Warp synchronization protocol for parallel discrete event...

This paper tests the internal consistency of time trade-off utilities. We find significant violations of consistency in the direction predicted by loss aversion. The violations disappear for higher gauge durations. We show that loss aversion can also explain that for short gauge durations time trade-off utilities exceed standard gamble utilities. Our results suggest that time trade-off measurem...

OBJECTIVE To evaluate community-based values for avoiding pandemic influenza (A) H1N1 (pH1N1) illness and vaccination-related adverse events in adults and children. METHODS Adult community members were randomly selected from a nationally representative research panel to complete an internet survey (response rate = 65%; n = 718). Respondents answered a series of time trade-off questions to val...

Introduced by Hellman, Time-Memory Trade-Off (TMTO) attacks offer a generic technique to reverse one-way functions, where one can trade off time and memory costs and which are especially effective against stream ciphers. Hellman’s original idea has seen many different improvements, notably the Distinguished Points attack and the Rainbow Table attack. The trade-off curves of these approaches hav...

Individuals do not have complete information about the environment and therefore they face a trade-off between gathering information (exploration) and gathering resources (exploitation). Studies have shown individual differences in components of this trade-off but how stable these strategies are in a population and the intrinsic drivers of these differences is not well understood. Top marine pr...