# US 2010/0146025 A1 · Method and hardware for generating random numbers using dual oscillator architecture and continuous-time chaos

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0146025 A1
- Document ID: US20100146025A1
- Status: Published application
- Kind: A1
- Application number: 12/601,453
- Filed: 2007-05-22
- Published: 2010-06-10
- Earliest claimed: 2007-05-22
- Assignees: Scientific & Technological Research Council of Turkey (Tubitak)
- Inventors: Salih Ergun
- Web page: https://patentgrep.com/patent/US20100146025A1

## CPC

- G06F 7/588: {Random number generators, i.e. based on natural stochastic processes}
- H03K 3/84: Generating pulses having a predetermined statistical distribution of a parameter, e.g. random pulse generators
- H04L 9/001: {using chaotic signals}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03K: PULSE TECHNIQUE (measuring pulse characteristics G01R; modulating sinusoidal oscillations with pulses H03C; transmission of digital information H04L; discriminator circuits detecting phase difference between two signals by counting or integrating cycles of oscillation H03D3/04; automatic control, starting, synchronisation or stabilisation of generators of electronic oscillations or pulses where the type of generator is irrelevant or unspecified H03L; coding, decoding or code conversion, in general H03M)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Novel random number generation methods and novel random number generators based on continuous-time chaotic oscillators with dual oscillator architecture are presented. Numerical and experimental results not only verify the feasibility of the proposed circuits, but also encourage their use as a high-performance IC TRNG. In comparison with RNG's based on discrete-time chaotic maps, amplification of a noise source and jittered oscillator sampling, which are advantageous in the sense that true random behavior can be mathematically proven thanks to an analytical model that has been developed, it is seen that RNG's based on continuous-time' chaotic oscillators can offer much higher and constant data rated without post-processing. The proposed innovation increases the throughput, maximizes the statistical quality of the output sequence and is robust against against external interference, parameter variations and attacks aimed to force throughout. The proposed circuits can be integrated on today process at GHz range.

## Claims

### Claim at position 1

1-8. (canceled)

### Claim 9 (depends on 9)

