Secure writing of data
OwnerJose Mennecart, Eric Delaunayinventors
Life of this patent
Estimating the term…
Abstract
A data processor, such as, for example, a smart card, comprises a controller for managing a file wherein a plurality of records can be stored in a sequential fashion. The controller checks whether a record has correctly been written into the file. The controller prevents user-related software from reading the record that is subsequent to the last record that has correctly been written.
Claims6
A data processor comprising a controller for managing a file wherein a plurality of records can be stored in a sequential fashion, the controller being arranged to check whether a record has correctly been written into the file, characterized in that the controller prevents user-related software from reading the record that is subsequent to the last record that has correctly been written.
A method of managing a file wherein a plurality of records can be stored in a sequential fashion, the method comprising:
- a verification step in which it is checked whether a record has been correctly written into the file;
- and
- an access-control step in which it is prevented that the record that is subsequent to the last record that has correctly been written is read.
A computer program product for managing a file wherein a plurality of records can be stored in a sequential fashion, the computer program product comprising a set of instructions that, when loaded into a data processor, causes the data processor to carry out:
- a verification step in which the data processor checks whether a record has been correctly written into the file;
- and
- an access-control step in which the data processor prevents that the record that is subsequent to the last record that has correctly been written is read.
A method for secure writing in a rewritable memory, characterized in that it comprises the steps of:
- a) defining a memory comprising a circular file having m records organized into a loop, where m is an integer ranging from 1 to n+1, each record comprising at least one rank, one integrity flag for indicating a bad or good state, and one data value, records of ranks 1 to n being accessible to a user while the record of rank n+1, the integrity flag and the rank of each record are hidden from the user;
- b) in the presence of data to be written in the thus defined memory, selecting the circular file;
- c) fetching the current record of highest rank m=n+1, and checking the status of its integrity flag;
- d) in case the integrity flag is bad, writing the data to be written in the current record of rank m=n+1, and in case of success, incrementing by one unit the rank of the current record m=n+1+1=1, which then becomes hidden, so that the records of ranks 2 to n+1 are left to be accessible while in case of failure, not modifying the rank of the current record m=n+1, which remains hidden, while other records of ranks 1 to n remain accessible to the user;
- and
- e) in case the integrity flag is good, writing the data to be written into the record of next rank m=n+1+1=1, and in case of success, incrementing by one unit the rank of record m=1+1=2, which becomes hidden, so that records of ranks 3 to n+2 remain accessible, while in case of failure, not modifying the rank of current record m=n+2 which remains hidden, so that records of ranks 2 to n+1 are left accessible to the user.
A data processor in which a file header is complemented with a redundancy area so that a first record begins at the border of a memory page.
Dependencies are inferred from the claim text.