Method for data storage protection and encryption
AssigneeGED-I Ltd.
InventorsElisha Atzmon, Giora Cohen, David Saar
Life of this patent
Estimating the term…
Abstract
Methods for data storage protection and encryption are disclosed. In some of these methods, the method may include any of the following, among other things, storing information about the storage format to a Geometrical Cell Location Table (GCLT), shuffling a Geometrical Cell Location Table giving rise to a Shuffled Geometrical Cell Location Table (SGCLT), encrypting data using more than one key, renewing content, and/or filling empty sectors with encrypted data.
Claims33
A method of dividing a computer readable disk that includes at least one track and the track is divided into at least two geometrical cells (GCs), comprising:
- dividing at least one of the at least one track on the computer readable disk into at least two neighboring geometrical cells (GCs);
- at least one of said GCs is bordered by at least one of a different internal radius or different outer radius compared to the respective radius of a neighboring cell of said track;
- and
- storing a Geometrical Cell Location Table (GCLT), for accessing data in said cells, said accessing include inserting or updating or deleting data;
- wherein said GCLT is encrypted.
A method of dividing a computer readable disk that includes at least one track and the track is divided into at least two geometrical cells (GCs), comprising:
- dividing at least one of the at least one track on the computer readable disk into at least two neighboring geometrical cells (GCs);
- at least one of said GCs defining a different angular size compared to the angular size of a neighboring GC of said track;
- and
- storing a Geometrical Cell Location Table (GCLT), for accessing data in said cells, said accessing includes inserting, updating or deleting data;
- wherein said GCLT is encrypted.
A method of dividing a computer readable disk that includes at least one track and the track is divided into at least two geometrical cells (GCs), comprising:
- dividing at least one of the at least one track on the computer readable disk into at least two neighboring geometrical cells (GCs);
- at least one of said GCs is bordered by at least one of a different internal radius or different outer radius compared to the respective radius of a neighboring cell of said track;
- storing a Geometrical Cell Location Table (GCLT), for accessing data in said cells, said accessing include inserting or updating or deleting data;
- and shuffling said Geometrical Cell Location Table, giving rise to Shuffled Geometrical Cell Location Table (SGCLT), such that a GC from among said at least one GCs having a GC address in said GCLT will have a different address in said SGCLT;
- said GCLT facilitating access of cell of interest.
A method of dividing a computer readable disk that includes at least one track and the track is divided into at least two geometrical cells (GCs), comprising:
- dividing at least one of the at least one track of the computer readable disk into at least two neighboring geometrical cells (GCs);
- at least one of said GCs defining a different angular size compared to the angular size of a neighboring GC of said track;
- storing a Geometrical Cell Location Table (GCLT), for accessing data in said cells, said accessing includes inserting, updating or deleting data;
- and
- shuffling said Geometrical Cell Location Table, giving rise to Shuffled Geometrical Cell Location Table (SGCLT), such that a GC from among said at least one GCs having a GC address in said GCLT will have a different address in said SGCLT;
- said GCLT facilitating access of cell of interest.
A method of dividing a computer readable disk that includes at least one track and the track is divided into at least two geometrical cells (GCs), comprising:
- dividing at least one of the at least one track of the computer readable disk into at least two neighboring geometrical cells (GCs);
- at least one of said GCs is bordered by at least one of a different internal radius or different outer radius compared to the respective radius of a neighboring cell of said track;
- at least one of said GCs defining a different angular size compared to the angular size of a neighboring GC of said track;
- storing a Geometrical Cell Location Table (GCLT), for accessing data in said cells, said accessing includes inserting, updating or deleting data;
- and
- shuffling said Geometrical Cell Location Table, giving rise to Shuffled Geometrical Cell Location Table (SGCLT), such that a GC from among said at least one GCs having a GC address in said GCLT will have a different address in said SGCLT;
- said GCLT facilitating access of cell of interest.
A method of dividing a computer readable disk that includes at least one track, said track is divided into at least two geometrical cells (GCs), comprising:
- dividing at least one of the at least one track of the computer readable disk into geometrical cells (GCs);
- at least one of said GCs is bordered by at least different internal radius or different outer radius compared to the respective radius of a neighboring cell of said track;
- at least one of said GCs defining a different angular size compared to the angular size of a neighboring GC of said track;
- and
- storing a Geometrical Cell Location Table (GCLT), for accessing data in said cells, said accessing include inserting or updating or deleting data;
- wherein said GCLT is encrypted.
A method of renewing content in a computer readable disk, the disk includes at least one track and the track is divided into at least two geometrical cells (GCs), comprising:
- dividing the computer readable disk into tracks and geometrical cells (GCs) constituting sectors and constructing Logical Block Address (LBA) for facilitating access of sector of interest;
- storing data in said sectors;
- shuffling at least two of said sectors addresses, giving rise to Shuffled LBA (SLBA), such that a sector from among said at least one sectors having a sector address in said LBA will have a different address in said SLBA;
- said SLBA facilitating access of sector of interest;
- and
- renewing content of selected sectors according to a predefined criterion, thereby hindering the possibility of dating data based on aging.
A method of renewing content in a computer readable disk, the disk includes at least one track and the track is divided into at least two geometrical cells (GCs), comprising:
- dividing the computer readable disk into tracks and geometrical cells (GCs) constituting sectors and constructing Logical Block Address (LBA) for facilitating access of sector of interest;
- storing data in said sectors;
- encrypting data in at least one of said sectors, wherein said encrypting includes encrypting data in a sector utilizing at least two keys, each key being used to encrypt part of the data in said sector;
- and
- renewing content of selected sectors according to a predefined criterion, thereby hindering the possibility of dating data based on aging.
A method of renewing content in a computer readable disk, the disk includes at least one track and the track is divided into at least two geometrical cells (GCs), comprising:
- dividing the computer readable disk into tracks and geometrical cells (GCs) constituting sectors and constructing Logical Block Address (LBA) for facilitating access of sector of interest;
- storing data in said sectors;
- encrypting data in at least one of said sectors, wherein said encrypting includes encrypting data in a sector utilizing at least two encryption algorithms, each algorithm being used to encrypt part of the data in said sector;
- and
- renewing content of selected sectors according to a predefined criterion, thereby hindering the possibility of dating data based on aging.
Dependencies are inferred from the claim text.