It does not describe these algorithms. It does not cover the internal implementation within the card or the outside world. It gives the identifier, name, description, format, coding and layout of each DE and defines the means of retrieval of DEs from the card. Annexes are provided that give examples of operations related to digital signatures, certificates and the import and export of asymmetric keys. The choice and conditions of use of cryptographic mechanisms may affect card exportability.
|Published (Last):||6 February 2005|
|PDF File Size:||10.42 Mb|
|ePub File Size:||12.57 Mb|
|Price:||Free* [*Free Regsitration Required]|
The MF is mandatory. The other DFs are optional. Figure 1 illustrates an example of the logical file organization in a card. In order to select unambiguously any file by its identifier, all EFs and DFs immediately under a given DF shall have different file identifiers. Referencing by path - Any file may be referenced by a path concatentation of file identifiers. The path begins with the identifier of the MF or of the current DF and ends with the identifier of the file itself.
Between those two identifiers, the path consists of the identifiers of the successive parent DFs if any. The order of the file identifiers is always in the direction parent to child. The path allows an unambiguous selection af any file from the MF or from the current DF. Referencing by short EF identifier - Any EF may be referenced by a short EF identifier coded on 5 bits valued in the range from 1 to Short EF identifiers connot be used in a path or as a file identifier e.
In order to select unambiguously by DF name e. The following structures of EFs are defined : Transparent structure - The EF is seen at the interface as a sequence of data units. Record structure - The EF is seen at the interface as a sequence of individually identifiable records. The following attributes are defined for EFs structured in records : Size of the records: either fixed or variable Organization of the records: either as a sequence linear structure or as a ring cyclic structure.
The card shall support at least one of the following four methods for structuring EFs : Transparent EF. Linear EF with record of fixed size. Linear file with records of variable size. Cyclic EF with records of fixed size. Figure 2 shows those for EF structures.
Data is considered to be stored in a single continuous sequence of records within an EF of record structure or of data units within an EF of transparent structure.
Reference to a record or to a data unit outside an EF is an error. Data referencing method, record numbering method and data unit size are EF-dependent features. When the card provides indications in several places, the indication valid for a given EF is the closest one to that EF within the path from the MF to that EF.
Referencing by record identifier shall induce the management of a record pointer. Referencing by record number shall not affect the record pointer.
Referencing by record identifier - Each record identifier is provided by an application. Within an EF of record structure, records may have the same record identifier, in which case data contained in the records may be used for discriminating between them.
Each time a reference is made with a record identifier, an indication shall specify the logical position of the target record the first or last occurrence, the next or previous occurrence relative to the record pointer : Within each EF of linear structure, the logical positions shall be sequentially assigned when writing or appending i.
Therefore the first created record is in the first logical position. Within each EF of cyclic structure, the logical positions shall be sequentially assigned in the opposite order, i.
The following additional rules are defined for linear structures and for cyclic structures : The first occurrence shall be the record with the specified identifier and in the first logical position; the last occurrence shall be the record with the specified identifier and in the last logical position. When there is no current record, the next occurrence shall be equivalent to the first occurrence. The previous occurrence shall be equvalent to the last occurrence. When there is a current record, the next occurrence shall be the closest record with the specified identifier but in a greater logical position than the current record.
The previous occurrence shall be the closest record with the specified identifier but in a smaller logical position than the current record. Referencing by record number - Within each EF of record structure, the record numbers are unique and sequential : Within each EF of linear structure, the record numbers shall be sequentially assigned when writing or appending, i.
Therefore the first record record number one, 1 is the first created record. Within each EF of cyclic structure, the record numbers shall be sequentially assigned in the opposite order, i.
It is an unsigned integer, limited to either 8 or 15 bits according to an option in the respective command. Valued to 0 for the first data unit of the EF, the offeset is incremented by 1 for every subsequent data unit.
By default, i. NOTES An EF of record structure may support data unit referencing and in case it does, data units may contain structural information along with data, e. Within an EF of record structure, data unit referencing may not provide the intended result because the storage order of the records in the EF is not known, e.
The smart card is carried by an individual and is periodically utilized in various equipment configurations to achieve the results or obtain the services provided by those configurations. In other cases, besides authenticating identity, the smart card may carry additional information needed by the application. For example, in financial debit and credit applications, the smart card may carry an account number or numbers , which are to be accessed in backend servers involved in the application. This translates into a situation of two application-level programs running on peer-level computers needing to communicate with each other.
Subscribe to RSS
The MF is mandatory. The other DFs are optional. Figure 1 illustrates an example of the logical file organization in a card. In order to select unambiguously any file by its identifier, all EFs and DFs immediately under a given DF shall have different file identifiers. Referencing by path - Any file may be referenced by a path concatentation of file identifiers.
The bits 4 and 8 are used for Vpp control which will not be discussed further here. The node address byte allows the use of multiple logical channels where required otherwise both addresses should be set to zero. The receive - ready block is used as an acknowledgment when the protocol is sending data as a sequence of chained blocks. The supervising block is used to establish control parameters and to effect a resynchronisation or abort status as the result of some error condition. The information block also acts as an acknowledgement byte in the non chaining mode. The LEN byte indicates the number of bytes if any in the information field of the frame. Its allowed range of values are from 00 - FE hex.