JPS62251992A - File control system for ic card - Google Patents

Abstract

PURPOSE:To obtain an IC card for which cyclical use of the file in a memory is made possible by providing a business area that stores the file in a memory, a directory for controlling the area of the file and controlling information in the directory. CONSTITUTION:An IC card has an incorporated CPU 1 and a memory 2, and the memory 2 has a business area ZA that stores a file and a directory ZD for controlling the file. The file 21 for physically (n) pieces of records of the area ZA is used cyclically, and by cyclical use of a file consisting of (n) pieces of records of fixed length, it appears as a file consisting of 65535 records when number of bytes allotted to logical record number is 2 bytes. Accordingly, though physically active record storing area is (n), it is possible to handle as if a memory space is expanded logically, and logical record number can be used up to 65535 against physical record number (n). In this constitution, recycle information 20 is given to the memory in the IC card and controlled by the CPU, and accordingly, an accessing device 3 can access in logical track number.

Description

[Detailed Description of the Invention] [Table of Contents] Overview Industrial Application Fields Conventional Technology Problems to be Solved by the Invention Means for Solving the Problems (Fig. 1) Working Examples (al-Configuration of Examples) (Fig. 2, Fig. 3, Fig. 4) (bl-Explanation of operation of embodiments (Fig. 5, Fig. 6, Fig. 7, Fig. 8)) (C1 Description of other embodiments Invention Effects ((Required)) In an IC card with a built-in processor and memory, a business area for storing files in memory and a directory for file area management are provided, and control information for circulating files in the directory is provided. By providing this, files in memory can be used cyclically.

[Industrial application field]

The present invention relates to a file control method that allows files such as history files in the memory to be used cyclically in an IC card that has a built-in processor and memory, and in particular to an IC card that has a built-in processor and memory.
The present invention relates to a file control method for an IC card that enables cyclic use to be controlled by the card's processor.

2. Description of the Related Art Cards with magnetic stripes are widely used as cards for users to receive various services, and are used as bank cards, credit cards, and the like.

Such cards with magnetic stripes store only a small amount of information and are not secure enough.
In recent years, IC cards with built-in IC processors and memory have been attracting attention.

Such an IC card can store information files for a plurality of services using an IC memory, and is often used as a multi-function card for multi-services.

In particular, the memory capacity of an IC card is limited, and when a large number of files are stored, the file capacity is also limited, so it is desired to make effective use of such files.

[Conventional technology]

The IC card has a processor (CPU) as shown in Figure 9.
) 1 and a memory 2, and is connected to an access device W3 including an IC card reader/writer via contacts or the like, and exchanges data with the access device 3 via the CPU 1.

The storage area of the memory 2 of this IC card used a layout-free fixed format in single-function cards with only a single service, but the access device 3 needs to specify the absolute address of the memory 2. In addition, in order to use it as a multifunctional card, it is necessary to fix the layout in advance, so there is a drawback that it lacks expandability. In order to solve this problem, a method for managing the area of the memory 2 has been proposed.

In this conventional proposal, the format of the memory 2 is a system zone ZS for storing data necessary for the system such as PIN (Personal Identification Number), a directory zone ZD for area management, and a system zone ZD for storing business information files. The directory zone ZD is divided into a business information area ZC and a history information area ZT for storing H-layer information files.
An area management department and a Z'F area management department were provided.

For example, for a bank POS application (service) ■, the business information necessary for the service such as the bank name, ownership name, account number, etc. is stored in the file ZCI of the business area ZC. date of use, etc.) are stored in the file ZTI of the history area ZT, and also for the following credit application (service) ■ and firm banking application (service) ◎.
File ZC3 in area ZC and file Z in area ZT
T3, file ZC4 in area ZC, and file ZT4 in area ZT are associated with each other, and this correspondence is managed by the ZC area management unit and the Z T area management unit of the directory zone ZD, respectively.

If such area management is performed, the access device 3 of the center or terminal will be able to access files without being aware of the physical (absolute) address of the memory 2, facilitating multi-functional services and improving system expandability. This has the advantage of being compatible with other systems, making it easier to provide multi-functional services.

[Problem that the invention seeks to solve]

If the memory area is managed in this way, the size of the file in the memory can be set freely, and the file size can be determined according to the requirements of the application, providing flexibility.

However, in order to use it as a multifunctional card, it is necessary to store a large number of files in the memory, which naturally limits the file size. For example, the file is set to a size that can physically accommodate location records as shown in FIG.

Such files, especially usage history files, are
The usage history of each offline credit transaction or bank PO3 transaction with the card is sequentially written as a record.

Therefore, once a location record is written, it is no longer possible to write to the file, resulting in a problem that credit transactions using the IC card are no longer possible.

