US6049609A — Cell array providing non-persistent secret storag…

Claim 1

Independent Claim 88 words

A method of storing and retrieving data, comprising: performing mutations of a cell array in a mutation cycle until a storage phase is reached; storing the data in storage regions of the cell array at the storage phase; mutating the cell array through additional phases in which the data stored in the cell array during the storage phase is encrypted by the mutations through the additional phases; and in response to a retrieval request, continuing the mutations until a retrieval phase is reached and the data is decrypted.

Claim 2

Independent Claim 88 words

A method of storing and retrieving data, comprising: performing mutations of a cell array in a mutation cycle until a storage phase is reached; storing the data in storage regions of the cell array at the storage phase; mutating the cell array through additional phases in which the data stored in the cell array during the storage phase is encrypted by the mutations through the additional phases; and in response to a retrieval request, continuing the mutations until a retrieval phase is reached and the data is decrypted.

Claim 3

Dependent Claim 18 words

The method of claim 1, wherein the mutation cycle includes a rest phase wherein the data is encrypted.

Claim 4

Dependent Claim 21 words

The method of claim 1, wherein the storage phase and the retrieval phase are the same phase of the mutation cycle.

Claim 5

Dependent Claim 15 words

The method of claim 1, wherein the cell array is a tamper resistant binary structure.

Claim 6

Dependent Claim 18 words

The method of claim 1, wherein the mutating occurs through XOR operations of cells within the cell array.

Claim 7

Dependent Claim 49 words

The method of claim 1, wherein there is more than one possible storage phase and the method further comprises providing a phase identification number (PIN) to the cell array and wherein the cell array uses the PIN to determine the particular storage phase at which the data is stored.

Claim 8

Dependent Claim 46 words

The method of claim 6, wherein the PIN is stored in the cell array during the storage phase is a first PIN, and a second PIN is received as part of a retrieval request, and the first and second PINs are compared during a retrieval phase.

Claim 9

Dependent Claim 22 words

The method of claim 7, wherein if the first and second PINs match, the cell array allows the data to be retrieved.

Claim 10

Dependent Claim 24 words

The method of claim 7, wherein if the first and second PINs do not match, the cell array is not allowed to be retrieved.

Claim 11

Dependent Claim 32 words

The method of claim 7, wherein if the first and second PINs do not match, the cell array is not allowed to be retrieved and the cell array enters a self-destruct mode.

Claim 12

Dependent Claim 22 words

The method of claim 1, wherein there are additional storage phases and additional data that is stored in the additional storage phases.

Claim 13

Dependent Claim 97 words

A computer-readable medium having instructions thereon which wherein executed cause a computer system to perform acts comprising: performing mutations of a cell array in a mutation cycle until a storage phase is reached; storing data in a storage region of the cell array at the storage phase; mutating the cell array through additional phases in which the data stored in the cell array during the storage phase is encrypted by the mutations through the additional phases; and in response to a retrieval request, continuing the mutations until a retrieval phase is reached and the data is decrypted.

Claim 14

Dependent Claim 97 words

A computer-readable medium having instructions thereon which wherein executed cause a computer system to perform acts comprising: performing mutations of a cell array in a mutation cycle until a storage phase is reached; storing data in a storage region of the cell array at the storage phase; mutating the cell array through additional phases in which the data stored in the cell array during the storage phase is encrypted by the mutations through the additional phases; and in response to a retrieval request, continuing the mutations until a retrieval phase is reached and the data is decrypted.

Claim 15

Dependent Claim 21 words

The medium of claim 12, wherein the storage phase and the retrieval phase are the same phase of the mutation cycle.

Claim 16

Dependent Claim 49 words

The medium of claim 12, wherein there is more than one possible storage phase and the method further comprises providing a phase identification number (PIN) to the cell array and wherein the cell array uses the PIN to determine the particular storage phase at which the data is stored.

Claim 17

Dependent Claim 47 words

The medium of claim 12, wherein the PIN is stored in the cell array during the storage phase and is a first PIN, and a second PIN is received as part of a retrieval request, and the first and second PINs are compared during a retrieval phase.

Claim 18

Dependent Claim 12 words

The medium of claim 12, wherein the medium is a CD-ROM disk.

Claim 19

Independent Claim 80 words

A system for storing and retrieving data, comprising: memory containing a cell array having storage regions; and a processor that performs mutations of the cell array in a mutation cycle until a storage phase is reached, stores data in the storage regions of the cell array at the storage phase, and mutates the cell array to additional phases in which the data stored in the cell array during the storage phase is encrypted by the mutations through the additional phases.

Claim 20

Independent Claim 80 words

