Data processing

Information

  • Patent Grant
  • 7185208
  • Patent Number
    7,185,208
  • Date Filed
    Friday, September 27, 2002
    22 years ago
  • Date Issued
    Tuesday, February 27, 2007
    17 years ago
Abstract
In one embodiment of the present invention, there is disclosed a reversible method of processing data comprising the data being encrypted before being written to a non-volatile memory wherein the data cannot be accessed without decryption in the case of a direct physical access to the non-volatile memory.
Description
CROSS REFERENCE TO RELATED APPLICATION

This application claims the benefit of the priority date of my earlier filed British Application No. 0123417.8, entitled “Improved Data Processing”, filed on Sep. 28, 2001.


BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention relates generally to an improved process of encrypting data and corresponding process of decrypting data for use within non-volatile memory, for example to provide a known level of security within a data processing system and particularly to a reversible method and apparatus of processing data comprising the data being encrypted before being written to a non-volatile memory wherein the data cannot be accessed without decryption in the case of a direct physical access to the non-volatile memory.


2. Description of the Prior Art


In known data processing systems having an on-volatile memory such as flash memory it is common for user data to be written to the flash memory without any modification taking place. An example of a known data processing system shown in FIG. 1 is a flash memory card 12 connected via a controller chip 19 to a host 8 (such as an ATA PC Card or Compact Flash card). The controller chip 19 is provided with an input/output port 15 which connects host 8 to host interface 16. Host interface and registers 16 are then connected to a port of a sector buffer SRAM 10 which conveniently is dual-port. A datapatch controller 18, and ECC generator and checker 20 and a flash memory interface (FMI) 22 are also all connected to the SRAM 10. The FMI 22 is also connected via a flash memory port 25 to flash memory 12. The controller chip 19 also includes microprocessor 32, I this case being a RISC processor, a processor SRAM 30, a processor mask ROM 28 and a port for an external program ROM/RAM 27 which is connected to a program RAM interface 26. An optional debug port 34 may also be provided for the RISC processor 32. Data and commands are communicated between various components of the controller 19, with the exception of the sector buffer memory 10, via microprocessor bus 24. The user data which is sent by the host 8 via the host interface port 15 is transferred to the sector buffer 10 without modification. The controller 19 then adds a control overhead, and writes the composite data (which typically is referred to as a (‘logical sector’) to the flash memory 12 via the flash memory port 25. The control overhead typically includes header data, which contains control information, and error correct code (ECC). Memory 12 stores the data (or logical sector) after encryption in a group of memory locations which are referred to as a ‘memory sector’. A memory sector need not be a physical portion within memory 12 nor need it be formed by contiguous memory locations. The function of the controller 19 is to present the logical characteristics of a disc storage device to the host 8.


In FIG. 2 the typical data partitioning in flash memory is shown. A typical memory sector 1 contains 512 memory is shown. A typical memory sector 1 contains 512 bytes of information data 1a, 4 bytes of header data 1b, and 12 bytes of ECC 1c. Generally the information data 1a comes from the host, the header data 1b is generated by the controller processor 32 and the ECC is generated by hardware, i.e. ECC generator 20 of FIG. 1. The ECC may protect the user data only, or both the user data and the header data depending on the ECC generation function applied.


This means that if the flash memory card 12 is physically opened and disassembled the flash memory contents can be accessed directly and the contents of the user data portions, or memory sectors, can be read.


In FIG. 3 is illustrated a top level structure 40 of a memory device system such as that of FIG. 1. The system 40 has a secure memory card interface 44 which is capable of enabling or disabling access to the memory card 41 as a data storage device. As detailed previously the user data, or host data, from host system 42 is written to the memory 48. However, the host system 42 cannot access the memory 48 of the system 40 without sending a valid password to the memory card 41. This password protected interface, or secure memory card interface 44, between the host system 42 and the card 41 protects the data from unauthorized access via the standard host interface 44. However, it is still possible to access the data directly via the memory interface if the device is disassembled. This type of method of password protected access is incorporated into the ATA and compact flash standards for non-volatile memory devices.


Thus, a need arises to obviate or mitigate at least one of the aforementioned problems.


SUMMARY OF THE INVENTION

An object of the present invention is to provide a reversible method of processing data comprising the data being encrypted before being written to a non-volatile memory wherein the data cannot be accessed without decryption in the case of a direct physical access to the non-volatile memory.


In a first aspect of the present invention there is provided a reversible method of processing data which comprises the encryption of data before it is written to non-volatile memory so that it cannot be accessed without decryption in the case of a direct physical access to the non-volatile memory, wherein the encryption of data is carried out by an encryption process which comprises the user data and associate header data undergoing at least one of the two steps of scrambling and encoding.


Preferably the encryption process further comprises the other of the two steps of scrambling and encoding.


Conveniently the encryption process may further comprise at least one further encoding step.


Preferably the user data and header data is divided into portions, and the step of scrambling the user data and header data is performed by a portion address to flash portion address function.


Preferably the step of encoding the user data and header data is performed by a data to flash data function.


Conveniently the non-volatile memory is flash memory.


Conveniently the encrypted data of non-volatile memory can be decrypted by applying the reverse of the encryption process to the encrypted data.


Conveniently the steps of scrambling the encoding are conditional operations and have memory sector address as input which is independent from a host defined logical sector address.


Preferably the addresses of the data portions parameterize the data encoding.


Preferably the step of scrambling the data uses user data or other data supplied by the host as extra input as a parameter for use in the scrambling function.


Conveniently the steps of scrambling and encoding are implemented by hardware.


Preferably the header data provides at least some control information.


Preferably the portion address to flash portion address function is parameterized by a memory sector address to which the encrypted data is written.


In a second aspect the invention comprises a method of decrypting said encrypted data wherein the encrypted data undergoes a decryption process which is the reverse of the encryption process applied to encrypt the data.


Conveniently the decryption process comprises at least one of the two steps of scrambling and decoding. Preferably the decryption process comprises the step of unscrambling and at least one decoding step as appropriate.


Preferably the step of decoding and data is performed by a flash data to data function.


Preferably the step of unscrambling the data is performed by a portion flash address to portion address function.


Preferably the data which has undergone the first step of decryption and the original error correction code is used to check the integrity of all the data which results form the decryption.


In a third aspect of the present invention there is provided a memory system adapted for use with a non-volatile memory and which is arranged to present the logical characteristics of a disc storage device to a host system, wherein the memory system comprises a controller to manage the data transfers to and from the non-volatile memory, the controller being adapted reversibly to encrypt data in accordance with the first aspect of the present invention.


In a fourth aspect of the present invention there is provided a memory system for connection to a host processor, the system comprising: a solid state memory having non-volatile memory sectors which are individually addressable and which are arranged in erasable blocks of sectors, each said sector having a physical address defining its physical position in the memory; and a controller for writing data structures to and reading data structures from the memory, wherein the controller includes means for translating logical addresses received form the host processor to physical addresses received from the host processor to physical addresses of said memory sectors in the memory; and wherein each said memory sector is physically partitioned into a data area and a spare area and the controller is configured so as to write overhead data (OD) comprising header data and error connection code data (ECC) at a position in the sector which is offset from the start of the data area of the sector and to write user data, received from the host processor, in the space remaining in the sector, on either side of the overhead data (OD), the user data and header data being divided into portions which are encrypted in the memory sector by scrambling, the step of scrambling the user data and header data being performed by a portion address to flash portion address function.


Conveniently said overhead data (OD) is offset by an amount which is determined by at least one bit of the user data to be written to the sector.


The foregoing and other objects, features and advantages of the present invention will be apparent from the following detailed description of the preferred embodiments which make reference to several figures of the drawing.





IN THE DRAWINGS


FIG. 1 shows a schematic prior art memory system;



FIG. 2 shows a schematic representation of typical prior art flash memory partitioning;



FIG. 3 shows a schematic representation of the top level memory structure of a prior art system;



FIG. 4 shows a schematic representation of an encryption and corresponding decrypting method according to a first embodiment of the present invention;



FIG. 5A shows a schematic representation of an encryption and corresponding decryption method according to a second embodiment of the present invention;



FIG. 5B shows a schematic representation of a scrambling function of the encryption process of FIG. 5A;



FIG. 6 shows a schematic representation of an encryption method according to a third embodiment of the present invention;



FIG. 7 shows a schematic representation of an encryption method according to a fourth embodiment of the present invention;



FIG. 8 shows a schematic representation of a hardware arrangement in which the encryption process of the present invention may be implemented;



FIG. 9 shows a schematic representation of the encryption process implemented by the arrangement shown in FIG. 8;



FIG. 10 shows a schematic layout of a memory system in which the encryption and decryption process of the present invention is implemented; and



FIG. 11 shows a schematic representation of a top level memory structure in which the encryption and decryption process of the present invention is implemented.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

With reference to FIG. 4, there is shown a schematic representation of a first embodiment of a method of encrypting data (and corresponding method of decrypting data) before it is written to flash memory 12 (FIG. 1). 512 bytes of user data and 4 bytes of header data, split into data portions which comprise a plurality of bits, in this case 4 bits, are represented within buffer memory 10, by d(n), d(k), d(m) . . . etc. An encoding function D1, which is a mathematical function such as an exclusive OR function (XOR function) performed with a parameter, such as the addresses of the data portions, is applied to each byte portion, e.g. D(k) which acts on the byte portion to generate an encoded byte portion D1(k) which is written to flash memory 12 as encoded data. The D1 encoding function can be considered a data to flash data function. The encoded byte portion D1(k) is of the same size as the original byte portion D(k) and is written to the flash memory data portion address 12b which corresponds to the buffer memory data portion address 10b from which is was read. In order to decode the encoded information stored in the flash memory 12, a decoding function D1′, which is, as before, an XOR transformation with a parameter such as the addresses of the data portions and which is, due to its symmetric nature, the reverse of encoding function D1, is applied to the encoded data D1(k) stored in flash memory 12 when the data is read therefrom. The function D1′ decodes the data D1(k) returning it to the original user data and header data format D(k) writing it to buffer memory 10 at buffer memory data portion address 10b from which it was initially read. The D1′ function can be considered a flash data to data function.


With reference to FIG. 5A there is shown a schematic representation of a second embodiment of a method of encrypting data and corresponding method of decrypting data. In this arrangement the original data is split into byte portions which are represented within the buffer memory 10 by D(1), D(2) . . . D(n). A scrambling function A1 such as an exclusive OR function is applied to the data portions which are stored in the buffer memory 10. The scrambling function A1 modifies the address of each of the data portions thus mixing the data portions D(1) to D(n) within the data block array area 13 of flash memory 12 so that any data portion, e.g. D(1) is located at an address within the flash memory array 13 which is different from the original address of the data portion D(1) within the buffer memory 10. The A1 function can be considered an address to flash address function.


By applying A1′, which is the same byte-wise XOR function as A1, to the scrambled data, the original unscrambled user data and header data is retrieved. This means that in order to return the scrambled data to its original format all of the scrambled data portions must be accessed.


The A1′ function, being an XOR function, unscrambles the scrambled data because the XOR function is a symmetrical reversible function and therefore acts as the reverse of the scrambling function A1 and returns the data to its original array address within the buffer memory. The A1′ function can be considered a flash address to address function.


An example of he scrambling function operating on user and header data portions is shown in FIG. 5B. Two data portions of the 512 bytes of user data in buffer memory 10 are represented by D(n) and D(m) where O≦n,m≦512 and two data portions of the 4 bytes of header data are represented by H(1), H(2).


The scrambling function A1 is such that header data portion H(1) is positionally interchanged with user data portion D(n), the header data portion H(2) is positionally interchanged with user data portion D(m) in the flash memory 12. The addresses n and m etc. are a function F of parameters P1, P2 etc:

n=F(1, P1, P2, . . . ) and
m=F(2, P1, P2, . . . ).

The parameters P1, P2 etc. may be determined by, for example, the physical location or by the data itself. For example, if the function F is parameterized by both the user data and the header data parameter P1 is:

P1=D(1)⊕D(2)⊕. . . ⊕D(512)⊕H(1)⊕. . . ⊕H(4)

where ⊕ is a byte-wise exclusive OR function.


The encryption methods of the first and second embodiments provide read-protection for data stored in non-volatile memory and are simple to implement within a variety of memory systems. The two embodiments of encryption methods can also be combined easily to provide more complex encryption functions. As the encryption function can be parameterized by the memory sector address, or by the memory sector data itself, the final location of any data portion within the data block is not predefined.


In FIG. 6 is shown a third embodiment of an encryption method wherein the encryption method is a combination of the encryption by encoding method of FIG. 4 and the encryption by scrambling method of FIGS. 5A or 5B.


With reference to FIG. 6, the user data UD and header data HD in buffer memory 10 are divided into data portions of a determined byte size (e.g. 4 bytes) and shown individually as UD1, UD2, etc. for user data, and HD1, HD2, etc. for header data. The positions of these data portions are scrambled by an address to flash address function A1 as they are transferred between buffer memory 10 and flash memory 12. This function modifies the addresses which are supplied to buffer memory 10 such that the sequence in which data portions are read from buffer memory 10 corresponds to the positional order in which they are required to be located in a memory sector in flash memory 12. The sequence of reading from buffer memory 10 corresponds to the positional order in the memory sector because the data portions are transferred serially to flash memory 12. In FIG. 6, the data portions in the sequence in which they are read from buffer memory 10 are represented as data portions held in a virtual holding memory 11. The A1 function is parameterized by the memory sector address the logical sector data are going to be written to and, in this case, is a simple modification (which is carried out on the hardware) of the byte address on the buffer address bus. The scrambled data in virtual memory 11 are used to generate an error correction code (ECC) field 14. In step 2 every portion of the scrambled data in virtual memory 11 is read and encoded using a data to flash data function D1 and thereafter stored in flash memory 12. The D1 function is parameterized by the memory sector address thus providing different ways of encoding data allocated in different memory sectors. It may also be parameterized by the data portion address within the memory sector, thus providing different ways of encoding different data portions belonging to the same logical sector and allocated in the same memory sector.


The encrypted data in the flash memory 12 can be read by carrying out the reverse operation. Thus, the flash memory sector data are decoded by flash data to data function D1′. The ECC is checked using the original ECC and the decoded data. The decoded data is then unscrambled by flash address to address function A1′.


As is shown in FIG. 7, the order in which the scrambling and encoding functions are applied can be interchanged. In this case, a two stage process is used to achieve encoding of the data portions by function D1 with generation of an ECC field, followed by scrambling by function A1. In the first stage, data portions are read from buffer memory 10 in sequential order with each being encoded inturn by function D1, and ECC field 14 is generated and stored in ECC block 20. The encoded data portions are not physically stored but the process of encoding them is represented in FIG. 7 by the creation of virtual holding memory 11. The second stage is equivalent to scrambling the data portions and ECC portions in virtual holding memory 11 by function A1 and writing them to flash memory 12. This is achieved by implementing the scrambling and encoding process described with reference to FIG. 6 with the additional step of executing scrambling function A1 on the stored ECC portions and transferring them to flash memory 12 together with the scrambled data portions. This order of encryption followed by scrambling provides the additional advantage of scrambling the ECC field 14 as well as the user data UD and header data HD. As before, the reading of the encrypted data is achieved by carrying out the reverse process with the ECC being checked as before.


The processing of the data, in order to encrypt or decrypt the data respectively, can be implemented in a ‘security block’ within either processor firmware of a memory system or within hardware of the memory device.


In FIG. 8 there is shown a hardware implementation of a security block 39 within which the encryption and decryption process detailed in FIG. 9, including that detailed in the embodiment of FIG. 6, is carried out. The hardware in which the security block 39 is located comprises processor 32, host interface 16, sector buffer SRAM 10, memory port 22 (i.e. flash memory interface) and ECC generator 20, together with an address multiplexer 50, security block 39 being formed by a D1/D1′ converter 54, a D2/D2′ converter 58, a D3/D3′ converter 62, and an A1/A1′ converter 56.


The block of data (comprising 512 bytes of user data) is generated by the host, via the host interface 16 and is located in buffer memory 10 prior to any modification, having an appropriate header of 4 bytes added to the end. The block of data is represented by a plurality of contiguously addressed data portions represented as before as UD1, UD2 . . . , and H1, H2, . . . The A1 converter 56 scrambles and data block by modifying the data portion address issued by the memory port module 22 for any of the data portions being input by the host and the overhead data generated by the controller. This is in contrast to the typical memory port function of just counting the data portions to be written to the memory (not shown). In this case the A1 converter 56 is an address mixer which perform, for example an XOR function on each portion address. This means that the user data, supplied by the host, is mixed with the header data located in the sector buffer SRAM 10. In the simplest case only the 4 byte sector header data is pre-written to the sector buffer SRAM 10. The scrambled data is then sent to converter 54 which performs encoding function D1, which is an XOR function with a parameter, upon each of the scrambled and D1 encoded data portions. At the same time as this, the ECC block generator 20 generates the ECC using the scrambled and D1 encoded data. The ECC data, and scrambled and D2 encoded data are both then written to converter 62 which performs encoding function D3, which is, for example an XOR function with a parameter, on all the data being written to the memory including the ECC block. The encrypted data is then written to the memory via memory port 22. It can be seen from FIG. 8 that the ECC block 20 is arranged so that it always receives data which has already been scrambled and/or encoded.


In FIG. 9 is shown a schematic representation of the data modifications of an example encryption process which is implemented tin the hardware of FIG. 8. The user data is located in buffer memory 10 with the appropriate header data added at the end. The A1 function, step 1, which in this case is a simple modification of the byte address of each data portion of the buffer address bus, scrambles together the user data and header data. The scrambling function is provided ‘on the fly’ by the A1 converter 56, i.e. part of the hardware. The A1 function is parameterized by the address of the memory sector thus providing an extra level of security by blurring out data patterns. The user data supplied by the host may also be used as a parameter. Every portion of the scrambled data is then encoded using encoding function D1 which is as before an XOR with a parameter. As before the XOR function D1 is parameterized by the memory sector address and the data portion address within the memory sector. The scrambled and D1 encoded data is used to generate the ECC field in ECC block generator 20. The scrambled and D1 encoded data is also sent to converter 58 where it is further encoded by XOR encoding function D2, which is parameterized in the same manner as function D1. The scrambled and D1/D2 encoded data is then sent, along with the ECC, to converter 62 which performs the XOR encoding function D3 on each portion of data thus providing encrypted data which is sent to the flash memory via memory port 22. When data is being read from the memory, the converters 62, 58 and 54 perform the decoding functions D3′, D2′ and D1′ respectively, each of which is an XOR function.


In the decryption process corresponding to the encryption process of FIG. 9, the memory data is read via memory port 22 and is decoded by functions D3′, D2′ and D1′ respectively which are the same XOR functions as D3, D2 and D1 respectively. The ECC is checked using the decoded data and the original ECC and, if necessary, error correction is performed. The decoded data is then unscrambled by the A1′ function of converter 56 providing the original user data and header data.


The security block 39, such as that of FIG. 8 in which the encryption/decryption process is implemented, can be inserted in various memory systems. A first example of such a memory system is shown in FIG. 10, which is similar to the system shown in FIG. 1, wherein security block 39 is inserted in the data bus and buffer memory address bus connecting the sector buffer memory 10 to the data path controller 18, the ECC generator and checker 20 and the flash memory interface 22. By positioning the security block 39 on the data bus it allows flexibility to encrypt the user data and header data, either before the ECC is generated (in parallel with the ECC generation) or, if desired, the user data and header data (which may already by encrypted) can be encrypted together with the generated ECC data. The positioning of the security block 39 on the buffer memory address bus allows it to modify the address generated by flash memory interface 22 in FIG. 10.


In an alternative system, shown in FIG. 11, which is similar to that of FIG. 3, the security block is implemented as part of an interface 39A between memory controller 46 and memory 48 within the memory card 41. This provides the memory card 41 with both password protection at the secure memory card interface 44 and encryption protection at interface 39A.


Various modifications may be made to the invention as hereinabove described without departing from the scope of the invention. For example, in the examples shown the buffer memory stores data which has been written to it by the host. However, it may alternatively store data from a variety of sources such as the control processor. The memory which the encryption process protects may be any non-volatile memory such as flash memory. As described, the encoding function which is applied to each data portion is the same for each data portion. However, in order to provide a higher level of encryption the encoding function may be different for each data portion which is encoded. Furthermore, the encoding function has been described as an XOR with a parameter. However, it may alternatively be a parameterized barrel shift function, a combination of an XOR function and barrel shift function or any other similarly symmetric function. If the encoding function is non-symmetric the decoding function required will be the reverse of the encoding function first applied and not merely the same function applied again.


It should be noted that the encryption method which is detailed in the description is an example only and alternative, more complex data encryption methods, such as complex scrambling or encoding functions, may be implemented in the same manner.


It should also be noted that the encryption process may be applied to the user data only. Alternatively, it may, as described, be applied to all of the data thus additionally protecting the data structure.


In the example of encryption given in FIGS. 8 and 9, the ECC is generated in the ECC generator before being written to converter 62 where it is encoded with all the other data. However, in general, ECC is generated ‘on the fly’ and copied directly from the ECC generator to the flash interface. Another method which may be employed however is the pre-generation of ECC wherein it is copied to the sector buffer SRAM and from there is scrambled and/or encoded with all the other data. Also, in the shown examples, the ECC checking is carried out on data which is read from the non-volatile memory. However, the ECC checking could be carried out on data which is first transferred to the sector buffer from the non-volatile memory and then transferred from the sector buffer to the ECC block. It should also be noted that the parameters which define the encryption process may be defined by a variety of factors, such as the controller processor, or some predefined value which may be any number; for example, the serial number unique to each memory device.


Other factors which may define the parameters are, for example, the data portion address within a sector, which can be used for encoding only and acts to “blur” data having the same pattern, the memory sector address, which can be used to provide different encryption of the same data or sector written at different locations within the memory. Alternatively, using up to all of the sector data as a parameter makes the final data partitioning, as a result of data scrambling, unpredictable. Therefore, in order to work out the parameter, up to all of the sector data should be read first. Another alternative factor, which may be used to define a parameter, is a user password that can be used to protect the user data only, in which case only the user data is encrypted, or can be used to protect all of the sector data, in which case the overheads and control data structures are also encrypted. This latter case makes the card unusable by another user because, in order to decrypt the data and/or allow the memory system to find the data, the user password should be given by the host first.


It is also the case that in some embodiments the security block, in which the encryption is carried out, may be implemented as a controller processor firmware function without any need for change in the physical controller architecture providing it has access to an ECC block and a sector butter SRAM. This would mean that the processor could move data from one location in SRAM to another location, thus simulating the A1 function. IT would be capable of reading the ECC field from the ECC block and copying this to the SRAM and any data within the sector buffer SRAM could be modified within the processor, thus implementing D1, D2 and D3 function equivalents.


Another modification which may be made is that the sector buffer SRA may be either a dual port RAM or a single port RAM with shared access.


Although the present invention has been described in terms of specific embodiments it is anticipated that alterations and modifications thereof will no doubt become apparent to those skilled in the art. It is therefore intended that the following claims be interpreted as covering all such alterations and modification as fall within the true spirit and scope of the invention.

Claims
  • 1. A method of processing sector data before being written or stored in non-volatile memory comprising: Receiving sector data for writing to the non-volatile memory, the sector data including user data and associate header data;Storing the received sector data in byte portions within a buffer memory; andEncrypting the sector data before the sector data is written to non-volatile memory wherein a scrambling function is performed to modify the address of the byte portions to mix the byte portions when the same is stored within the non-volatile memory so that the byte portions are each located at an address within the non-volatile memory which is different from the original address of the byte portions within the buffer memory.
  • 2. A method of processing data, as recited in claim 1, further including retrieving the scrambled sector data to form retrieved scrambled sector data and decrypting the retrieved scrambled sector data by using a descrambling function on the byte portions of the retrieved data.
  • 3. A method of processing data, as recited in claim 1, wherein performing the scrambling function ‘on the fly’.
  • 4. A memory system for receiving sector data from a host system and for writing thereof comprising: non-volatile memory arranged to present the logical characteristics of a disc storage device to a host system; anda controller having buffer memory and for managing sector data transfers to and from the non-volatile memory, the controller being adapted reversibly to encrypt the sector data before the sector data is written to non-volatile memory wherein a scrambling function is performed to modify the address of the byte portions to mix the byte portions when the same is stored within the non-volatile memory so that the byte portions are each located at an address within the non-volatile memory which is different from the original address of the byte portions within the buffer memory.
  • 5. A memory system, as recited in claim 4, wherein the sector data includes user data and associate header data.
  • 6. A memory system, as recited in claim 5, wherein the scrambling function acts to modify the byte address of each byte portion within the buffer memory.
  • 7. A memory system, as recited in claim 6, wherein, the scrambling function scrambles together the user data and header data.
  • 8. A memory system, as recited in claim 7, including a first converter for performing the scrambling function.
  • 9. A memory system, as recited in claim 6, wherein the scrambling function is performed ‘on the fly’.
  • 10. A memory system, as recited in claim 6, wherein the scrambling function is parameterized by the address of the sector.
  • 11. A memory system, as recited in claim 6, wherein the user data is used as a parameter.
  • 12. A memory system, as recited in claim 6, further including a second converter for encoding every portion of the scrambled sector data using an encoding function D1.
  • 13. A memory system, as recited in claim 12, further including an ECC block generator coupled between the buffer memory and the non-volatile memory for scrambling and encoding the sector data to generate an ECC field.
  • 14. A memory system, as recited in claim 12, further including a third converter for further encoding the scrambled and encoded data using an encoding function D2.
  • 15. A memory system, as recited in claim 14, wherein the encoding functions D1 and D2 are performed with parameters in the same manner.
  • 16. A memory system for receiving sector data from a host system and for writing thereof comprising: non-volatile memory arranged to present the logical characteristics of a disc storage device to a host system: anda controller having buffer memory and for managing sector data transfers to and from the non-volatile memory, the controller being adapted reversibly to encrypt the sector data before the sector data is written to non-volatile memory, the sector data including user data and associate header data wherein a scrambling function is performed to modify the address of the byte portions to mix the byte portions when the same is stored within the non-volatile memory so that the byte portions are each located at an address within the non-volatile memory which is different from the original address of the byte portions within the buffer memory, wherein the scrambling function acts to modify the byte address of each byte portion within the buffer memory;a first converter for encoding every portion of the scrambled sector data using an encoding function D1;a third converter for further encoding the scrambled and encoded data using an encoding function D2;a third converter for receiving the scrambled and encoded data D1 and D2 and the ECC field for performing an encoding function thereon using an encoding function D3 on each portion of the sector data thus providing encrypted data which is sent to the non-volatile memory.
  • 17. A memory system, as recited in claim 16, wherein the first and second converters are used to perform decoding functions when data is being read from the non-volatile memory.
US Referenced Citations (269)
Number Name Date Kind
4099069 Cricchi et al. Jul 1978 A
4130900 Watanabe Dec 1978 A
4210959 Wozniak Jul 1980 A
4309627 Tabata Jan 1982 A
4355376 Gould Oct 1982 A
4398248 Hsia et al. Aug 1983 A
4405952 Slakmon Sep 1983 A
4414627 Nakamura Nov 1983 A
4450559 Bond et al. May 1984 A
4456971 Fukuda et al. Jun 1984 A
4468730 Dodd et al. Aug 1984 A
4473878 Zolnowsky et al. Sep 1984 A
4476526 Dodd Oct 1984 A
4498146 Martinez Feb 1985 A
4525839 Nozawa et al. Jun 1985 A
4532590 Wallach et al. Jul 1985 A
4609833 Gutterman Sep 1986 A
4616311 Sato Oct 1986 A
4654847 Dutton Mar 1987 A
4710871 Belknap et al. Dec 1987 A
4746998 Robinson et al. May 1988 A
4748320 Yorimoto et al. May 1988 A
4757474 Fukushi et al. Jul 1988 A
4774700 Satoh et al. Sep 1988 A
4780855 Iida et al. Oct 1988 A
4788665 Fukuda et al. Nov 1988 A
4797543 Watanabe Jan 1989 A
4800520 Iijima Jan 1989 A
4829169 Watanabe May 1989 A
4843224 Ohta et al. Jun 1989 A
4896262 Wayama et al. Jan 1990 A
4914529 Bonke Apr 1990 A
4920518 Nakamura et al. Apr 1990 A
4924331 Robinson et al. May 1990 A
4943745 Watanabe et al. Jul 1990 A
4953122 Williams Aug 1990 A
4970642 Yamamura Nov 1990 A
4970727 Miyawaki et al. Nov 1990 A
5070474 Tuma et al. Dec 1991 A
5093785 Iijima Mar 1992 A
5150407 Chan Sep 1992 A
5168465 Harari Dec 1992 A
5198380 Harari Mar 1993 A
5200959 Gross et al. Apr 1993 A
5218695 Noveck et al. Jun 1993 A
5220518 Haq Jun 1993 A
5226168 Kobayashi et al. Jul 1993 A
5227714 Lou Jul 1993 A
5253351 Yamamoto et al. Oct 1993 A
5267218 Elbert Nov 1993 A
5268318 Harari Dec 1993 A
5268870 Harari Dec 1993 A
5270979 Harari et al. Dec 1993 A
5293560 Harari Mar 1994 A
5297148 Harari et al. Mar 1994 A
5303198 Adachi et al. Apr 1994 A
5305276 Uenoyama Apr 1994 A
5305278 Inoue Apr 1994 A
5315541 Harari et al. May 1994 A
5315558 Hag May 1994 A
5329491 Brown et al. Jul 1994 A
5337275 Garner Aug 1994 A
5341330 Wells et al. Aug 1994 A
5341339 Wells Aug 1994 A
5341341 Fukazo Aug 1994 A
5353256 Fandrich et al. Oct 1994 A
5357475 Hasbun et al. Oct 1994 A
5359569 Fujita et al. Oct 1994 A
5365127 Manley Nov 1994 A
5369615 Harari et al. Nov 1994 A
5371702 Nakai et al. Dec 1994 A
5381539 Yanai et al. Jan 1995 A
5382839 Shinohara Jan 1995 A
5384743 Rouy Jan 1995 A
5388083 Assar et al. Feb 1995 A
5392356 Konno et al. Feb 1995 A
5396468 Harari et al. Mar 1995 A
5404485 Ban Apr 1995 A
5406527 Honma Apr 1995 A
5418752 Harari et al. May 1995 A
5422842 Cernea et al. Jun 1995 A
5422856 Sasaki et al. Jun 1995 A
5428621 Mehrotra et al. Jun 1995 A
5430682 Ishikawa et al. Jul 1995 A
5430859 Norman et al. Jul 1995 A
5431330 Wieres Jul 1995 A
5434825 Harari Jul 1995 A
5438573 Mangan et al. Aug 1995 A
5465235 Miyamoto Nov 1995 A
5465338 Clay Nov 1995 A
5471478 Mangan et al. Nov 1995 A
5473765 Gibbons et al. Dec 1995 A
5479638 Assar et al. Dec 1995 A
5485595 Assar et al. Jan 1996 A
5490117 Oda et al. Feb 1996 A
5495442 Cernea et al. Feb 1996 A
5504760 Harari et al. Apr 1996 A
5508971 Cernea et al. Apr 1996 A
5513138 Manabe et al. Apr 1996 A
5515333 Fujita et al. May 1996 A
5519847 Fandrich et al. May 1996 A
5523980 Sakui et al. Jun 1996 A
5524230 Sakaue et al. Jun 1996 A
5530673 Tobita et al. Jun 1996 A
5530828 Kaki et al. Jun 1996 A
5530938 Akasaka et al. Jun 1996 A
5532962 Auclair et al. Jul 1996 A
5532964 Cernea et al. Jul 1996 A
5534456 Yuan et al. Jul 1996 A
5535328 Harari et al. Jul 1996 A
5541551 Brehner et al. Jul 1996 A
5544118 Harari Aug 1996 A
5544356 Robinson et al. Aug 1996 A
5552698 Tai et al. Sep 1996 A
5554553 Harari Sep 1996 A
5563825 Cernea et al. Oct 1996 A
5566314 DeMarco et al. Oct 1996 A
5568439 Harari Oct 1996 A
5572466 Sukegawa Nov 1996 A
5579502 Konishi et al. Nov 1996 A
5581723 Hasbun et al. Dec 1996 A
5583812 Harari Dec 1996 A
5592415 Kato et al. Jan 1997 A
5592420 Cernea et al. Jan 1997 A
5596526 Assar et al. Jan 1997 A
5598370 Niisima et al. Jan 1997 A
5602987 Harari et al. Feb 1997 A
5603001 Sukegawa et al. Feb 1997 A
5606660 Estakhri et al. Feb 1997 A
5611067 Okamoto et al. Mar 1997 A
5640528 Harney et al. Jun 1997 A
5642312 Harari Jun 1997 A
5648929 Miyamoto Jul 1997 A
5663901 Wallace et al. Sep 1997 A
5666516 Combs Sep 1997 A
5693570 Cernea et al. Dec 1997 A
5712819 Harari Jan 1998 A
5719808 Harari et al. Feb 1998 A
5723990 Roohparvar Mar 1998 A
5734567 Griffiths et al. Mar 1998 A
5745418 Ma et al. Apr 1998 A
5754567 Norman May 1998 A
5757712 Nagel et al. May 1998 A
5758100 Odisho May 1998 A
5761117 Uchino et al. Jun 1998 A
5765197 Combs Jun 1998 A
5768190 Tanaka et al. Jun 1998 A
5768195 Nakamura et al. Jun 1998 A
5773901 Kanter Jun 1998 A
5778418 Auclair et al. Jul 1998 A
5781478 Takeeuchi et al. Jul 1998 A
5787445 Daberko Jul 1998 A
5787484 Norman Jul 1998 A
RE35881 Barrett et al. Aug 1998 E
5799168 Ban Aug 1998 A
5802551 Komatsu et al. Sep 1998 A
5809515 Kaki et al. Sep 1998 A
5809558 Matthews et al. Sep 1998 A
5809560 Schneider Sep 1998 A
5818350 Estakhri et al. Oct 1998 A
5818781 Estakhri et al. Oct 1998 A
5822245 Gupta et al. Oct 1998 A
5822252 Lee et al. Oct 1998 A
5822781 Wells et al. Oct 1998 A
5831929 Manning Nov 1998 A
5835935 Estakhri et al. Nov 1998 A
5838614 Estakhri et al. Nov 1998 A
5845313 Estakhri et al. Dec 1998 A
5847552 Brown Dec 1998 A
5860083 Sukeawa Jan 1999 A
5860124 Matthews et al. Jan 1999 A
5862099 Gannage et al. Jan 1999 A
5890192 Lee et al. Mar 1999 A
5901086 Wang et al. May 1999 A
5907856 Estakhri et al. May 1999 A
5909586 Anderson Jun 1999 A
5920884 Jennings, III et al. Jul 1999 A
5924113 Estakhri et al. Jul 1999 A
5928370 Asnaashari Jul 1999 A
5930815 Estakhri et al. Jul 1999 A
5933368 Ma et al. Aug 1999 A
5933846 Endo Aug 1999 A
5936971 Harari et al. Aug 1999 A
5937425 Ban Aug 1999 A
5953737 Estakhri et al. Sep 1999 A
5956473 Ma et al. Sep 1999 A
5959926 Jones et al. Sep 1999 A
5966727 Nishino Oct 1999 A
5986933 Takeuchi et al. Nov 1999 A
5987563 Itoh et al. Nov 1999 A
5987573 Hiraka Nov 1999 A
5991849 Yamada et al. Nov 1999 A
6011322 Stumfall et al. Jan 2000 A
6011323 Camp Jan 2000 A
6018265 Keshtbod Jan 2000 A
6021408 Ledain et al. Feb 2000 A
6026020 Matsubara et al. Feb 2000 A
6026027 Terrell, II et al. Feb 2000 A
6034897 Estakhri et al. Mar 2000 A
6035357 Sakaki Mar 2000 A
6040997 Estakhri Mar 2000 A
6041001 Estakhri Mar 2000 A
6047352 Lakhani et al. Apr 2000 A
6055184 Acharya et al. Apr 2000 A
6055188 Takeuchi et al. Apr 2000 A
6069827 Sinclair May 2000 A
6072796 Christensen et al. Jun 2000 A
6076137 Asnaashari Jun 2000 A
6081447 Lofgren et al. Jun 2000 A
6081878 Estakhri et al. Jun 2000 A
6084483 Keshtbod Jul 2000 A
6089460 Hazama Jul 2000 A
6097666 Sakui et al. Aug 2000 A
6115785 Estakhri et al. Sep 2000 A
6122195 Estakhri et al. Sep 2000 A
6122716 Combs Sep 2000 A
6125424 Komatsu et al. Sep 2000 A
6125435 Estakhri et al. Sep 2000 A
6128695 Estakhri et al. Oct 2000 A
6134145 Wong Oct 2000 A
6134151 Estakhri et al. Oct 2000 A
6141249 Estakhri et al. Oct 2000 A
6145051 Estakhri et al. Nov 2000 A
6151247 Estakhri et al. Nov 2000 A
6172906 Estakhri et al. Jan 2001 B1
6173362 Yoda Jan 2001 B1
6181118 Meehan et al. Jan 2001 B1
6182162 Estakhri et al. Jan 2001 B1
6202138 Estakhri et al. Mar 2001 B1
6223308 Estakhri et al. Apr 2001 B1
6226708 McGoldrick et al. May 2001 B1
6230234 Estakhri et al. May 2001 B1
6262918 Estakhri et al. Jul 2001 B1
6272610 Katayama et al. Aug 2001 B1
6275436 Tobita et al. Aug 2001 B1
6279069 Robinson et al. Aug 2001 B1
6279114 Toombs et al. Aug 2001 B1
6282651 Ashe Aug 2001 B1
6285607 Sinclair Sep 2001 B1
6327639 Asnaashari Dec 2001 B1
6345367 Sinclair Feb 2002 B1
6374337 Estakhri Apr 2002 B1
6385667 Estakhri et al. May 2002 B1
6393513 Estakhri et al. May 2002 B2
6397314 Estakhri et al. May 2002 B1
6411546 Estakhri et al. Jun 2002 B1
6467021 Sinclair Oct 2002 B1
6490649 Sinclair Dec 2002 B2
6567307 Estakhri May 2003 B1
6578127 Sinclair Jun 2003 B1
6587382 Estakhri et al. Jul 2003 B1
6711059 Sinclair et al. Mar 2004 B2
6721819 Estakhri et al. Apr 2004 B2
6721843 Estakhri Apr 2004 B1
6725321 Sinclair et al. Apr 2004 B1
6728851 Estakhri et al. Apr 2004 B1
6751155 Gorobets Jun 2004 B2
6757800 Estakhri et al. Jun 2004 B1
6772274 Estakhri Aug 2004 B1
6813678 Sinclair et al. Nov 2004 B1
6898662 Gorobets May 2005 B2
6898721 Schmidt May 2005 B2
6912618 Estakhri et al. Jun 2005 B2
6950918 Estakhri Sep 2005 B1
6957295 Estakhri Oct 2005 B1
6973519 Estakhri et al. Dec 2005 B1
6978342 Estakhri et al. Dec 2005 B1
7000064 Payne et al. Feb 2006 B2
20030033471 Lin et al. Feb 2003 A1
Foreign Referenced Citations (82)
Number Date Country
0 557 723 Jan 1987 AU
0 220 718 May 1987 EP
0 243 503 Nov 1987 EP
0 392 895 Oct 1990 EP
0 424 191 Apr 1991 EP
0 489 204 Jun 1992 EP
0 522 780 Jan 1993 EP
0 537 925 Apr 1993 EP
0 544 252 Jun 1993 EP
0 613 151 Aug 1994 EP
0 617 363 Sep 1994 EP
0 619 541 Oct 1994 EP
0 663 636 Jul 1995 EP
0 686 976 Dec 1995 EP
0 897 579 Jul 2000 EP
1 043 860 Oct 2000 EP
0 891 580 Nov 2000 EP
0 896 699 Nov 2000 EP
1 056 015 Nov 2000 EP
1 074 906 Feb 2001 EP
0 852 766 May 2001 EP
0 852 765 Sep 2001 EP
0 722 585 May 2002 EP
0 910 826 Jun 2002 EP
0 691 008 Nov 2002 EP
0 861 468 Apr 2003 EP
0 978 040 May 2004 EP
1 157 328 May 2005 EP
93 01908 Aug 1993 FR
2 251 323 Jul 1992 GB
2 291 990 Feb 1996 GB
2 291 991 Feb 1996 GB
2 297 637 Aug 1996 GB
2 304 428 Mar 1997 GB
2 348 991 Dec 2002 GB
2 351 822 Jan 2003 GB
2 384 337 Jul 2003 GB
2 384 883 Oct 2005 GB
2 384 338 Nov 2005 GB
2 384 072 Dec 2005 GB
2 411 499 Feb 2006 GB
117881 May 2003 IS
59-45695 Sep 1982 JP
58-215794 Dec 1983 JP
58-215795 Dec 1983 JP
59-162695 Sep 1984 JP
60-212900 Oct 1985 JP
61-96598 May 1986 JP
62-283496 Dec 1987 JP
62-283497 Dec 1987 JP
63-183700 Jul 1988 JP
1-138694 May 1989 JP
3-228377 Oct 1991 JP
4-57295 Feb 1992 JP
4-254994 Sep 1992 JP
4-268284 Sep 1992 JP
4-278297 Oct 1992 JP
4-332999 Nov 1992 JP
5-128877 May 1993 JP
5-282883 Oct 1993 JP
6-36578 Feb 1994 JP
6-124175 May 1994 JP
6-124231 May 1994 JP
6-131889 May 1994 JP
6-132747 May 1994 JP
6-149395 May 1994 JP
6-266596 Sep 1994 JP
7-93499 Apr 1995 JP
7-311708 Nov 1995 JP
8-18018 Jan 1996 JP
8-69696 Mar 1996 JP
9-147581 Jun 1997 JP
138877 Apr 1988 SU
1408439 Jul 1988 SU
1515164 Oct 1989 SU
1541619 Feb 1990 SU
1573458 Jun 1990 SU
1686449 Oct 1991 SU
8400628 Feb 1984 WO
WO 9420906 Sep 1994 WO
WO 9516238 Jun 1995 WO
WO 0026791 May 2000 WO
Related Publications (1)
Number Date Country
20030126451 A1 Jul 2003 US