SUMMARY OF THE INVENTION In view of the above problems, it is an object of the present invention to provide a file control method for an IC card that allows files in a memory to be used cyclically under the control of a processor of the IC card.

[Failure to solve the problem]

FIG. 1 is a diagram explaining the principle of the present invention.

In FIG. 1(A), the same parts as those shown in FIG. 9 are indicated by the same symbols, and ZA is a business area, which stores files 21 created as necessary. ,2
0 is Lily cycle control information,
This is set to recycle files in ZD.

Further, the CPU 1 is configured to control the recycling of the files 21 in the business area ZA using the recycling system 1ffl information 20 of the directory ZD.

[Effect]

In the present invention, the file 21 physically containing n records shown in FIG. 1(B) is recycled as shown by the arrow. That is, physically, by using the file 21 consisting of fixed-length records of the location as a wX ring, logically, as shown in Figure 1 (C), 65535 (bytes assigned to the logical record number) (If the number is 2 bytes)
I'm trying to make it look like a file consisting of records.

Therefore, although the logically active record storage area is n, logically it can be handled as if the memory space has been expanded, and therefore logical record numbers up to 65535 can be used for physical record number n. can.

Such file recycling itself is known in the computer field, but in the present invention, the memory in the IC card is provided with a recycling control mechanism 20, and the IC card is
The card's cput controls recycling. Therefore, users can carry various access devices 3.
File recycling a related to the IC card set in
Therefore, there is no need to perform file recycling control on the access device 3 side, and the access device 3 can access the file using the logical trunk number without being aware of the file capacity.

〔Example〕

(Description of the structure of an embodiment) FIG. 2 is a block diagram of an embodiment of the present invention, FIG. 3 is a detailed block diagram of a directory, and FIG. 4 is an explanatory diagram of recycling control information.

In the figure, the same parts as shown in FIGS. 1 and 9 are indicated by the same symbols, and 4 is a program memory;
In addition to storing security programs such as PIN verification, access processing programs including a write processing program (Fig. 5), a read processing program (Fig. 7), and a delete processing program (Fig. 6) are stored. 5
is a bus that exchanges commands/data between the CPUI, memory 2, program memory 4, and access device 3.

Memory 2 has a system zone ZS, a directory zone ZD, and a business zone ZA set up, and the system zone ZS contains manufacturer manufacturing information and a system area (PIN
Data area start address, issuer-ID start area address, ZD area start address), PIN data, and issuer ID (SecreL No.) are stored, and these are created and set by the card issuer. .

On the other hand, the directory zone ZD stores an overall management section and area management cells (hereinafter referred to as cells) ln corresponding to each created file.

Also, the business zone ZA is the system zone ZS of memory 2.
An area excluding the directory zone ZD is allocated and can accommodate, for example, n files.

In this embodiment, unlike the conventional example shown in FIG. 9, the business zone ZA is provided as a common storage area for the business information file and the history information file, so the area is not divided as shown in FIG. , memory can be used more effectively and file access can be made easier.

As shown in Figure 3 (A), the format of the overall management section of the directory zone ZD is as follows. Business zone Z to the start address NC indicated by the number of bytes from the start.
Start address ZAA indicating the start address of A and 2Δ total size ZAS indicating the overall size of business zone ZA. File start indicating the start address of the next registered file in business zone ZA as the number of bytes from the beginning of business zone ZA. It includes addresses NF8, a reserved area for these addresses, and data CRC for 1,000 nicks.

Therefore, as shown in FIG. 3, the overall management section has the entire ZD size ZDS and the next registration cell start address NCA for managing the directory zone ZD, and uses these to register cells for file creation. Then, the business zone ZA is set using the ZA4Jll area start address ZAΔ, ZA entire search ZAS, and next registered file start address NFA.
Assign the creation file to .

On the other hand, the formant of each cell in the directory zone ZD, as shown in FIG. The file size F as a hide number, the file organization indicating whether it is a circular organization file, the record format of the file, the record IR of each record of the file, the storage address of the next registered record from the oldest record storage address, B, the oldest record relative record number C, the number of stored records, a reserve area for these, and CRC check data CRC. Therefore, cells are provided for area management of files created in the business zone ZA, and indicate the starting position and size of the file in the business zone ZA by the start relative address FSΔ and file size F, and by the file organization. Indicates whether the file is a circular (recycle) organization file, and further includes the oldest record storage address A, next registered storage address B, obsolete code relative record number C1, and the number of stored records as recycling control information for the file. It is being

To explain this recycling control information with reference to FIG. 4, the oldest record storage address A is the first address of the record written earliest in the file, expressed as a relative address from the beginning of the file area. Figure 1 (
This is the start address of the active area of C). Further, the next registered record storage address B indicates the address in the file where the next record will be written as a relative address from the beginning of the file area, and the oldest record relative record number C is
Indicates the logical relative record number of the record written most recently, and the number of stored records indicates the number of records stored in the file.

