JPS61273689A - Integrated circuit card containing discriminating means between history information and replacement information - Google Patents

Abstract

PURPOSE:To read out desired information only and to shorten access time by storing both history information and replacement information in each allocated storage area to read these two information with discrimination and at the same time reading the update information only out of the replacement information. CONSTITUTION:An IC module 4 made of a memory chip 41 containing a CPU chip 40 and a PROM 411 like an EEPROM, etc. which can be erased with the ultraviolet rays is buried into an IC card. Then the write data information is written to an area of the chip 41 allocated in response to the history information or the replacement information via a CPU 401, etc. In a reading mode only the latest information is read out of the replacement information. Thus only the desired information is always read out and therefore the access time is shortened.

Description

[Detailed Description of the Invention] (Industrial Application Field) This invention relates to an IC card with a built-in integrated circuit such as a microcomputer or memory, and in particular, it eliminates the waste of F+A records for fluctuating data and speeds up access. The present invention relates to an IC card equipped with means for identifying history information and update information in order to increase versatility.

IC cards are also called smart cards, and in addition to flat-shaped cards, there are also key-shaped, rod-shaped, etc. IC cards, and the term "IC card" in this invention includes all of these.

(Prior Art) Since an IC card has a built-in microcombicoater and memory, it is a small information processing device that has its own judgment and storage functions. Therefore, the confidentiality and security of data can be enhanced compared to magnetic cards conventionally used for credit cards, bank cards, etc. Moreover, due to the progress of IC, the record 1! ! Since the volume of l capacity has increased dramatically, I
C-cards are increasingly expected to be used as data storage cards.

Non-volatile IC memories such as EPROM (erasable programmable read-only memory) and El3FROM (electronic erasable programmable read-only memory) are used for the memory of IC cards. Since these memory cards can retain memory without embedding a power source in the card, they have the advantage of being able to be manufactured with a simple structure, and have been adopted as the main storage means of IC cards to date. However, volatile I such as RAM (Random Access Memory)
C memory can also be used as an IC memory, supported by a continuous power source such as a battery, or as a means for temporarily saving the contents of other memories.

In order to store information on an IC card using these IC memories, the general method is to set up a storage space of an appropriate size in the IC memory and write information sequentially from one end of the memory. It is. Conventionally, the information written in this way can be read out all at once, or the information can be written into multiple storage areas sequentially, and the information can be read out in units of storage areas by specifying the number of the storage area. I was doing it.

(Problem to be Solved by the Invention) In a device that reads out each storage area in this way, even if you want to read out only a part of the information in the storage area, for example, the latest information, the first part of the storage area Since the information is read one after another, it takes time to reach the necessary information, and unnecessary information is also read out at the same time, which poses a security problem.

(Means for Solving the Problems) In the present invention, the latest information is ``Update reading 1'' and history information reading ``Means for allocating the information to multiple storage areas so that the history reading 1 can be identified and executed; It is equipped with means for reading only the latest information.

(Function) In the storage area for update reading, only the latest information is accessed and read out, instead of reading out sequentially from one end of the storage area as in the conventional case. In a storage area that is not designated for update reading, history reading can be performed by sequentially reading from one end of the storage area as before.

(Effects of the Invention) According to the present invention, history information and update information are identified and recorded in storage areas in a readable manner, so when updating and reading only the latest information, old information is Access time is shortened because only the latest information can be directly accessed without having to read it out, and in the case of history reading, the entire fat layer information recorded up to that point can be read out, allowing you to check changes over time. It becomes possible to quickly and accurately obtain information related to the causes of changes, estimates of future trends, etc.

In this way, reading of unnecessary information is avoided and update reading is performed for updated information that requires reading only the latest information, and history information related to items that require reading of all previously recorded information is performed. Since the information is divided and recorded in the storage area so that the fat layer can be read out, the efficiency of reading out the information is improved, speeding up the information processing, and therefore improving the efficiency of IC card usage. can be increased.

(Example) An example of the present invention will be described with reference to the drawings. FIG. 1 is a front view showing the appearance of an embodiment of an IC card according to the present invention, and FIG. 2 is a sectional view showing its internal structure.

IC card 1 is a card made of plastic, etc.
A cavity 3 is formed in a part of the core 2, and an IC module 4 is housed in the cavity 3. , the IC module 4 is equipped with one or two LSI chips. This IC module is provided with eight contact terminals 5 for electrical connection between an external circuit and an electronic circuit in which the IC module 4 is included.

