Complete Graph Random Number Generator and Symmetrical Design Scheme

One-time pad consists of a set of theoretically infinite random numbers. However, in practice, one-time pad is difficult to achieve. This is because modern computers can not generate non-deterministic code stream sequences. In this paper, we proposed a complete graph-based random number generator. It is convenient to implement and takes very little resource. It is a method that is very close to one-time pad in term of form. Based on the research results, we also designed a symmetric encryption scheme.