A DCC (disjoint consecutive cycles) linear congruential graph G(F,n) consists of n nodes and is generated by a set of linear functions F with special properties. It was proved that G(F,n) is a 2t-regular graph and has connectivity 2t, where t 1⁄4 jFj and 1 6 t 6 p 1 (n 1⁄4 2 for some integer p). For a multiprocessor system, its diagnosability is critical to measure the performance. In this pape...

Abstract Plasma generator is a key component of electrothermal chemical gun. Its function to produce plasma under the action high pulse current and enhance combustion characteristics propellant, thus improving launch efficiency muzzle velocity. The structural properties are related its discharge characteristics, internal pressure, jet etc. This paper studies strength property capillary working ...

In this paper, we specify a class of mathematical problems, which we refer to as “Function Density Problems” (FDPs, in short), and point out novel connections of FDPs to the following two cryptographic topics; theoretical security evaluations of keyless hash functions (such as SHA-1), and constructions of provably secure pseudorandom generators (PRGs) with some enhanced security property introd...

In a seminal paper, H̊astad, Impagliazzo, Levin, and Luby showed that pseudorandom generators exist if and only if one-way functions exist. The construction they propose to obtain a pseudorandom generator from an n-bit one-way function uses O(n) random bits in the input (which is the most important complexity measure of such a construction). In this work we study how much this can be reduced if ...

Hadron production in the LEPTO event generator is modeled as a product of distribution functions and LUND hadronization functions (LHFs) weighted by the hard scattering cross sections. The description of polarized SIDIS within this formalism includes a new nonperturbative input – polarized LHFs. It is shown that this approach does not correspond to the commonly adopted one with the independent ...

MQ—DRBG is a pseudorandom number bit generator proposed for international standardization by the French national organization for Standardization (AFNOR). It makes use of a specific instantiation of a one-way function S : F2 → F 2 based on quadratic multivariate polynomials. We describe two methods for constructing function S, satisfying requirements of the proposed draft, but having less secur...

In 1989, Babai, Nisan and Szegedy [BNS92] gave a construction of a pseudorandom generator for logspace, based on lower bounds for multiparty communication complexity. The seed length of their pseudorandom generator was 2 √ , because the best lower bounds for multiparty communication complexity are relatively weak. Subsequently, pseudorandom generators for logspace with seed length O(log n) were...

Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other cryptographically popular groups. As the first step to put the braid groups into the area of pseudorandomness, this article presents some cryptographic primitives under two related assumptions in braid groups. First, ...