To protect the IC module, the void 3 is filled with filler 6.
Fill it with Also, on the top and bottom of the card core 2 there is a printing layer 7.7.
′ is bonded, and the surface of the printing layer is marked with a pattern or a pattern as necessary.
Characters and the like are printed on it, and its surface is further covered with a protective surface layer 8.8'. Although the thickness is particularly exaggerated in FIG. 2, the actual thickness of the card core is, for example, 0.55 ml.

Print layer 0. lva, surface layer 0.02111, overall 0.
The height is approximately 8a+m. Furthermore, the magnetic stripe 9
The embossed characters 10 are added depending on the purpose and are not essential to the IC card.

FIG. 3 is a block diagram illustrating the configuration of the IC included in the IC module 4, and shows an example of a two-chip configuration of a CPU chip 40 and a memory chip 41.

The OP LJ 401 included in the CPU chip 40 performs program control, the ROM 402 stores programs, etc., and the RAM 403 is a 1Q memory chip 41 that plays the role of temporarily storing data during a program step. There is a PROM, which mainly stores data. There are various types of PROMs, including EPROMs that use ultraviolet rays (when embedded in an IC card, data cannot be erased unless a window is provided to allow the ultraviolet rays to pass through), and EEPROMs that can erase data.

When an IC module for an IC card is configured with one chip using only the CPLJ chip 40 without using the memory chip 41, it may be configured with a CPU, ROM, RAM, etc.

The IC card is used by being connected to a host computer via an IC card reader/writer as shown in FIG.

FIG. 5 does not show the structure of the memory in the embodiment of the present invention. The memory includes a data memory area for storing data, a PIN area for storing PIN numbers, and a security mark area for storing erroneous input of PIN numbers.
Memory format indicating that there is a record in memory
There is a marked area.

FIG. 6 shows the data memory areas in FIG. 5 in more detail, including a plurality of storage areas #1 to #Y and areas #I to #Y provided corresponding to each storage area. A plurality of index areas up to Y are included. In each storage area, history information or update information is stored according to predetermined categories for each item. An index area is provided corresponding to each storage area and used to access the corresponding storage area.

FIG. 7 is a diagram showing in more detail the structure of #N storage area, which is one of the storage areas shown in FIG. 6. #N storage area has X records that can record information from the first time to the xth time, and a flag bit that records the number of times a record has been used to record information. In addition, each code has a check-by code to check for errors when reading recorded information.]
・Do, shi]-do attribute ↑4, for example, shi]-do status by 1 for defining 11-errors in recorded information, etc. are attached.

The information is recorded sequentially from the first time.

When the first record has already been used, the latest information to be recorded next is recorded in the second record.

Therefore, the latest information that occurred at the 01st time is recorded in the mth time. At the same time as these pieces of information are recorded, four required records are also made to Check By 1 and Record Status By 1 to 4.

At least the flag bits have been set and numbered in the storage area concerned, and the number of bits is set to 41, and all of those pins are initially set to 11-1, but new information is written to them. Each time the data is input, one bit is inverted to [OI].

By managing the number of inverted bits, it is possible to manage the records in which the latest information is written and the number of unused records.

FIG. 8 is a diagram showing an example of the structure of the storage area. 7th
The difference from the figure is that the flag bit that was provided at the start address in Figure 7 is attached to each record in Figure 8. It is that they are distributed in F. When these flag bits F are not used, "1" is stored, but when they are used, they are inverted to "01." Therefore, by sequentially checking these flag bits, the latest Record information - You can manage the status and number of unused records.

FIG. 9 is a diagram without showing details of the #N index area, which is one of the index areas shown in FIG. 6. The index area consists of an 8-bit area that stores the start address of #N memory 1, usually the first address, and a 7-bit area that records the record length - 1 in bytes in #N memory. The area consisting of Pitsu 1 ~, [11 for Ill history information, [01 for update information]
r H/ tJ j pit, #N! ir! 1. An area for recording the maximum number of records assigned to the memory area and an area for recording the number of records.
It has an area for recording 1 allocated bye]-number of flag bits located at the first address of the N recording area.

Therefore, the size and number of records of the corresponding storage area can be appropriately specified depending on the type and character of information, and the data memory area can be used effectively.

