Most stream ciphers used in practice are vulnerable against generic collision attacks, which allow to compute the secret initial state on the basis of O(2) keystream bits in time and space O(2), where n denotes the inner state length of the underlying keystream generator. This implies the well-known rule that for reaching n-bit security, the inner state length should be at least 2n. Correspondi...

Arithmetic function modules which are available in many circuits can be utilized to generate test patterns and compact test responses. Recently, it was shown that an adder or an accumulator cannot be used as a bit serial test pattern generator due to the poor random properties of the generated sequences. Thus, accumulator-multiplier or adder-multiplier structures have been proposed. In this pap...

This paper is on the security of a “true” random bit generator (RBG) based on a double-scroll attractor. A clone system is proposed to analyze the security weaknesses of the RBG and its convergence is proved using master slave synchronization scheme. All secret parameters of the RBG are revealed where the only information available are the structure of the RBG and a scalar time series observed ...

The ZK-Crypt combination compact hardware stream cipher engines each include a true random number generator, a stream cipher and a data authenticator based on a fast compact engine and proven "noise sources". The ZK-Crypt II 7.0 K gate and ZK-Crypt 8.2 K gate "engines" output a 32 bit word at each clock cycle with 128 and 160-bit keys, maximizing throughput with very low energy per enciphered b...

In this paper we present a large array of SPADs and we discuss its suitability for applications different than imaging, exploring in particular how to transform it into a high speed True Random Number Generator (TRNG). The proposed matrix comprises 512x128 independent cells that convert photons into a raw bit-stream, which, as ensured by the properties of quantum physics, is characterized by a ...

In recent years, a variety of chaos-based cryptosystems have been proposed. Some of these systems are used in designing a pseudo random bit generator (PRBG) for stream cipher applications. Most of the chaotic systems used in cryptography have good chaotic properties like ergodicity, sensitivity to initial values and sensitivity to control parameters. However, some of them are not very suitable ...

Definition: (See Goldreich, section 3.6.4.2 .) A function generator F with unbounded inputs associates with each n bit key k ∈ {0, 1} a function Fk : {0, 1}∗ → {0, 1}. We insist that Fk(x) be computable in time polynomial in the lengths of k and x. By pseudo-random for such a generator, we mean the obvious thing: the Distinguisher adversary D is given a function f : {0, 1}∗ → {0, 1} and can que...

Definition: (See Goldreich, section 3.6.4.2 .) A function generator F with unbounded inputs associates with each n bit key k ∈ {0, 1} a function Fk : {0, 1}∗ → {0, 1}. We insist that Fk(x) be computable in time polynomial in the lengths of k and x. By pseudo-random for such a generator, we mean the obvious thing: the Distinguisher adversary D is given a function f : {0, 1}∗ → {0, 1} and can que...

The standard approach for constructing a large-stretch pseudorandom generator given a one-way permutation or given a smaller-stretch pseudo-random generator involves repeatedly composing the given primitive with itself. In this paper, we consider whether this approach is necessary, that is, whether there are constructions that do not involve composition. More formally, we consider black-box con...

Title of dissertation: OPTOELECTRONIC EXPERIMENTS ON RANDOM BIT GENERATORS AND COUPLED DYNAMICAL SYSTEMS Caitlin Rose Sanford Williams Doctor of Philosophy, 2013 Dissertation directed by: Professor Rajarshi Roy Department of Physics Optoelectronic systems have many important applications, and they have become ubiquitous in the contexts of communications and sensing. In recent years, optical and...