In this paper we designed a new type of Random number generator by using shift registers and LUT with D-FF as input to it. The algorithm used to generate random numbers is realized using simple xor circuit and implemented on a Virtex II FPGA from Xilinx. This designed block indicate a good sequence of random numbers which is used in high-speed data processor, Testing Instruments, Finding Laser ...

Problem 2. (a) For any ring R, define a ring structure on the abelian group R̃ = R×Z such that (0, 1) is the identity of R̃ and the inclusion map R ↪→ R̃, r 7→ (r, 0) is a rng homomorphism. (b) Let C be the category of rings without identity. Show that the functor F : C → Rings such that F (R) = R̃ is a left adjoint to the forgetful functor G : Rings→ C taking a ring with identity R to R considered...

Various graph-theoretic definitions of neighborhood have been used in the past in computer vision and clustering applications. In this paper we study the properties of a set of four related closest-point graphs using Monte Carlo methods: (i) the Delaunay Triangulation (DT) and its dual, Voronoi tessellation, (ii) the Gabriel Graph (GG), (iii) the Relative Neighborhood Graph (RNG), and (iv) the ...

We all know the solution: multiplication is always assumed to have precedence over addition, so we read this as a+ (b · c). 1.2. Remark. A ring without identity is one in which (R, ·) is merely assumed to be a semi-group, i.e., there is no multiplicative identity. (Some people call this a rng.) In many introductory textbooks, “ring” is defined to mean what we are calling a “ring without identit...

Vortex shedding from a circular cylinder and from an inclined flat plate is computed with a finite volume CFD code with RNG k-ε turbulence model. The wake behind the circular cylinder consists of two trains of vortices of equal strengths. Dependence of vortex patterns on Reynolds numbers at Re between 10 and 10 is investigated. Flow over the inclined flat plate is asymmetric and unequal charact...

A high-speed random number generator (RNG) circuit based on magnetoresistive random-access memory (MRAM) using an error-correcting code (ECC) post processing circuit is presented. ECC post processing increases the quality of randomness by increasing the entropy of random number. We experimentally show that a small error-correcting capability circuit is sufficient for this post processing. It is...

Physical Unclonable Functions (PUFs) are widely used to generate random Numbers. In this paper we propose a new architecture in which an Arbiter Based PUF has been employed as a nonlinear function in Nonlinear Feedback Shift Register (NFSR) to generate true random numbers. The rate of producing the output bit streams is 10 million bits per second. The proposed RNG is able to pass all NIST tests...

The increased functionality of EPC Class1 Gen2 (EPCGen2) is making this standard a de facto specification for inexpensive tags in the RFID industry. Recently three EPCGen2 compliant protocols that address security issues were proposed in the literature. In this paper we analyze these protocols and show that they are not secure and subject to replay/impersonation and statistical analysis attacks...

Proximity graphs have been widely used in the area of computational geometry; through a vicinity concept these graphs establish relations of similarity between elements of a set. In this paper we propose the use of Relative Neighborhood Graph (RNG) in metric spaces in order to efficiently answer similarity queries. Additionally we introduce a new algorithm for range queries and nearest neighbor...

Topology control in wireless sensor networks is an important issue for scalability and energy efficiency. It is often based on graph reduction performed through the use of Gabriel Graph or Relative Neighborhood Graph. This graph reduction is usually based on geometric values. In this paper we tackle the problem of possible connectivity loss in the reduced graph by applying a battery level based...