# US 2018/0321914 A1 · Sram-based true random number generator

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

- Number: US 2018/0321914 A1
- Document ID: US20180321914A1
- Status: Published application
- Kind: A1
- Application number: 16/024,510
- Filed: 2018-06-29
- Published: 2018-11-08
- Earliest claimed: 2016-08-11
- Assignees: Taiwan Semiconductor Manufacturing Company, Ltd.
- Applicants: Taiwan Semiconductor Manufacturing Co., Ltd.
- Inventors: Shih-Lien Linus LU
- Web page: https://patentgrep.com/patent/US20180321914A1

## CPC

- G06F 7/588: {Random number generators, i.e. based on natural stochastic processes}
- G11C 7/1006: {Data managing, e.g. manipulating data before writing or reading out, data bus switches or control circuits therefor}
- G11C 11/418: Address circuits
- G11C 11/419: Read-write [R-W] circuits
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G11C: STATIC STORES (semiconductor memory devices H10B)

## Abstract

A random number generator (RNG) is disclosed. The RNG comprises a memory bit array having a plurality of bits, wherein each bit is configured to present an initial logic state when the memory bit array is powered on; and a first folding circuit coupled to the memory bit array, wherein the first folding circuit is configured to: read initial logic states of a first bit and a second bit of the memory bit array, perform a first logic function on the initial logic state of the first bit, and perform a second logic function on the initial logic state of the second bit to contaminate the initial logic state of the second bit so as to provide an altered initial logic state of the second bit.

## Claims

### Claim 1

A method, comprising:
reading respective initial logic states of a first plurality of bits of a memory bit array, wherein at least one of the first plurality of bits is an unstable bit;
reading respective initial logic states of a second plurality of bits of the memory bit array; and
using the initial logic state of the at least one unstable bit of the first plurality of bits to contaminate an initial logic state of one of the second plurality of bits so as to provide at least one random bit that is based on the contaminated initial logic state.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first plurality of bits are disposed on a first row of the memory bit array and the second plurality of bits are disposed on a second row of the memory bit array.

### Claim 3 (depends on 1)

The method of claim 1, wherein the respective initial logic states of the first plurality of bits are logic states presented by the first plurality of bits when the memory bit array is powered on, and the respective initial logic states of the second plurality of bits are logic states presented by the second plurality of bits when the memory bit array is powered on.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
performing an XOR logic function on the initial logic state of the at least one unstable bit of the first plurality of bits and the initial logic state of the one of the second plurality of bits to provide the at least one random bit.

### Claim 5 (depends on 4)

The method of claim 4, further comprising:
reading an initial logic state of a third bit on a third row of the memory bit array; and
performing the XOR logic function on the contaminated initial logic state of the at least one random bit and the read initial logic state of the third bit so as to provide an altered initial logic state of the third bit as an additional random bit.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
reading respective initial logic states of a third plurality of bits of the memory bit array, wherein at least one of the third plurality of bits is an unstable bit;
reading respective initial logic states of a fourth plurality of bits of the memory bit array; and
using the initial logic state of the at least one unstable bit of the third plurality of bits to contaminate an initial logic state of one of the fourth plurality of bits so as to provide at least one additional random bit.

### Claim 7 (depends on 6)

The method of claim 6, wherein the at least one random bit formed based on the contaminated initial logic state of the one of the second plurality of bits and the at least one additional random bit formed based on the contaminated initial logic state of the one of the fourth plurality of bits are generated concurrently.

### Claim 8

A method, comprising:
reading respective initial logic states of a first plurality of bits of a memory bit array;
reading respective initial logic states of a second plurality of bits of the memory bit array, wherein at least one of the first and second pluralities of bits include at least one unstable bit; and
using the initial logic state of the at least one unstable bit to alter at least one of the initial logic states of the second plurality of bits so as to provide at least one random bit.

### Claim 9 (depends on 8)

The method of claim 8, wherein the first plurality of bits are disposed on a first row of the memory bit array and the second plurality of bits are disposed on a second row of the memory bit array.

### Claim 10 (depends on 8)

The method of claim 8, wherein the respective initial logic states of the first plurality of bits are logic states presented by the first plurality of bits when the memory bit array is powered on, and the respective initial logic states of the second plurality of bits are logic states presented by the second plurality of bits when the memory bit array is powered on.

### Claim 11 (depends on 8)

The method of claim 8, further comprising:
performing an XOR logic function on the initial logic state of the at least one unstable bit and the initial logic state of the one of the second plurality of bits to provide the at least one random bit.

### Claim 12 (depends on 11)

The method of claim 11, further comprising:
reading an initial logic state of a third bit on a third row of the memory bit array; and
performing the XOR logic function on the altered initial logic state of the at least one random bit and the read initial logic state of the third bit so as to provide an altered initial logic state of the third bit as an additional random bit.

### Claim 13 (depends on 8)

The method of claim 8, further comprising:
reading respective initial logic states of a third plurality of bits of the memory bit array;
reading respective initial logic states of a fourth plurality of bits of the memory bit array, wherein at least one of the third and fourth pluralities of bits include at least one additional unstable bit; and
using the initial logic state of the at least one additional unstable bit to alter at least one of the initial logic states of the fourth plurality of bits so as to provide at least one additional random bit.

### Claim 14 (depends on 13)

The method of claim 13, wherein the at least one random bit and the at least one additional random bit are generated concurrently.

### Claim 15

A method, comprising:
reading initial logic states of a first bit and a second bit of a memory bit array;
performing a first logic function on the initial logic state of the first bit; and
performing a second logic function on the initial logic states of the first and second bits to contaminate the initial logic state of the second bit so as to provide an altered initial logic state of the second bit, wherein the altered initial logic state of the second bit forms a first random bit.

### Claim 16 (depends on 15)

The method of claim 15, wherein the first bit is disposed on a first row of the memory bit array and the second bit is disposed on a second row of the memory bit array.

### Claim 17 (depends on 15)

The method of claim 15, wherein the initial logic state of the first bit is a logic state presented by the first bit when the memory bit array is powered on, and the initial logic state of the second bit is a logic state presented by the second bit when the memory bit array is powered on.

### Claim 18 (depends on 15)

The method of claim 15, wherein performing the second logic function comprises performing an XOR logic function on the initial logic state of the first bit and the initial logic state of the second bit to provide the first random bit.

### Claim 19 (depends on 18)

The method of claim 18, further comprising:
reading an initial logic state of a third bit on a third row of the memory bit array; and
performing the XOR logic function on the altered initial logic state of the second bit and the read initial logic state of the third bit so as to provide an altered initial logic state of the third bit as an additional random bit.

### Claim 20 (depends on 15)

The method of claim 15, further comprising:
reading initial logic states of third and fourth bits of the memory bit array; and
performing the second logic function on the initial logic states of the third and fourth bits to contaminate the initial logic state of the fourth bit so as to provide an altered initial logic state of the fourth bit, wherein the altered initial logic state of the fourth bit forms a second random bit, and wherein the first, second, third, and fourth bits are disposed on different rows of the memory bit array, respectively.
