The asynchronous systems are the models of the asynchronous circuits from the digital electrical engineering. An asynchronous system f is a multi-valued function that assigns to each admissible input u : R → {0, 1}m a set f(u) of possible states x ∈ f(u), x : R → {0, 1}n. A special case of asynchronous system consists in the existence of a Boolean function Υ : {0, 1}n × {0, 1}m → {0, 1}n such t...

There are three standard methods for generating two channels of partially correlated noise: the two-generator method, the three-generator method, and the symmetric-generator method. These methods allow an experimenter to specify a target cross correlation between the two channels, but actual generated noises show statistical variability around the target value. Numerical experiments were done t...

A constrained pseudorandom function (PRF) is a secure PRF for which one can generate constrained keys that can only be used to evaluate the PRF on a subset of the domain. Constrained PRFs are used widely, most notably in applications of indistinguishability obfuscation (iO). In this paper we show how to constrain an invertible PRF (IPF), which is significantly harder. An IPF is a secure injecti...

Given d independent pseudorandom permutations (PRPs) πi, . . . , πd over {0, 1} , it appears natural to define a pseudorandom function (PRF) by adding (or XORing) the permutation results: sum(x) = π1(x)⊕· · ·⊕πd(x). This paper investigates the security of sum d and also considers a variant that only uses one single PRP over {0, 1}.

In this paper we present an efficient and secure generic method which can encrypt messages of size at least n. This generic encryption algorithm needs a secure encryption algorithm for messages of multiple of n. The first generic construction, XLS, has been proposed by Ristenpart and Rogaway in FSE-07. It needs two extra invocations of an independently chosen strong pseudorandom permutation or ...

We characterize, in terms of the Beurling-Malliavin density, the discrete spectra Λ ⊂ R for which a generator exists, that is a function φ ∈ L(R) such that its Λ-translates φ(x − λ), λ ∈ Λ, span L(R). It is shown that these spectra coincide with the uniqueness sets for certain analytic classes. We also present examples of discrete spectra Λ ⊂ R which do not admit a single generator while they a...

a critical protection requirement for grid connected distributed generators (dg) is anti-islanding protection. in this paper, a new islanding detection method for any possible network loading is proposed based on utilizing and combining various system parameter indices. in order to secure the detection of islanding, eight intentional disturbances are imposed to the system under study in which t...

In this paper, we show that many formal and informal security results on distance-bounding (DB) protocols are incorrect/ incomplete. We identify that this inadequacy stems from the fact that the pseudorandom function (PRF) assumption alone, invoked in many security claims, is insufficient. To this end, we identify two distinct shortcomings of invoking the PRF assumption alone: one leads to dist...

One of the major health challenges of the future is Chronic Obstructive Pulmonary Disease (COPD). It is characterized by airflow limitations, although current diagnosis does not give attention to the flow measurements. We aimed to develop a data-based model of the decline of the forced expiratory flow. Moreover, we analysed the relationship of model parameters with COPD presence and its severit...

The significance of understanding blockcipher security in the multi-key setting is highlighted by the extensive literature on attacks, and how effective key size can be significantly reduced. Nevertheless, little attention has been paid in formally understanding the design of multi-key secure blockciphers. In this work, we formalize the multi-key security of tweakable blockciphers in case of ge...