A system for storing and retrieving data, comprising: memory containing a cell array having storage regions; and a processor that performs mutations of the cell array in a mutation cycle until a storage phase is reached, stores data in the storage regions of the cell array at the storage phase, and mutates the cell array to additional phases in which the data stored in the cell array during the storage phase is encrypted by the mutations through the additional phases.

Claim 21

Dependent Claim 16 words

The system of claim 17, further including a DVD player that includes the memory and processor.

Claim 22

Dependent Claim 20 words

The system of claim 17, further including a personal computer used for electronic commerce that includes the memory and processor.

Claim 23

Dependent Claim 110 words

A computer system, comprising: a processor; memory; and a computer readable medium having instructions that when executed cause the processor to: create in the memory a matrix P of plain text calls to be used in a mutation cycle, the matrix P including don't care sections for use as storage regions; receive data to be encrypted and decrypted in the don't care sections; create in memory a matrix M of partnering that contains information about phase and cell placement; invert matrix M to produce an inverted matrix M -1 ; and create in memory the initial phase I of the cell array through a matrix multiply I=M -1 * P.

Claim 24

Dependent Claim 110 words

A computer system, comprising: a processor; memory; and a computer readable medium having instructions that when executed cause the processor to: create in the memory a matrix P of plain text calls to be used in a mutation cycle, the matrix P including don't care sections for use as storage regions; receive data to be encrypted and decrypted in the don't care sections; create in memory a matrix M of partnering that contains information about phase and cell placement; invert matrix M to produce an inverted matrix M -1 ; and create in memory the initial phase I of the cell array through a matrix multiply I=M -1 * P.

Claim 25

Dependent Claim 16 words

The system of claim 20, wherein the computer readable medium is a portion of the memory.

Claim 26

Independent Claim 108 words

A method of creating an initial phase I of a cell array for encryption and decryption, comprising: creating in memory a matrix P of plain text cells to be used in a mutation cycle, the matrix P including don't care sections for use as storage regions to store data to be encrypted and decrypted; receiving data in the don't care sections; creating in memory a matrix M of partnering that contains information about phase and cell placement; inverting matrix M to produce an inverted matrix M -1 ; and creating in memory the initial phase I of the cell array through a matrix multiply I=M -1 * P.

Claim 27

Independent Claim 108 words

A method of creating an initial phase I of a cell array for encryption and decryption, comprising: creating in memory a matrix P of plain text cells to be used in a mutation cycle, the matrix P including don't care sections for use as storage regions to store data to be encrypted and decrypted; receiving data in the don't care sections; creating in memory a matrix M of partnering that contains information about phase and cell placement; inverting matrix M to produce an inverted matrix M -1 ; and creating in memory the initial phase I of the cell array through a matrix multiply I=M -1 * P.

Claim 28

Dependent Claim 26 words

The method of claim 22, wherein at least a portion of the don't care sections have a same offset from beginnings of the plain text cells.

Claim 29

Dependent Claim 108 words

An article comprising: a computer readable medium having instructions that when executed cause a computer system to: create in memory a matrix P of plain text cells to be used in a mutation cycle, the matrix P including don't care sections for use as storage regions to store data to be encrypted and decrypted; receive data in the don't care sections; create in memory a matrix M of partnering that contains information about phase and cell placement; invert matrix M to produce an inverted matrix M -1 ; and create in memory the initial phase I of the cell array through a matrix multiply I=M -1 * P.

Claim 30

Dependent Claim 108 words

An article comprising: a computer readable medium having instructions that when executed cause a computer system to: create in memory a matrix P of plain text cells to be used in a mutation cycle, the matrix P including don't care sections for use as storage regions to store data to be encrypted and decrypted; receive data in the don't care sections; create in memory a matrix M of partnering that contains information about phase and cell placement; invert matrix M to produce an inverted matrix M -1 ; and create in memory the initial phase I of the cell array through a matrix multiply I=M -1 * P.

Annuity Stage	Window Opens	Payment Deadline	Surcharge Period Until	Estimated Fee	Status
3.5 Years (Year 4)	2003-04-11	2003-10-11	2004-04-11	$2000.00	Window Closed / Lapsed
7.5 Years (Year 8)	2007-04-11	2007-10-11	2008-04-11	$3760.00	Window Closed / Lapsed
11.5 Years (Year 12)	2011-04-11	2011-10-11	2012-04-11	$7700.00	Window Closed / Lapsed

Cell array providing non-persistent secret storage through a mutation cycle

Abstract

Inventors

Bibliographic Details

Claims Analysis

References Cited (Backward Citations)

USPTO Annuity & Maintenance Windows

Assigned Categories & Tags

Assign Category Tag