# US 2008/0304667 A1 · Method and Apparatus For Cellular Automata Based Generation of Pseudorandom Sequences With Controllable Period

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

- Number: US 2008/0304667 A1
- Document ID: US20080304667A1
- Status: Published application
- Kind: A1
- Application number: 10/578,505
- Filed: 2005-09-05
- Published: 2008-12-11
- Earliest claimed: 2004-09-06
- Assignees: Sony Corporation
- Inventors: Miodrag J. Mihaljevic; Jouji Abe
- Web page: https://patentgrep.com/patent/US20080304667A1

## CPC

- G06F 7/582: {Pseudo-random number generators}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A compact apparatus for generation of desired pseudorandom sequences with controllable period. The apparatus includes two-dimensional cellular automata for generating a first sequence, 2-by-L cellular automata for generating a second sequence, adders for performing bit-to-bit mod2 sum of the first sequences and the second sequences, and a buffer for buffering the resultant sequences from the adders.

## Claims

### Claim at position 1

1: An apparatus for generating pseudorandom sequences comprising:
cellular automata of a first type for generating a first sequence with higher randomness;
cellular automata of a second type for generating a second sequence with predetermined lower bound on the period; and
adders for performing bit-to-bit mod2 sum of the first sequences and the second sequences.

### Claim at position 2 (depends on 1)

2: The apparatus according to claim 1, wherein:
the cellular automata of a first type is two-dimensional cellular automata;
the cellular automata of a second type is 2-by-L cellular automata; and
the summation results from the adders are outputted as the pseudorandom sequences.

### Claim at position 3 (depends on 1)

3: The apparatus according to claim 1, further comprising:
cellular automata of a third type for generating a third sequence, the cellular automata of a third type having cells whose states can be computed based on corresponding cell control word and/or rule control word; wherein
the cell control word is generated by the cellular automata of a second type;
the rule control word is generated by the cellular automata of a first type; and
the adders for performing bit-to-bit mod2 sum of the first, the second and the third sequences.

### Claim at position 4 (depends on 3)

4: The apparatus according to claim 3, wherein:
the summation results from the adders are outputted as the pseudorandom sequences.

### Claim at position 5 (depends on 2)

5: The apparatus according to claim 2, further comprising:
a block for performing nonlinear mapping on the summation results from the adders; and
a block for perform non-uniform decimation on the results of the nonlinear mapping;
wherein the decimated result is outputted as the pseudorandom sequence.

### Claim at position 6 (depends on 5)

6: The apparatus according to claim 5, wherein:
each of the blocks includes at least one nonlinear function.

### Claim at position 7 (depends on 5)

7: The apparatus according to claim 5, wherein:
the block for performing nonlinear mapping includes at least one look-up table for nonlinear mapping based on the Latin squares.

### Claim at position 8 (depends on 1)

8: An apparatus for performing cryptographic processing characterized by comprising:
a cryptographic processor for encrypting data using pseudorandom sequences; and
a pseudorandom sequence generator for generating the pseudorandom sequences;
wherein the pseudorandom number generator is configured to include the apparatus according to claim 1.

### Claim at position 9

9: A method for generating pseudorandom sequences using cellular automata comprising:
generating a first sequence with higher randomness;
generating a second sequence with predetermined lower bound on the period; and
performing bit-to-bit mod2 sum of the first sequences and the second sequences.

### Claim at position 10

10: A computer program for causing a computer to execute a method for generating pseudorandom sequences using cellular automata, the computer program wherein:
the method includes
generating a first sequence with higher randomness; generating a second sequence with predetermined lower bound on the period; and
performing bit-to-bit mod2 sum of the first sequences and the second sequences.

### Claim at position 11

11: A recording medium storing a computer program for causing a computer to execute a method for generating pseudorandom sequences using cellular automata, the recording medium wherein:
the method includes
generating a first sequence with higher randomness; generating a second sequence with predetermined lower bound on the period; and
performing bit-to-bit mod2 sum of the first sequences and the second sequences.
