True Random Number Generator Circuit Designs

• Main Authors: Ming-Che Lee, 李明哲
• Other Authors: Tsin-Yuan Chang
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/38313599152176219850

碩士 === 國立清華大學 === 電機工程學系 === 90 === As the government, the business, and many personal users are gradually adopting the electronic methods to store information, information security has been a highly noticed important issue. Among all the methods that can provide information security, cryptographic systems provide the maximum flexibility and safety. In a cryptographic system, there are some essential, safety-related initial values, public keys, and private keys needed to be generated. Because these values have something to do with the security of the whole cryptographic system, they need to be random and unpredictable. A random number generator is applied to generate these randomly produced (not calculated) values. Generally speaking, the security of a cryptographic system relies mainly on the goodness of both the algorithm and the random number generator. In order to cooperate with the ACP/NP project, we tried to implement three different kinds of true random number generators. As for Discrete-Time Chaos method, we mentioned the problems that might occur when designing the circuit and proposed ways to solve them. Because we use analog circuit to implement a mathematically well-behaved equation, the simulation results can pass all the requirements for random data defined in “Security Requirements for Cryptographic Modules, FIPS PUB 140-2”, which is proposed by NIST (National Institute of Standards and Technology) in 2001. As for Oscillator Sampling method, we proposed a circuit that can increase the phase noise and a compensation method in case the outputs cannot pass the requirements for random data. As for the Pure Digital Circuit method, we concluded that this method is not practical in real case according to our drawing the layout and running the post simulation of the circuit.