Attacks on cryptosystem implementations (e.g. security fault injection, timing analysis and differential power analysis) are amongst the most exciting developments in cryptanalysis of the past decade. Altering the internal state of a cryptosystem or profiling the system’s computational dynamics can be used to gain a huge amount of information. This paper shows how fault injection and timing ana...

In this paper, we present a new method for verifying the realizability of a timing diagram with linear timing constraints, thus ensuring that the implementation of the underlying interface is feasible. The method is based on the consistency of the timing constraints derived from the timing diagram and accepts unknown occurrence times for events produced by the environment.

This work introduces capacity limits for molecular timing (MT) channels, where information is modulated on the release timing of small information particles, and decoded from the time of arrival at the receiver. It is shown that the random time of arrival can be represented as an additive noise channel, and for the diffusion-based MT (DBMT) channel this noise is distributed according to the Lév...

Replication origins in Xenopus egg extracts are located at apparently random sequences but are activated in clusters that fire at different times during S phase under the control of ATR/ATM kinases. We investigated whether chromosomal domains and single sequences replicate at distinct times during S phase in egg extracts. Replication foci were found to progressively appear during early S phase ...

The current trend of hard drives rapidly increasing in capacity presents a challenge regarding the expedient analysis of digital evidence. Forensic investigators must sift through enormous amounts of data to discover information useful to an investigation. However, before this analysis can be conducted, and authenticated working copy of the suspect hard drive must be obtained. With the size of ...

A compound exponential-server timing channel consists of a number of infinite-buffer single-server queues in tandem. The message is coded in the sequence of arrival times to the first queue. We consider the performance of a structurally simple mismatch decoder that is the maximumlikelihood decoder for a single queue.

BACKGROUND Determining the exact timing of reward delivery is critical in neurophysiological experiments. Despite the importance of this parameter, techniques for precisely measuring the exact delivery time of a liquid reward have been underdeveloped. Although there is always some latency between the computer command and reward delivery, the former has been used routinely to mark reward onset t...

Post-silicon tuning is attracting a lot of attention for coping with increasing process variation. However, its tuning cost via testing is still a crucial problem. In this paper, we propose tuning-friendly body bias clustering with multiple bias voltages. The proposed method provides a small set of compensation levels so that the speed and leakage current vary monotonically according to the lev...

The capacity region of the two-user Gaussian CDMA channel is shown to be achievable when the (stationary, ergodic) noise is not Gaussian, using a decoder matched to the Gaussian distribution. Similarly, the capacity of the exponential server timing channel is shown to be achievable when the service distribution is not exponential, using a decoder matched to the exponential distribution. The cod...