(Explanation of the operation of the BL-Example. Figure 5 is a write process flow diagram, Figure 6 is a delete process flow diagram, and Figure 7 is a read process). be.

First, write processing will be explained with reference to FIG.

Here, the number of physical records of the file is n, and the access device 3 gives a write command, file number, and write record for writing, and the CPU accesses the directory zone ZD with the file number and selects the current cell. It is assumed that the image is close to the actual size.

(1) First, the CPU 1 reads the oldest record relative record number C of the cell and determines whether it is "0" or not.

C-0 indicates that no record is stored in the corresponding file as shown in Figure 8 (8). Therefore, although this record is the oldest record,
+1).

(2) Next, the CPUI sequentially outputs the next registered record storage address B to the oldest record storage address and compares them. A
If =8, it means that none of the records in FIG. 8(A) are stored or there are no empty records.
Next, the CPUI checks the storage method record count. D≠0
Otherwise, since there are no free records, CPtJl notifies the access device 3 of an error that there are no free records.

If the access device 3 also wants to write data, it sends a delete command to delete the oldest record as shown in FIG. 6, and then issues a write command again to write the data.

■On the other hand, if CPU1 determines that A≠B or D=O,
Since there is an empty record in the file, 2, the given data is written from the next registered record storage address B.

Furthermore, the CPUI sets the next registration record storage address B to (
B+r (record length)), and the storage method record count is updated to (D+1.).

0 Next, the CPU checks whether the next registered record storage address B is equal to the file size F, that is, checks whether n records have been stored in the file, and if B=F, sets B to address “0” for recycling. Update to and exit.
If it is not Bf-F, the process ends because up to n records have not been stored.

This operation will be explained with reference to FIGS. 8(A) to 8(C).
Immediately after file creation, Δ=B=C=D=0, and the 8th
As shown in Figure (A), the active record area is the logical relative record from the roux code to the nth record, and all records are empty records.

In this state, as shown in FIG. 8(B), when P records (P〈n) are written, the active record area is 1 to 1.
As the nth record remains, the oldest record is 1'' (therefore, A=0, C=1), and the latest record is P (therefore, B
is the relative address of record P+1), and the number of storage method records is P. At this time, the empty records are the (P+1)th record to the nth record.

Next, q more (P+q>n) from the state in Figure 8 (B)
When you write a record, it will be recycled and shown in Figure 8 (
As shown in C), the active record area is (P+q-n+
1) From the record number to the (P+q) record number.

At this time, the oldest record is the (P+q-n+1)th record (therefore, A is the relative address of the record, C=P+
q-n+1), the latest record is the (1)+(1)th record (therefore, B is the relative address of the (q-n) record), the number of storage method records is n, and the number of empty records is zero.

Next, the delete process will be explained with reference to FIG.

When deleting, the delete command, file number, and relative record number l to be deleted are stored in the access device 3.
given from.

■First, CPU l reads the number of storage method records from the cell corresponding to the file number, and if D=0,
) (Since not a single record is stored and there is no record to be deleted, the access device 3 is notified of a no valid record error.

(2) On the other hand, if D≠0, then the CPUI compares the designated relative record number a with the oldest record relative record number C, since the record is stored.

This is to start the file from the oldest record, and to prevent the file from becoming in a state where intermediate records are deleted.

Therefore, if l≠C, cput does not designate deletion of the oldest record, and therefore notifies the access device 3 of an error that the designated record is not the oldest record.

■On the other hand, if X=C, in order to delete the oldest record, the CPUI deletes the oldest record relative record number C (C
+1) and further update the storage method record count to (D-
Update to 1).

Therefore, the area of record number p is released.

■Next, CI) U1 checks whether the oldest record relative record number C has overflowed, that is, exceeds the maximum value of the allocated logical relative record numbers (“65535′ in Figure 8), and if it has exceeded it, , C is updated to 1.

