Random numbers are widely employed in cryptography and security applications. If the generation process is weak, whole chain of can be compromised: these weaknesses could exploited by an attacker to retrieve information, breaking even most robust implementation a cipher. Due their intrinsic close relationship with analogue parameters circuit, True Number Generators usually tailored on specific ...

All graphs in this article are finite, undirected, without loops or multiple edges. Let G be a graph with vertices vl5 v2,..., vn. The complement in G of a subgraph H is the subgraph of G obtained by deleting all edges in H. The join GxvG2 of two graphs GY and G2 is obtained by adding an edge from each vertex in Gl to each vertex in G2. Let Kn be the complete graph and Pn the path on n vertices...

The generalized Fibonacci cube Qh(f) is the graph obtained from the h-cube Qh by removing all vertices that contain a given binary string f as a substring. In particular, the vertex set of the 3rd order generalized Fibonacci cube Qh(111) is the set of all binary strings b1b2 . . . bh containing no three consecutive 1’s. We present a new characterization of the 3rd order generalized Fibonacci cu...

A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized asymptotic operation costs. An unaesthetic aspect of Fibonacci heaps is that they must maintain a “mark bit” which serves only to ensure efficiency of heap operations, not their correctness. Karger proposed a simple randomized variant of Fibonacci heaps in which mark bits are replaced by coin...

Considering the five periods and six qi's theory in TCM almost shares a common basis of stem-branch system with the five elements of containing notes, studying the principle or mathematical structure behind the five elements of containing notes can surely bring a novel view for the five periods and six qi's researches. By analyzing typical mathematical rules included in He tu, Luo shu, and stem...

We exhibit and study various regularity properties of the sequence (R(n))n 1 which counts the number of different representations of the positive integer n in the Fibonacci numeration system. The regularity properties in question are observed by representing the sequence as a two-dimensional array consisting of an infinite number of rows L1, L2, L3, . . . where each Lk contains fk−1 (the k − 1s...