[The number of allocated bytes - 1 is the value obtained by dividing the maximum number of records 1 by 8 and rounding it down to an integer. Note that the index area is concentrated on the left side of Fig. 6, but the index area is concentrated on the left side of Figure 6.
The Gj may be set up dispersed within the area.

In the embodiment shown in FIG. 7, the corresponding index area is first read out according to the information to be read out, and its r l-1/j
If the J j bit is update information, the flag bit part of the corresponding storage area is read based on the first address stored in the index area, and the record in which the latest information is written is immediately accessed directly from the count value. Also, the 8th
In the example shown in the figure, the starting address is the flag bit F attached to the first record, and this flag bit is read out sequentially for each record, and the flag bit is read out one after the record where "1" is read first. Search and read the latest information record without reading the code. On the other hand, r H/t
When the JJ bit is instructed to read history information, reading is performed sequentially from the first [-] record to the record recording the latest information.

A case where the IC card according to the present invention is applied to the field of medical institutions will be explained based on FIG. 10 as an example. Now, as shown in FIG. 10, information used in medical institutions is classified into seven items such as personal information, medical insurance information, etc. According to this example, personal information is indexed in the #1 index area and its contents are recorded in the #1 storage area. Personal information specifically consists of name, address, date of birth, and telephone number, and these are usually not updated, but even if they are updated like a telephone number, only the latest information needs to be read. from,
The personal information can be said to be updated information as described in the right margin of the #1 storage area. #2 The medical insurance information recorded in the storage area, which includes the type of insurance, company name, office name, and date of qualification acquisition, is also referred to as update information because normally only the latest information needs to be obtained.

#3 Arrangement 1 The allergy information recorded in the area, including the type of allergy and the cause of the allergy, is past information.
) Historical information is important as it serves as reference information for treatment. The other doctor information ■, ■, doctor technical information, and nurse information can also be said to be historical information.

Note that other application examples of this invention include bank deposit management and stock information.

Next, the procedure for writing information will be explained according to the flowchart shown in FIG. Is the specified number of the item of information that needs to be written from outside, for example #N? When the # is set, it is received in step 101, and #
Search N index areas. #N If the index area cannot be found [-J, error processing such as error display is performed in step 103.

In this case, you will need to set the item again.

If the #N index area is found in step 102, step 104F does not read out the leading address part of the corresponding #N storage area based on the leading address stored in the #N index area. Next, in step 105, the information to be written in storage area #N is input, and in step 106, the next bit of the final inversion bit i, for example, the m-th bit, is inverted as the flag bit of storage area #N. In step 107, the input information is written in the first record of the #N storage area. In step 108, a check byte is calculated and written.

Then, in step 109, it is tested whether the written information is accurate. If it is incorrect, the process goes to step 103, where error processing is performed, and if it is correct, the writing is completed.

Reading of the tC card is performed in accordance with the procedure shown in FIG. First, in step 111, a designated number of an item that requires reading inputted from an external device, for example #N.
receive. #N index area is searched in step 112, and if it cannot be found, error processing is performed in step 113, and if it is found, #N index area is searched in step 114.
The first address part of the #N storage area is read from the first address stored in the index area. In step 115, the H/LJ bit of the #N index area is read, and in step 116, it is determined whether the history read is an update read.

When it is determined that update reading is to be performed, the position of the last written flag bit is determined from the flag bit column in step 117, and the position of the last written flag bit is determined from the pin 1- in step 118. Access and output the latest information. Then, in step 119, a check byte is output to confirm whether or not there is an error in the information, and the reading is completed. If it is determined in step 116 that it is history, in step 120 the used bits in the flag bits of the #N storage area are counted and recorded, and the number of codes is determined. In step 121, information on the first record is output, and in step 122, a check byte is output. and the number scheduled in step 123]-
If it is r NO, I, the process returns to step 121 and the information of the next record is output. Thus, if rYEsJ is determined in step 123, all history information is output and reading ends.

FIG. 13 shows another embodiment of the invention. There are cases in which historical information is required for the same information, and cases in which only the latest information is required. For example, if such information is indexed as update information in the #3 index area and read from the #3 storage area, the 1/U of the #3 index area
[0] is recorded in the #N storage area, but when it is also required to read the history of the information recorded in the #N storage area, the other #3' index area of the #3 index area is newly recorded. 1-1 of this index area
It is sufficient to record IJ and make the other areas have exactly the same recording contents as the #3 index area. As a result, when updating and reading the information in the #N storage area, it is sufficient to specify the #3 index area, and when reading the history, it is sufficient to specify the #3' index area.