(2) Furthermore, the CPU t updates the oldest record storage address to (Δ1' (record length)), and compares the next address A with the file size F.

If CP[Jl is A=F, it ends as 8-0 to return the oldest record storage address to the beginning of the file, and 8≠
If it is F, just exit.

This operation will be explained with reference to FIG. 8(D).
If one record (r<n) is deleted from the oldest record in state C), the active record area advances by r records, and becomes the (P+q-n+l+r) record opening to the (p+q+r) record opening. .

At this time, the oldest record is the (P+Q-n+1±")th record (that is, C=P+q-n+1+r), and the latest record is the 8th record.
Same as figure (C), it becomes (+'+q) record opening,
The number of stored records is (n-r), and the number of empty records is (P+14-1).
) It becomes an r record up to the record opening.

Furthermore, read processing will be explained with reference to FIG.

For reading, the access device 3 gives a read command, a file number, and a read relative record number m.

(1) First, the CPU 1 reads the number of stored records from the cell corresponding to the file number and checks whether it is zero. D=0
If so, as shown in FIG. 8(A), not a single valid record is stored and there is no valid record to read, so CPU t notifies the access device 3 of an error stating that it is an empty record. .

(2) On the other hand, if the CPU determines that D≠0, it calculates the latest record number Cr in the active record area, that is, the record number immediately before the record indicated at the next registered record storage address B, using the following formula.

That is, the next registered record storage address B and the oldest record storage address A are compared, and if B>8, C'=C+((
[3-A)/r-1) ・-=-<1) If B≦A, then C' = C+ ((B-A+F)/r-N-=-(21
From this, the record number C' of the latest record is determined.

(2) Since the area between the latest record number C' and the oldest record relative record number C is a valid record, CPUI compares it with the given read relative record number m.

If the CPUI determines that C≦m≦C', it assumes that a relative record number outside the active area or an empty record has been specified, and notifies the access device 3 of this error.

(2) On the other hand, if the CPU determines that C≦m≦C', it determines that the record number of a valid record is specified, and calculates the relative address M of the corresponding record number m using the following formula.

M= ((m-1)Xr/r) −・・−
(3) Then,'ζ, the CPU 1 reads the data corresponding to the code from the obtained relative address M, transmits it to the access device 3 as a response, and completes the read process.

Such recycling control is performed for files in which the file organization of cells in FIGS. 2 and 3 specifies a circular format, such as the business information files 1 to 5 in FIG. For files in which it is not desirable to delete (erase) records once they have been written, such a circular form is not specified, and therefore, the VA ring of the file is not used.

On the other hand, for M history files such as files 6 to n in FIG. 2, by specifying the 'dfi 1W type, files are used cyclically, and the CPU 1 performs command access processing by These are determined by checking the file organization column of the cell corresponding to the file number. Therefore, VA circular files and non-circular files can coexist in the business zone 2Δ.

In this way, the recycling control information A, T3 . Files with wJ ring organization specified by C and D can be used cyclically, and in write processing, it is possible to determine whether there are empty records by counting the number of stored records, that is, whether or not they can be written.Furthermore, in delete processing, the oldest By deleting it from the record, you can prevent missing records and make effective use of the physical file area.

(C1 Description of other embodiments In the above embodiment, the directory is structured as shown in Figure 3, but other structures may be used, and history files are used in a circular manner. Files for other purposes may be used in a circular manner as needed.

Although the present invention has been described above using examples, the present invention can be modified in various ways according to the gist of the present invention, and these are not excluded from the present invention. [Effects of the Invention] As explained above, according to the present invention, files created in the memory of an IC card can be reused, so files whose capacity is physically limited can be logically expanded and used. This has the effect of making it possible to use the file effectively.

In addition, since the IC card has recycling control information and the processor in the IC card controls file recycling, the access device 3 has the effect of being able to access files without being aware of the physical capacity of the file. In particular, IC cards, which are not fixed to the access device 3 but are carried by the user and set in various access devices 3 according to the user's needs, place a burden on the access device 3. The IC card can be used for file recycling without any cost and can be used with any access device 3, greatly expanding the usage range of the IC card.

[Brief explanation of drawings]

Figure 1 is a diagram explaining the principle of the present invention, Figure 2 is a configuration diagram of an embodiment of the invention, Figure 3 is a detailed configuration diagram of the directory configured in Figure 2, and Figure 4 is recycling control configured in Figure 3. An explanatory diagram of the information, FIG. 5 is a write processing flow diagram for the configuration in FIG. 2, FIG. 6 is a delete processing flow diagram for the configuration in FIG. 2, FIG. 7 is a read processing flow diagram for the configuration in FIG. 2, and FIG. 8 9 is an explanatory diagram of the file recycling operation according to the present invention, FIG. 9 is an explanatory diagram of the prior art, and FIG. 10 is an explanatory diagram of the problems of the prior art. In the figure, 1-processor, 2-memory, 3-access device, ZΔ...business area, ZD...directory, 20--recycling control information, 21-file.

Claims (1)

[Claims] An IC card that includes a processor (1) and a memory (2), is set in an access device (3), and inputs and outputs data to and from the access device (3), comprising: Business area (for storing files in memory (2)
ZA) and a directory (ZD) for area management of the file, and control information for circulating and using the file is provided in the directory (ZD), and the processor (1) physically A file control method for an IC card, characterized in that the file storing n records is used cyclically using the control information.