Back to results
US 2008/0304667 A1Published application
Method and Apparatus For Cellular Automata Based Generation of Pseudorandom Sequences With Controllable Period
AssigneeSony Corporation
InventorsMiodrag J. Mihaljevic, Jouji Abe
Life of this patent
Estimating the term…
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.
Claims11
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.
2 more elements
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.
2 more elements
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.
4 more elements
4:
- The apparatus according to claim 3, wherein:
- the summation results from the adders are outputted as the pseudorandom sequences.
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.
2 more elements
6:
- The apparatus according to claim 5, wherein:
- each of the blocks includes at least one nonlinear function.
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.
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.
2 more elements
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.
2 more elements
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.
3 more elements
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.
3 more elements