FIG. 14 shows another embodiment in which both update reading and history reading can be performed for the same information. According to this embodiment, the index area is provided with one bit each for history readout H and update readout bit U. Initially, these two bits both record "1", and when the history is read only, they are set to "1". 1] to "0",
The update read-only sharpener inverts only the bit (J) to rOJ.

Then, to enable reading of both 11 updates, both h1-1 and U are inverted to "0".

FIG. 15 is a flowchart for reading in the embodiment shown in FIG. 14. Since this flowchart is basically similar to that in FIG. 12, only the differences will be explained to avoid duplication of explanation.

In FIG. 15, after reading the first address of the corresponding storage area from the index area in step 114, step 130
Select whether to read the cost history or update the history. It is determined in step 131 whether the selected read has been written to bit H or bit U, and if there is no writing, it is processed as an input error in step 132. Step 13
If YES is determined in step 1, it is determined in step 133 whether history reading or update reading was selected in step 130, and the process is performed in step 120 or step 11, respectively.
Proceed to step 7. The subsequent operations are the same as those in FIG. 12.

[Brief explanation of the drawing]

Fig. 1 is a plan view of a general IC card, Fig. 2 is a sectional view taken along line AA' in Fig. 1, Fig. 3 is a block diagram showing the circuit configuration of the IC card, and Fig. 3 is a block diagram showing the circuit configuration of the IC card. Figure 4 is I
A diagram schematically showing an IC card reader/writer and a host computer used by inserting a C card, Figure 5 is a diagram showing the configuration of the memory area of the IC card, and Figure 6 is a diagram showing the configuration of the data memory area. A diagram showing the configuration, Figure 7 is 1
A diagram showing the configuration of the storage area, FIG. 8 is a diagram showing another example of the configuration of the storage area, FIG. 9 is a diagram showing the configuration of the index area,
FIG. 10 is a diagram showing the configuration of a data memory area for a location application example of this invention, FIG. 11 is a flowchart for explaining the information writing operation in this invention, and FIG. 12 is a diagram showing the write information in this invention. FIG. 13 is a diagram showing the structure of a data memory area showing another embodiment of the invention, and FIG. 14 is an index area showing still another embodiment of the invention. FIG. 15 is a flow chart for explaining the read operation in the embodiment shown in FIG. 14. 1...IC card, 4...IC module,
5...Connection terminal, 40...CPU chip, 401...CP tJ, 402...
・ROM, 403...RAM. 411...PROM.

Claims (5)

[Claims] (1) In an IC card that has a built-in electronic circuit including at least a CPU and a memory, and is capable of writing and reading information, history information and update information can be identified and read out, and each of these pieces of information is stored in multiple storage areas. 1. An IC card equipped with means for identifying history information and update information, comprising means for allocating the information and means for reading only the latest information regarding the update information recorded in the storage area. (2) The allocation means includes a plurality of index areas provided corresponding to the plurality of storage areas, and each index area is used to determine whether the information stored in the corresponding storage area is historical information or updated information. An IC card equipped with means for identifying history information and update information as set forth in claim (1), characterized in that the IC card is provided with a bit that provides information for identifying whether the card is an IC card. (3) Each of the storage areas is provided with a flag bit for recording information indicating that information has been recorded each time information is recorded in each record in the storage area, and the reading means is configured to set the flag bit to the flag bit. Discrimination of history information and update information according to claim 1 or 2, characterized in that the method includes means for accessing a record in which the latest information is recorded based on the recorded information. IC card with means. (4) The allocation means includes two index areas corresponding to at least one storage area, one index area having a bit providing information indicating that it is history information,
The other index area is provided with a means for identifying history information and updated information as set forth in claim (2), wherein the other index area has a bit that provides information indicating that the information is updated information. IC card. (5) The index area has both a first bit giving information indicating that the information is history information and a second bit giving information indicating that the information is update information, and the reading means has the first bit giving information indicating that the information is update information. An IC card equipped with means for identifying history information and update information according to claim (2), further comprising means for selecting one of the first and second bits.