A method for generating binary random bits (SpoA);) which is based on dual oscillator architecture with the continuous-time chaotic oscillator and which relies on generating non-invertible random binary bits, from the one of the state which corresponds to one of the signal of the chaotic oscillator comprising the steps of;
(a) obtaining x1j, x2j, . . . or xnj values at the rising edges of an external periodical pulse signal by using one of the state x1, x2, . . . or xn of the chaotic oscillator, that is at times t satisfying fsH (x1(t), x2(t), . . . or xn(t)tmod2π=0 where fs is the center frequency of the slower clock and fsH( ) is the transfer function of a voltage-controlled oscillator (VCO) or a current-controlled oscillator (CCO).
(b) obtaining the slower clock periods Tslow1j, Tslow2j, . . . or Tslownj values by 1 I(fsH(x1j, x2j, . . . or xnj)).
(c) obtaining the sum of slower clock periods Tslow1j, Tslow2j, . . . or Tslownj values from j=1 to j=i.
(d) dividing the sum of slower clock periods defined in claim 9.c to Tfast/2 where Tfast is the period of the fast clock.
(e) performing mod2 (modulo 2 operator) operation on the division result defined in claim 9.d.
(f) generating random binary sequence
i. S(DOA)i, which is the logical inverse of the mod2 operation result defined in claim 9.e. or
ii. S(DOA)i, by S(DOA)i=S(DOA)(i-1), if the logical inverse of the mod2 operation result defined in claim 9.e is 0 and S(DOA)i=the logical inverse of S(DOA)(i-1), if the logical inverse of the mod2 operation result defined in claim 9.e is 1.

### Claim 10

A random bit generator which is based on dual oscillator architecture with the continuous-time chaotic oscillator and which relies on generating non-invertible random binary bits, from one of the signal of the chaotic oscillator consist of:
(a) a chaos-modulated slower clock where; a voltage-controlled oscillator (VCO) or a current-controlled oscillator (CCO) is used to implement the modulation of the slower clock frequency with one of the signal, which corresponds to one of the state (x1, x2, . . . or xn), of the continuous time chaotic oscillator; and center frequency of the VCO or the CCO determines the center frequency of the slower clock.
(b) a fast clock having a 50% duty cycle which is implemented by dividing a low jitter oscillator inside the hardware where the frequency ratio of the fast and slower clocks is 200 or more.
(c) a D type flip-flop (D flip-flop) or a T type flip-flop (T flip-flop) in order to generate binary sequence (S(DOA)) by sampling the output of the fast oscillator, at the rising or the falling edges of the chaos-modulated slower clock.

### Claim 11 (depends on 11)

A method for generating binary random bits (S(CDOA)i) which is based on dual oscillator architecture with the continuous-time chaotic oscillator and which relies on generating non-invertible random binary bits, from the one of the state which corresponds to one of the signal of the chaotic oscillator comprising the steps of;
(a) determining the sampling times appointed at the status transition of one state x1, x2, . . . or xn of the chaotic oscillator defined as x1 . . . n(t)=x1 . . . n(0) with dx1 . . . n=dt>0 or dx1 . . . n=dt<0.
(b) generating random binary sequence
i. S(CDOA)i by sampling the output of a fast oscillator at the sampling times correspond to status transitions of one state defined in claim 11.a or
ii. S(CDOA)i, by S(CDOA)i=S(CDOA)(i-1), if the bit, sampled from the output of a fast oscillator at the sampling times correspond to status transitions of one state defined in claim 11.a, is 0 and S(CDOA)i=the logical inverse of S(CDOA)(i-1), if the bit sampled from the output of a fast oscillator at the sampling times correspond to status transitions of one state defined in claim 11.a, is 1.

### Claim 12

A random bit generator, characterized by using comparator in the dual oscillator architecture with the continuous-time chaotic oscillator, and by relying on generating non-invertible random binary bits from one of the signal of the chaotic oscillator.

### Claim 13 (depends on 12)

A hardware for generating binary random bits according to claim 12, which is based on dual oscillator architecture with the continuous-time chaotic oscillator consist of:
(a) a comparator instead of a chaos-modulated slower clock where, one of the signal, which corresponds to one of the state (x1, x2, . . . or xn), of the continuous time chaotic oscillator is compared with a threshold voltage.
(b) a fast clock having a 50% duty cycle which is implemented by dividing a low jitter oscillator inside the hardware.
(c) a D type flip-flop (D flip-flop) or a T type flip-flop (T flip-flop) in order to generate binary sequence (S(CDOA)) by sampling the output of the fast oscillator, at the rising and/or the falling edges of the comparator output.

### Claim 14 (depends on 14)

A method for generating binary random bits (S(CDOA)i) which is based on dual oscillator architecture with a noise source and which relies on generating non-invertible random binary bits, from a random signal obtained from a noise source comprising the steps of;
(a) determining the sampling times appointed at the status transition of random signal x obtained from a noise source defined as x(t)=x(0) with dx=dt>0 or dx/dt<0.
(b) generating random binary sequence
i. S(CDOA)i by sampling the output of a fast oscillator at the sampling times correspond to status transitions of random signal defined in claim 14.a or
ii. S(CDOA)i, by S(CDOA)i=S(CDOA)(i-1), if the bit, sampled from the output of a fast oscillator at the sampling times correspond to status transitions of random signal defined in claim 14.a, is 0 and S(CDOA)i=the logical inverse of S(CDOA)(i-1), if the bit sampled from the output of a fast oscillator at the sampling times correspond to status transitions of random signal defined in claim 14.a, is 1.

### Claim 15

A random bit generator, characterized by using comparator in the dual oscillator architecture with a noise source, and by relying on generating non-invertible random binary bits from a random signal obtained from a noise source.

### Claim 16 (depends on 15)

A hardware for generating binary random bits according to claim 15, which is based on dual oscillator architecture with a noise source consist of:
(a) a comparator instead of a jittered slower clock where, a noise voltage obtained from a noise source is compared with a threshold voltage.
(b) a fast clock having a 50% duty cycle which is implemented by dividing a low jitter oscillator inside the hardware.
(c) a D type flip-flop (D flip-flop) or a T type flip-flop (T flip-flop) in order to generate binary sequence (S(CDOA)) by sampling the output of the fast oscillator, at the rising and/or the falling edges of the comparator output.
